Who needs QP for linear MPC anyway? (Q1614310)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Who needs QP for linear MPC anyway? |
scientific article; zbMATH DE number 1797066
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Who needs QP for linear MPC anyway? |
scientific article; zbMATH DE number 1797066 |
Statements
Who needs QP for linear MPC anyway? (English)
0 references
5 September 2002
0 references
An approach which offers an attractive alternative to the quadratic programming (QP) based model predictive control (QPMPC) is proposed. The numerical advantages of Newton-Raphson MPC (NRMPC) over QPMPC are outlined, and the extension of NRMPC (ENRMPC) is derived. The ENRMPC accepts univariate optimization outside the ellipsoidal set thereby removing most of the conservatism incurred through the use of ellipsoidal rather than maximal polyhedral sets. The results of Monte Carlo simulations on the large number of constrained state-space models show a performance indistinguishable from the QPMPC one and a computational cost comparable to the NRMPC one.
0 references
predictive control
0 references
constraints
0 references
optimization
0 references
quadratic programming
0 references
invariant sets
0 references
Newton-Raphson MPC
0 references
ellipsoidal set
0 references
Monte Carlo simulations
0 references
0 references
0 references