On set-theoretic methods in tracking MPC

Abstract

The construction of an enlarged terminal constraint set, which consequently implies a larger domain of attraction, is presented for the dual-mode control paradigm for tracking problems. Subsequently, a receding horizon optimal control problem is formulated as a Quadratic Programming problem, which can be efficiently solved on-line. The resulting formulation allows tracking to a set of admissible steady-state/input pairs, thereby, promoting on-line change of economic objectives, by the selection of different operational set-points, whilst, guaranteeing stability and feasibility of the underlying problem. Proof of asymptotic convergence and stability, using Lyapunov arguments, is given for this enlarged set of admissible steady-states.