In this paper we present a new method to reduce the computational complexity of model predictive control algorithms with online optimization. The formulation of the predictive equations is performed in the continuous-time domain, while the control inputs are parametrized as piecewise constant functions, with less steps than the control horizon. The continuous-time formulation permits the arbitrary choice of the prediction and control time-instants, disregarding the sampling period of the system, and this improves the goodness of the approximation. Moreover, since the inputs are forced to be piecewise constant, the resulting controller can be directly implemented in discretetime. A tuning method for the choice of the prediction and control instants is proposed, minimizing the deviation with respect to the non-approximated controller. Numerical results show the effectiveness of this strategy against other methods with same reduction of computational complexity.

Fast MPC with staircase parametrization of the inputs: Continuous input blocking

Faroni, Marco;Beschi, Manuel;Visioli, Antonio
2017-01-01

Abstract

In this paper we present a new method to reduce the computational complexity of model predictive control algorithms with online optimization. The formulation of the predictive equations is performed in the continuous-time domain, while the control inputs are parametrized as piecewise constant functions, with less steps than the control horizon. The continuous-time formulation permits the arbitrary choice of the prediction and control time-instants, disregarding the sampling period of the system, and this improves the goodness of the approximation. Moreover, since the inputs are forced to be piecewise constant, the resulting controller can be directly implemented in discretetime. A tuning method for the choice of the prediction and control instants is proposed, minimizing the deviation with respect to the non-approximated controller. Numerical results show the effectiveness of this strategy against other methods with same reduction of computational complexity.
2017
978-1-5090-6505-9
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/11379/501690
 Attenzione

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

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 8
social impact