Volume 31, Issue 18 pp. 9619-9651
RESEARCH ARTICLE

A fast dissipative robust nonlinear model predictive control procedure via quasi-linear parameter varying embedding and parameter extrapolation

Marcelo Menezes Morato

Corresponding Author

Marcelo Menezes Morato

Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, Florianópolis, Brazil

Univ. Grenoble-Alpes, CNRS, Grenoble INP (Institute of Engineering), GIPSA-Lab, Grenoble, France

Correspondence Marcelo Menezes Morato, DAS/CTC/UFSC, Trindade, Caixa Postal 476, Florianópolis, SC 88040-900, Brazil.

Email: [email protected]

Search for more papers by this author
Julio E. Normey-Rico

Julio E. Normey-Rico

Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, Florianópolis, Brazil

Search for more papers by this author
Olivier Sename

Olivier Sename

Univ. Grenoble-Alpes, CNRS, Grenoble INP (Institute of Engineering), GIPSA-Lab, Grenoble, France

Search for more papers by this author
First published: 28 September 2021
Citations: 2
Abbreviations: LPV, linear parameter varying; LTI, linear time-invariant; MPC, model predictive control.

Funding information: Conselho Nacional de Desenvolvimento Científico e Tecnológico, 304032–2019−0; ITEA, 15016 EMPHYSIS

Abstract

In this article, a robust model predictive control (MPC) procedure for quasi-linear parameter varying (qLPV) systems is proposed. The novelty resides in considering a recursive extrapolation algorithm to estimate the values of the scheduling parameters along the prediction horizon urn:x-wiley:rnc:media:rnc5788:rnc5788-math-0001, which fastens the sluggish performances achieved with the robust qLPV MPCs from the literature. The bounds on the estimation errors of the scheduling parameters through urn:x-wiley:rnc:media:rnc5788:rnc5788-math-0002 are taken into account by the robust MPC, which solves an online min-max problem: first, a constrained convex program is resolved in order to determine the worst-case bound on the cost function and, subsequently, a second constrained quadratic program is solved to minimize this worst-case cost function with respect to a control sequence vector. Since the bounds on the estimation error for the scheduling parameters are usually much smaller than the bounds on the actual scheduling parameter, the conservativeness of the solution is quite reduced. Recursive feasibility and stability of the proposed algorithm are demonstrated with dissipativity arguments given in the form of a linear matrix inequality remedy, which determines the zone of attraction for which input-to-state stability is ensured. The nonlinear temperature regulation problem of a flat solar collector is considered as a case study. Using a realistic simulation benchmark, the proposed technique is compared to other robust min-max LPV MPC algorithms from the literature, proving itself efficient while achieving good performances.

CONFLICT OF INTEREST

The authors declare no potential conflict of interests.

DATA AVAILABILITY STATEMENT

The data that support the findings of this study are available from the corresponding author upon reasonable request.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.