Who needs QP for linear MPC anyway? (Q1614310): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0005-1098(01)00263-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048274846 / rank
 
Normal rank

Latest revision as of 10:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Who needs QP for linear MPC anyway?
scientific article

    Statements

    Who needs QP for linear MPC anyway? (English)
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers