This paper is concerned with the design of state-feedback control laws for linear time invariant systems that are subject to stochastic additive disturbances, and probabilistic constraints on the states. The design is based on a stochastic Model Predictive Control (MPC) approach, for which a randomization technique is applied in order to find a sub-optimal solution to the underlying, generally non-convex chance constrained program. The proposed method yields a linear or quadratic program to be solved online at each time step, whose complexity is the same as that of a nominal MPC problem, i.e. if no disturbances were present. Furthermore, it is shown how the quality of the sub-optimal solution can be improved through a procedure for the removal of sampled constraints a-posteriori, at the price of increased online computation efforts. Finally, this randomized approach can be combined with further constraint tightening, in order to guarantee recursive feasibility for the closed loop system.

Randomized Model Predictive Control for Stochastic Linear Systems / G., Schildbach; Calafiore, Giuseppe Carlo; L., Fagiano; M., Morari. - STAMPA. - (2012), pp. 417-422. (Intervento presentato al convegno American Control Conference tenutosi a Montreal nel June 27-29, 2012).

Randomized Model Predictive Control for Stochastic Linear Systems

CALAFIORE, Giuseppe Carlo;
2012

Abstract

This paper is concerned with the design of state-feedback control laws for linear time invariant systems that are subject to stochastic additive disturbances, and probabilistic constraints on the states. The design is based on a stochastic Model Predictive Control (MPC) approach, for which a randomization technique is applied in order to find a sub-optimal solution to the underlying, generally non-convex chance constrained program. The proposed method yields a linear or quadratic program to be solved online at each time step, whose complexity is the same as that of a nominal MPC problem, i.e. if no disturbances were present. Furthermore, it is shown how the quality of the sub-optimal solution can be improved through a procedure for the removal of sampled constraints a-posteriori, at the price of increased online computation efforts. Finally, this randomized approach can be combined with further constraint tightening, in order to guarantee recursive feasibility for the closed loop system.
2012
9781457710940
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/2498595
 Attenzione

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