4.7 Article

This paper deals with model predictive control (MPC) for nonlinear systems using linear-parameter varying (LPV) embedding of the nonlinear dynamics (LPVMPC). The proposed LPVMPC can incorporate information of the future evolution of the scheduling parameter over the MPC prediction horizon with uncertainty bounds, which are used to construct anticipated scheduling tubes for robustification. Therefore, this approach is less conservative than the methods that only consider knowledge of the bounds on the scheduling parameter's rate of variation. The scheduling tubes are employed to synthesize online general polytopic invariant state tubes. The optimization problem of the proposed LPVMPC is a single quadratic program. Recursive feasibility is proven. A numerical example is presented for demonstrating the effectiveness of the proposed LPVMPC algorithm compared to nonlinear MPC and other standard approaches. © 2023 Elsevier Ltd. All rights reserved.

Journal

AUTOMATICA
Volume 160, Issue -, Pages -

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2023.111432

Keywords

Model predictive control; Linear parameter -varying systems; Constrained systems

Ask authors/readers for more resources

This paper investigates the use of linear-parameter varying (LPV) embedding of nonlinear dynamics for model predictive control (MPC). The proposed LPVMPC incorporates information of the future evolution of the scheduling parameter with uncertainty bounds, and constructs anticipated scheduling tubes for robustification. Numerical examples demonstrate the effectiveness of the LPVMPC algorithm compared to nonlinear MPC and other standard approaches.
This paper deals with model predictive control (MPC) for nonlinear systems using linear-parameter varying (LPV) embedding of the nonlinear dynamics (LPVMPC). The proposed LPVMPC can incorporate information of the future evolution of the scheduling parameter over the MPC prediction horizon with uncertainty bounds, which are used to construct anticipated scheduling tubes for robustification. Therefore, this approach is less conservative than the methods that only consider knowledge of the bounds on the scheduling parameter's rate of variation. The scheduling tubes are employed to synthesize online general polytopic invariant state tubes. The optimization problem of the proposed LPVMPC is a single quadratic program. Recursive feasibility is proven. A numerical example is presented for demonstrating the effectiveness of the proposed LPVMPC algorithm compared to nonlinear MPC and other standard approaches.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available