Brief paper: Oops! I cannot do it again: Testing for recursive feasibility in MPC

Authors:
Johan Löfberg
Affiliations:
-
Venue:
Automatica (Journal of IFAC)
Year:
2012

Citing 6
Cited 0

A branch and bound algorithm for the bilevel programming problem

SIAM Journal on Scientific and Statistical Computing
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

SIAM Review
A polyhedral branch-and-cut approach to global optimization

Mathematical Programming: Series A and B
Brief paper: Controlled invariant feasibility - A general approach to enforcing strong feasibility in MPC applied to move-blocking

Automatica (Journal of IFAC)
Survey paper: Set invariance in control

Automatica (Journal of IFAC)
Survey Constrained model predictive control: Stability and optimality

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.14

Visualization

Abstract

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.