Data-driven stabilization of switched and constrained linear systems

We consider the design of state feedback control laws for both the switching signal and the continuous input of an unknown switched linear system, given past noisy input-state trajectories measurements. Based on Lyapunov–Metzler inequalities and on a matrix S-lemma, we derive data-dependent bilinear programs, whose solution directly returns a provably stabilizing controller and ensures $H_2$ or $H_{\infty }$ performance. We further present relaxations that considerably reduce the computational cost, still without requiring stabilizability of any of the switching modes. Finally, we showcase the flexibility of our approach on the constrained stabilization problem for an unknown perturbed linear system. We validate our theoretical findings numerically, demonstrating the favorable trade-off between conservatism and tractability achieved by the proposed relaxations.