This article deals with input-to-state stability (ISS) of discrete-time switched systems. Given a family of nonlinear systems with exogenous inputs, we present a class of switching signals under which the resulting switched system is ISS. We allow non-ISS systems in the family and our analysis involves graph-theoretic arguments. A weighted digraph is associated to the switched system, and a switching signal is expressed as an infinite walk on this digraph, both in a natural way. Our class of stabilizing switching signals (infinite walks) is periodic in nature and affords simple algorithmic construction.
- Algorithmic synthesis
- Discrete-time switched systems
- Input-to-state stability
- Weighted digraphs