Stabilizing Graph-dependent Switched Systems
Abstract
We give sufficient conditions for stability of a continuous-time linear switched system consisting of finitely many subsystems. The switching between subsystems is governed by an underlying graph. The results are applicable to switched systems having some or all non-Hurwitz subsystems. We also present a slow-fast switching mechanism on subsystems comprising simple loops of underlying graph to ensure stability of the switched system.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.