Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This paper considers linear discrete-time systems with additive, bounded, disturbances subject to hard control input bounds and a stochastic constraint on the amount of state-constraint violation averaged over time. The amount of violations is quantified by a loss function and the averaging can be weighted, corresponding to exponential forgetting of past violations. The freedom in the choice of the loss function makes this formulation highly flexible -- for instance, probabilistic constraints, or integrated chance constraints, can be enforced by an appropriate choice of the loss function. For the type of constraint considered, we develop a recursively feasible receding horizon control scheme exploiting the averaged-over-time nature by explicitly taking into account the amount of past constraint violations when determining the current control input. This leads to a significant reduction in conservatism. As a simple extension of the proposed approach we show how time-varying state-constraints can be handled within our framework. The computational complexity (online as well as offline) is comparable to existing model predictive control schemes. The effectiveness of the proposed methodology is demonstrated by means of a numerical example from building climate control.
Giancarlo Ferrari Trecate, Danilo Saccani, Melanie Nicole Zeilinger
David Atienza Alonso, Tomas Teijeiro Campo, Una Pale
David Atienza Alonso, Amir Aminifar, Alireza Amirshahi, José Angel Miranda Calero, Jonathan Dan