Reachability Realization of Switched Linear Discrete-time Systems by Means of Aperiodic Switching Paths

The paper deals with how to realize reachability for switched linear discrete-time systems via designing a switching sequence with fewer switching times than those reported in the literature. We not only propose a new constructive approach for design of switching sequences, but also reduce the number of switchings evidently. Detailed comparison between the obtained result and that reported in literature is made, which verifies the advantage of the former.