.png){kind=icon}
Return
Oops! I cannot do it again: Testing for recursive feasibility in MPC
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2011.12.003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One of the most fundamental problems in model predictive control (MPC) is the lack of guaranteed stability and feasibility. It is shown how Farkas' Lemma in combination with bilevel programming and disjoint bilinear programming can be used to search for problematic initial states which lack recursive feasibility, thus invalidating a particular MPC controller. Alternatively, the method can be used to derive a certificate that the problem is recursively feasible. The results are initially derived for nominal linear MPC, and thereafter extended to the additive disturbance case. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Predictive control
Constrained control
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveControlled invariant feasibility - A general approach to enforcing strong feasibility in MPC applied to move-blocking.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSaveShareSaveSNOPT: An SQP algorithm for large-scale constrained optimization (Reprinted from SIAM Journal Optimization, vol 12, pg 979-1006, 2002)SIAM REVIEW
SIAM REVIEWIF6.1
PREAI
ShareSave
View more