Blocking parameterizations for improving the computational tractability of affine disturbance feedback MPC problems
METADATA ONLY
Loading...
Author / Producer
Date
2009
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can result in computationally intractable problems. So-called move-blocking is an effective method of reducing the computational complexity of MPC problems. Unfortunately move-blocking precludes the use of terminal constraints as a means of enforcing strong feasibility of MPC problems. Thus move-blocking MPC has traditionally been employed without rigorous guarantees of constraint satisfaction. A method for enforcing strong feasibility of nominal move-blocking MPC problems was recently developed. The contribution of this paper is to generalize this method and employ it for the purpose of enforcing strong feasibility of move-blocking affine disturbance feedback robust MPC problems. Furthermore the effectiveness of different disturbance-feedback blocking strategies is investigated by means of a numerical example.
Permanent link
Publication status
published
External links
Editor
Book title
Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
Journal / series
Volume
Pages / Article No.
7381 - 7386
Publisher
IEEE
Event
Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference (CDC/CCC 2009)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Affine disturbance feedback; Controlled invariant feasibility; Model predictive control; Robust control