Maximal controllability via reduced parameterisation model predictive control

Research Doctorate - Doctor of Philosophy (PhD)This dissertation presents some new approaches to addressing the main issues encountered by practitioners in the implementation of linear model predictive control(MPC), namely, stability, feasibility, complexity and the size of the region of attraction. When stability guaranteeing techniques are applied nominal feasibility is also guaranteed. The most common technique for guaranteeing stability is to apply a special weighting to the terminal state of the MPC formulation and to constrain the state to a terminal region where certain properties hold. However, the combination of terminal state constraints and the complexity of the MPC algorithm result in regions of attraction that are relatively small. Small regions of attraction are a major problem for practitioners. The main approaches used to address this issue are either via the reduction of complexity or the enlargement of the terminal region. Although the ultimate goal is to enlarge the region of attraction, none of these techniques explicitly consider the upper bound of this region. Ideally the goal is to achieve the largest possible region of attraction which for constrained systems is the null controllable set. For the case of systems with a single unstable pole or a single non-minimum phase zero their null controllable sets are defined by simple bounds which can be thought of as implicit constraints. We show in this thesis that adding implicit constraints to MPC can produce maximally controllable systems, that is, systems whose region of attraction is the null controllable set. For higher dimensional open-loop unstable systems with more than one real unstable mode, the null controllable sets belong to a class of polytopes called zonotopes. In this thesis, the properties of these highly structured polytopes are used to implement a new variant of MPC, which we term reduced parameterisation MPC (RP MPC). The proposed new strategy dynamically determines a set of contractive positively invariant sets that require only a small number of parameters for the optimisation problem posed by MPC. The worst case complexity of the RP MPC strategy is polylogarithmic with respect to the prediction horizon. This outperforms the most efficient on-line implementations of MPC which have a worst case complexity that is linear in the horizon. Hence, the reduced complexity allows the resulting closed-loop system to have a region of attraction approaching the null controllable set and thus the goal of maximal controllability