Stability analysis of switched linear systems defined by graphs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)
165 Downloads (Pure)

Abstract

We present necessary and sufficient conditions for global exponential stability for switched discrete-time linear systems, under arbitrary switching, which is constrained within a set of admissible transitions. The class of systems studied includes the family of systems under arbitrary switching, periodic systems, and systems with minimum and maximum dwell time specifications. To reach the result, we describe the set of rules that define the admissible transitions with a weighted directed graph. This allows to express the system dynamics as a time invariant difference inclusion. In turn, a modified version of the forward reachability set mapping is utilized to analyze global exponential stability. The developed framework leads to the establishment of an iterative stability verification algorithm.
Original languageEnglish
Title of host publication2014 IEEE 53rd Annual Conference on Decision and Control
Publisher IEEE
Pages5451-5456
ISBN (Electronic)978-1-4673-6090-6
ISBN (Print)978-1-4799-7746-8
DOIs
Publication statusPublished - 12 Feb 2015

Publication series

NameIEEE Conference on Decision and Control
PublisherIEEE
ISSN (Print)0191-2216

Fingerprint Dive into the research topics of 'Stability analysis of switched linear systems defined by graphs'. Together they form a unique fingerprint.

  • Cite this

    Athanasopoulos, N., & Lazar, M. (2015). Stability analysis of switched linear systems defined by graphs. In 2014 IEEE 53rd Annual Conference on Decision and Control (pp. 5451-5456). (IEEE Conference on Decision and Control). IEEE . https://doi.org/10.1109/CDC.2014.7040241