Back to Search
Start Over
Tree-Based Algorithms for the Stability of Discrete-Time Switched Linear Systems Under Arbitrary and Constrained Switching
- Source :
- IEEE Transactions on Automatic Control. 64:3823-3830
- Publication Year :
- 2019
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 2019.
-
Abstract
- 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 pruning the subtrees rooted at contractions and looking for unstable repeatable products. Generically, this simple strategy either terminates with all contracting leafs—showing the system's asymptotic stability—or finds the shortest unstable and repeatable matrix product. Although it behaves in the worst case as the exhaustive search, we show that its performance is greatly enhanced by measuring contractiveness w.r.t. sum-of-squares polynomial norms, optimized to minimize the largest expansion among the system's modes.
- Subjects :
- 0209 industrial biotechnology
Polynomial
Asymptotic stability
Computer science
Linear system
Linear matrix inequalities
Brute-force search
Linear systems
Thermal stability
02 engineering and technology
Topology
Upper and lower bounds
Automata
Matrix multiplication
Computer Science Applications
Tree (data structure)
Matrix (mathematics)
020901 industrial engineering & automation
Switches
Upper bound
Discrete time and continuous time
Exponential stability
Control and Systems Engineering
Electrical and Electronic Engineering
Subjects
Details
- ISSN :
- 23343303 and 00189286
- Volume :
- 64
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Automatic Control
- Accession number :
- edsair.doi.dedup.....146a2b8d59202dda7bc1aec649ff4406