Feedback stabilizability of discrete-time switched linear systems under arbitrary switching is characterized exactly by feasibility of feedback-tree LMIs for some sufficiently large graph order.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Feedback stabilization of switched systems under arbitrary switching: A convex characterization
Feedback stabilizability of discrete-time switched linear systems under arbitrary switching is characterized exactly by feasibility of feedback-tree LMIs for some sufficiently large graph order.