Efficient min–max MPC: achieving a large domain of attraction with short horizon - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Robust and Nonlinear Control Année : 2023

Efficient min–max MPC: achieving a large domain of attraction with short horizon

Résumé

This article considers the regulation problem of a constrained linear system with bounded disturbance. The objective is to overcome the offline and online problems of the standard dual-mode min–max model predictive control (MPC). The offline problem is related to the construction of a polyhedral terminal set, which is prohibitively complex especially for high order systems. We propose to replace the polyhedral set with the ellipsoidal one, which is much easier to construct. The online problem is related to the computational burden, which grows exponentially with the prediction horizon mathematical equation. We show how to employ a new terminal cost function, that results in a new min–max MPC with a large domain of attraction even with mathematical equation or mathematical equation. Hence the computational complexity is drastically reduced. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed approach.
Fichier non déposé

Dates et versions

hal-04081773 , version 1 (25-04-2023)

Identifiants

Citer

Hoaï-Nam Nguyen. Efficient min–max MPC: achieving a large domain of attraction with short horizon. International Journal of Robust and Nonlinear Control, 2023, 33 (12), pp.7020-7044. ⟨10.1002/rnc.6739⟩. ⟨hal-04081773⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More