Feasibility and Robustness

Abstract

In this chapter we consider two different but related issues. In the first part we discuss the feasibility problem, i.e., that the nominal NMPC closed-loop solutions remain inside a set on which the finite horizon optimal control problems defining the NMPC feedback law are feasible. We formally define the property of recursive feasibility and explain why the assumptions of the previous chapters, i.e., viability of the state constraint set or of the terminal constraint set ensure this property. Then we present two ways to relax the viability assumption on the state constraint set in the case that no terminal constraints are used. After a comparative discussion on NMPC schemes with and without stabilizing terminal conditions, we start with the second part of the chapter in which robustness of the closed loop under additive perturbations and measurement errors is investigated. Here robustness concerns both the feasibility and admissibility as well as the stability of the closed loop. We provide different assumptions and resulting NMPC schemes for which we can rigorously prove such robustness results and also discuss examples which show that in general robustness may fail to hold.