Despite recent advances in computing hardware and optimization algorithms, solving model predictive control (MPC) problems in real time still poses some technical challenges when long prediction and control horizons are used, due to the presence of several optimization variables and constraints. In this paper, we propose to reduce the computational burden by shortening the prediction and control horizon to a single step while preserving good closed-loop performance. This is achieved by using machine learning techniques to construct a tailored quadratic and convex terminal cost that approximates the cost-to-go function of constrained linear (possibly parameter-dependent) MPC formulations. The potentials of the proposed MPC with Learned Terminal Cost (LTC-MPC) approach is demonstrated in two numerical examples.
Learning Convex Terminal Costs for Complexity Reduction in MPC
Abdufattokhov, S.;Zanon, Mario;Bemporad, Alberto
2021-01-01
Abstract
Despite recent advances in computing hardware and optimization algorithms, solving model predictive control (MPC) problems in real time still poses some technical challenges when long prediction and control horizons are used, due to the presence of several optimization variables and constraints. In this paper, we propose to reduce the computational burden by shortening the prediction and control horizon to a single step while preserving good closed-loop performance. This is achieved by using machine learning techniques to construct a tailored quadratic and convex terminal cost that approximates the cost-to-go function of constrained linear (possibly parameter-dependent) MPC formulations. The potentials of the proposed MPC with Learned Terminal Cost (LTC-MPC) approach is demonstrated in two numerical examples.File | Dimensione | Formato | |
---|---|---|---|
Learning_Convex_Terminal_Costs_for_Complexity_Reduction_in_MPC (1).pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
383.91 kB
Formato
Adobe PDF
|
383.91 kB | Adobe PDF | Visualizza/Apri |
Learning_Convex_Terminal_Costs_for_Complexity_Reduction_in_MPC.pdf
non disponibili
Tipologia:
Versione Editoriale (PDF)
Licenza:
Nessuna licenza
Dimensione
1.12 MB
Formato
Adobe PDF
|
1.12 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.