This paper presents a novel approach to robust model predictive control (MPC) for LTI discrete time systems subject to model uncertainty and additive disturbances. By exploiting recent results in random convex programming (RCP), a randomization approach is used and it is shown that the resulting state-feedback control law achieves asymptotic closed loop stability and constraint satisfaction, up to a guaranteed level of probability that can be set arbitrarily close to one. The main advantages of the proposed approach over existing methods, either deterministic or stochastic, are: 1) a reduced conservativeness of the stability and optimality results, 2) quite general settings and mild required assumptions on the problem structure and on the characterization of the uncertainty/disturbances, 3) convexity of the optimization problem to be solved at each time step. A numerical example illustrates the features of the approach.

Robust Model Predictive Control: the Random Convex Programming approach / Calafiore, Giuseppe Carlo; Fagiano, Lorenzo. - STAMPA. - (2011), pp. 222-227. (Intervento presentato al convegno Computer-Aided Control System Design (CACSD), 2011 IEEE International Symposium on tenutosi a Denver, CO nel September 28-30, 2011) [10.1109/CACSD.2011.6044558].

Robust Model Predictive Control: the Random Convex Programming approach

CALAFIORE, Giuseppe Carlo;FAGIANO, LORENZO
2011

Abstract

This paper presents a novel approach to robust model predictive control (MPC) for LTI discrete time systems subject to model uncertainty and additive disturbances. By exploiting recent results in random convex programming (RCP), a randomization approach is used and it is shown that the resulting state-feedback control law achieves asymptotic closed loop stability and constraint satisfaction, up to a guaranteed level of probability that can be set arbitrarily close to one. The main advantages of the proposed approach over existing methods, either deterministic or stochastic, are: 1) a reduced conservativeness of the stability and optimality results, 2) quite general settings and mild required assumptions on the problem structure and on the characterization of the uncertainty/disturbances, 3) convexity of the optimization problem to be solved at each time step. A numerical example illustrates the features of the approach.
2011
9781457710667
9781457710674
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2428804
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo