Reachable set estimation of discrete-time switched singular systems

This paper is concerned with the reachable set estimation problem for discrete-time switched singular systems. Our goal is to check whether there exists a bounded set that contains all the states trajectories under zero initial conditions. First, a sufficient condition is established in terms of linear matrix inequality (LMI) to guarantee that the reachable set of discrete-time switched singular system is admissible and bounded by the intersection of ellipsoids. Second, two special cases of discrete-time switched singular systems is studied. Finally, an numerical example is provided to demonstrate the effectiveness of the proposed methods.