In this paper, we propose a novel randomized approach to Stochastic Model Predictive Control (SMPC) for a linear system affected by a disturbance with unbounded support. As it is common in this setup, we focus on the case where the input/state of the system are subject to probabilistic constraints, i.e., the constraints have to be satisfied for all the disturbance realizations but for a set having probability smaller than a given threshold. This leads to solving at each time t a finite-horizon chance-constrained optimization problem, which is known to be computationally intractable except for few special cases. The key distinguishing feature of our approach is that the solution to this finite-horizon chance-constrained problem is computed by first extracting at random a finite number of disturbance realizations, and then replacing the probabilistic constraints with hard constraints associated with the extracted disturbance realizations only. Despite the apparent naivety of the approach, we show that, if the control policy is suitably parameterized and the number of disturbance realizations is appropriately chosen, then, the obtained solution is guaranteed to satisfy the original probabilistic constraints. Interestingly, the approach does not require any restrictive assumption on the disturbance distribution and has a wide realm of applicability.

A randomized approach to stochastic model predictive control

PRANDINI, MARIA;GARATTI, SIMONE;
2012-01-01

Abstract

In this paper, we propose a novel randomized approach to Stochastic Model Predictive Control (SMPC) for a linear system affected by a disturbance with unbounded support. As it is common in this setup, we focus on the case where the input/state of the system are subject to probabilistic constraints, i.e., the constraints have to be satisfied for all the disturbance realizations but for a set having probability smaller than a given threshold. This leads to solving at each time t a finite-horizon chance-constrained optimization problem, which is known to be computationally intractable except for few special cases. The key distinguishing feature of our approach is that the solution to this finite-horizon chance-constrained problem is computed by first extracting at random a finite number of disturbance realizations, and then replacing the probabilistic constraints with hard constraints associated with the extracted disturbance realizations only. Despite the apparent naivety of the approach, we show that, if the control policy is suitably parameterized and the number of disturbance realizations is appropriately chosen, then, the obtained solution is guaranteed to satisfy the original probabilistic constraints. Interestingly, the approach does not require any restrictive assumption on the disturbance distribution and has a wide realm of applicability.
2012
Proceedings of the 51st IEEE Conference on Decision and Control
978-1-4673-2065-8
AUT
File in questo prodotto:
File Dimensione Formato  
MPC.pdf

accesso aperto

: Pre-Print (o Pre-Refereeing)
Dimensione 102.26 kB
Formato Adobe PDF
102.26 kB Adobe PDF Visualizza/Apri

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/11311/686034
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 51
  • ???jsp.display-item.citation.isi??? 37
social impact