LAUSR

Abstract In this paper, we propose an iterative approach for estimating the domains of attraction for a class of discrete-time switched systems, where the state space is divided into several disjoint regions and each region is described by polynomial inequalities. At first, we introduce the basic concepts of Multi-step state subsequence, Multi-step state subspace, Multi-step basin of attraction and Multi-step multiple Lyapunov-like function. Secondly, beginning with an initial inner estimation, a theoretical framework is proposed for estimating the domain of attraction by iteratively calculating the Multi-step multiple Lyapunov-like functions. Thirdly, notice that the Multi-step state subspaces may be empty sets such that the corresponding constraints in the theoretical framework are redundant, we propose a numerical approach based on the homotopy continuation method to pre-check the non-emptiness of the Multi-step state subspaces, and then under-approximatively realize the framework by using S-procedure and sum of squares programming. At last, we implement our iterative approach and apply it to three discrete-time switched system examples with comparisons to existing methods in the literatures. These computation and comparison results show the advantages of our method.