.png){kind=icon}
.png){kind=icon}
Return
Efficient MPC optimization using Pontryagin's minimum principle
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.1247.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A method of solving the online optimization in model predictive control (MPC) of input-constrained linear systems is described. Using Pontryagin's minimum principle, the matrix factorizations performed by general purpose quadratic programming (QP) solvers are replaced by recursions of state and co-state variables over the MPC prediction horizon. This allows for the derivation of solvers with computational complexity per iteration that depends only linearly on the length of the prediction horizon. Parameterizing predicted input and state variables in terms of the terminal predicted state results in low computational complexity but can lead to numerical sensitivity in predictions. To avoid ill-conditioning an alternative parameterization is derived using Riccati recursions. Comparisons are drawn with the multiparametric QP solution, and the computational savings are demonstrated over generic QP solvers. Copyright (c) 2007 John Wiley & Sons, Ltd.
Keywords:
MODEL-PREDICTIVE CONTROL
SYSTEMS
Journal
IF:
3.2
Papers:
6.9K
Citations:
1.4W