Tree-Based Algorithms for the Stability of Discrete-Time Switched Linear Systems Under Arbitrary and Constrained Switching

摘要

We present a direct approach to study the stability of discrete-time switched linear systems that can be applied to arbitrary switching, as well as when switching is constrained by a switching automaton. We explore the tree of possible matrix products, by