Abstract

This paper deals with the stability of switched linear systems under arbitrary switching sequences. To do this we approximate a switched system by a special case of a polytopic system. This is extended to the study of infinitely fast (or Zeno) switching by a statistical argument that makes possible to predict the behavior of the states of the system with probability one (w.p.1). From here, Lyapunov's theory is used to obtain Linear Matrix Inequality (LMI) restrictions to test stability of the system. These conditions include, as a special case, the Common Quadratic Lyapunov Function (CQLF) criterion and, therefore, are less restrictive although still easy to implement in any specialized LMI software. The paper is complemented with the study of a recurrent example on the area that does not accept a CQLF but it is stable nevertheless. Further examples including Zeno behavior of the system are also presented. (C) 2017 Published by Elsevier Ltd on behalf of European Control Association.