TY - JOUR
T1 - A graph theoretic approach to input-to-state stability of switched systems
AU - Kundu, A.
AU - Chatterjee, D.
PY - 2016/5/1
Y1 - 2016/5/1
N2 - 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.
AB - 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.
KW - Algorithmic synthesis
KW - Discrete-time switched systems
KW - Input-to-state stability
KW - Weighted digraphs
UR - http://www.scopus.com/inward/record.url?scp=84981763972&partnerID=8YFLogxK
U2 - 10.1016/j.ejcon.2016.03.003
DO - 10.1016/j.ejcon.2016.03.003
M3 - Article
AN - SCOPUS:84981763972
SN - 0947-3580
VL - 29
SP - 44
EP - 50
JO - European Journal of Control
JF - European Journal of Control
ER -