Reachability realization and stabilizability of switched linear discrete-time systems☆

By Guangming Xie, Long Wang. 2003

87 citations recorded by the source corpus.

Abstract In this paper, the reachability realization of a switched linear discrete-time system, which is a collection of linear time-invariant discrete-time systems along with some maps for “switching” among them, is addressed. The main contribution of this paper is to prove that for a switched linear discrete-time system, there exists a basic switching sequence such that the reachable (controllable) state set of this basic switching sequence is equal to the reachable (controllable) state set of the system. Hence, the reachability (controllability) can be realized by using only one switching sequence. We also discuss the stabilizability of switched systems, and obtain a sufficient condition for stabilizability. Two numeric examples are given to illustrate the results.

Subfields: Control and Systems Engineering

View Paper: https://www.semanticscholar.org/paper/535b6f259c1c04e8989c025bc7b602bc3cf70533

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

  1. Paolo Bolzern
  2. Patrizio Colaneri
  3. José Claudio Geromel
  4. Esteban Abelardo Hernández-Vargas
  5. R. Middleton
  6. Franco Blanchini
  7. Uri Shaked
  8. L. I. Allerhand

Citations in the corpus