liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Oops! I cannot do it again: Testing for Recursive Feasibility in MPC
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2012 (English)In: Automatica, ISSN 0005-1098, Vol. 48, no 3, 550-555 p.Article in journal (Refereed) Published
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.

Place, publisher, year, edition, pages
Elsevier, 2012. Vol. 48, no 3, 550-555 p.
Keyword [en]
Predictive control, Constrained control
National Category
Medical and Health Sciences Control Engineering
URN: urn:nbn:se:liu:diva-76622DOI: 10.1016/j.automatica.2011.12.003ISI: 000301830800012OAI: diva2:515434

Funding Agencies|CENIIT at Linkoping University||

Available from: 2012-04-13 Created: 2012-04-13 Last updated: 2013-07-23

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Löfberg, Johan
By organisation
Automatic ControlThe Institute of Technology
In the same journal
Medical and Health SciencesControl Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 217 hits
ReferencesLink to record
Permanent link

Direct link