Characterization and Computation of Invariant Sets for Constrained Switched Systems

Ph.DDOCTOR OF PHILOSOPH

Switching tube-based MPC: characterization of minimum dwell-time for feasible and robustly stable switching

We study the problem of characterizing mode dependent dwell-times that guarantee safe and stable operation of disturbed switching linear systems in an MPC framework. We assume the switching instances are not known a-priori, but instantly at the moment of switching. We first characterize dwell-times that ensure feasible and stable switching between independently designed robust MPC controllers by means of the well established exponential stability result available in the MPC literature. Then, we employ the concept of multi-set invariance to improve on our previous results, and obtain an exponential stability guarantee for the switching closed-loop dynamics. The theoretical findings are illustrated via a numerical example

Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints

We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other smooth constraints with Lipschitz gradient. With these quadratic relaxations, a sufficient condition for set invariance is derived and it can be formulated as a set of linear matrix inequalities. Based on the sufficient condition, a new algorithm is presented with finite-time convergence to the actual maximal invariant set under mild assumptions. This algorithm can be also extended to switched linear systems and some special nonlinear systems. The performance of this algorithm is demonstrated on several numerical examples.Comment: Accepted in Automatic

Model predictive control for linear systems: adaptive, distributed and switching implementations

Thanks to substantial past and recent developments, model predictive control has become one of the most relevant advanced control techniques. Nevertheless, many challenges associated to the reliance of MPC on a mathematical model that accurately depicts the controlled process still exist. This thesis is concerned with three of these challenges, placing the focus on constructing mathematically sound MPC controllers that are comparable in complexity to standard MPC implementations. The first part of this thesis tackles the challenge of model uncertainty in time-varying plants. A new dual MPC controller is devised to robustly control the system in presence of parametric uncertainty and simultaneously identify more accurate representations of the plant while in operation. The main feature of the proposed dual controller is the partition of the input, in order to decouple both objectives. Standard robust MPC concepts are combined with a persistence of excitation approach that guarantees the closed-loop data is informative enough to provide accurate estimates. Finally, the adequacy of the estimates for updating the MPC's prediction model is discussed. The second part of this thesis tackles a specific type of time-varying plant usually referred to as switching systems. A new approach to the computation of dwell-times that guarantee admissible and stable switching between mode-specific MPC controllers is proposed. The approach is computationally tractable, even for large scale systems, and relies on the well-known exponential stability result available for standard MPC controllers. The last part of this thesis tackles the challenge of MPC for large-scale networks composed by several subsystems that experience dynamical coupling. In particular, the approach devised in this thesis is non-cooperative, and does not rely on arbitrarily chosen parameters, or centralized initializations. The result is a distributed control algorithm that requires one step of communication between neighbouring subsystems at each sampling time, in order to properly account for the interaction, and provide admissible and stabilizing control

Equivalence of switching linear systems by bisimulation

A general notion of hybrid bisimulation is proposed for the class of switching linear systems. Connections between the notions of bisimulation-based equivalence, state-space equivalence, algebraic and input–output equivalence are investigated. An algebraic characterization of hybrid bisimulation and an algorithmic procedure converging in a finite number of steps to the maximal hybrid bisimulation are derived. Hybrid state space reduction is performed by hybrid bisimulation between the hybrid system and itself. By specializing the results obtained on bisimulation, also characterizations of simulation and abstraction are derived. Connections between observability, bisimulation-based reduction and simulation-based abstraction are studied.\ud \u