This paper concerns the stability analysis problem of discrete linear systems with state saturation using a saturation-dependent Lyapunov functional. We introduce a free matrix characterized by the sum of the absolute...This paper concerns the stability analysis problem of discrete linear systems with state saturation using a saturation-dependent Lyapunov functional. We introduce a free matrix characterized by the sum of the absolute value of each elements for each row less than 1, which makes the state with saturation constraint reside in a convex polyhedron. A saturation-dependent Lyapunov functional is then designed to obtain a sufficient condition for such systems to be globally asymptotically stable. Based on this stability criterion, the state feedback control law synthesis problem is also studied. The obtained results are formulated in terms of bilinear matrix inequalities that can be solved by the presented iterative linear matrix ineoualitv algorithm. Two numerical examoles are used to demonstrate the effectiveness of the nronosed method_展开更多
基金supported by the National Natural Science Foundation of China(Nos.60904011,61004034,61104016)the Doctoral Fund of Ministry of Education of China(No.20093227120010)+1 种基金the Natural Science Foundation of Jiangsu Province,China(No.BK2011465)the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions(No.201106)
文摘This paper concerns the stability analysis problem of discrete linear systems with state saturation using a saturation-dependent Lyapunov functional. We introduce a free matrix characterized by the sum of the absolute value of each elements for each row less than 1, which makes the state with saturation constraint reside in a convex polyhedron. A saturation-dependent Lyapunov functional is then designed to obtain a sufficient condition for such systems to be globally asymptotically stable. Based on this stability criterion, the state feedback control law synthesis problem is also studied. The obtained results are formulated in terms of bilinear matrix inequalities that can be solved by the presented iterative linear matrix ineoualitv algorithm. Two numerical examoles are used to demonstrate the effectiveness of the nronosed method_
