Oops! I cannot do it again: Testing for Recursive Feasibility in MPC
2012 (English)In: Automatica, ISSN 0005-1098, Vol. 48, no 3, 550-555 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Elsevier, 2012. Vol. 48, no 3, 550-555 p.
Predictive control, Constrained control
Medical and Health Sciences Control Engineering
IdentifiersURN: urn:nbn:se:liu:diva-76622DOI: 10.1016/j.automatica.2011.12.003ISI: 000301830800012OAI: oai:DiVA.org:liu-76622DiVA: diva2:515434
Funding Agencies|CENIIT at Linkoping University||2012-04-132012-04-132013-07-23