On controllability and reachability of switched systems with digraph-directed switchings
- 10 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Controllability and reachability of a class of linear switched systems is investigated, where the switching signal cannot be chosen freely but have to be determined according to a switching digraph. Based on such a digraph, the systems are divided into two types: irreducible systems and reducible systems. For irreducible systems, necessary and sufficient criterion for controllability is established. It is also proved that in this case controllability is equivalent to reachability. As for reducible systems, only sufficient condition is established and it is shown that in this case controllability is not equivalent to reachability in general by two simple examples.Keywords
This publication has 5 references indexed in Scilit:
- Reachability realization and stabilizability of switched linear discrete-time systemsJournal of Mathematical Analysis and Applications, 2003
- Controllability and stabilizability of switched linear-systemsSystems & Control Letters, 2003
- Controllability and reachability criteria for switched linear systemsAutomatica, 2002
- Reachability and controllability of switched linear discrete-time systemsIEEE Transactions on Automatic Control, 2001
- Controllability and observability of hybrid systemsInternational Journal of Control, 1989