Stabilizing switching design for switched linear systems: A state-feedback path-wise switching approach

This paper addresses the problem of switching stabilization for discrete-time switched linear systems. Based on the abstraction–aggregation methodology, we propose a state-feedback path-wise switching law, which is a state-feedback concatenation from a finite set of switching paths each defined over a finite time interval. We prove that the set of state-feedback path-wise switching laws is universal in the sense that any stabilizable switched linear system admits a stabilizing switching law in this set. We further develop a computational procedure to calculate a stabilizing switching law in the set.