Data-driven switching logic design for switched linear systems

Abstract: This paper deals with stabilization of discrete-time switched linear systems when explicit knowledge of the state-space models of their subsystems is not available. Given the set of admissible switches between the subsystems, the admissible dwell times on the subsystems and a set of finite traces of state trajectories of the subsystems that satisfies certain properties, we devise an algorithm that designs periodic switching logics which preserve stability of the resulting switched system. We combine two ingredients: (a) data-based stability analysis of discrete-time linear systems and (b) multiple Lyapunov-like functions and graph walks based design of stabilizing switching logics, for this purpose. A numerical example is presented to demonstrate the proposed algorithm.