Premium
Reachable Set Estimation for Discrete‐Time Singular Systems
Author(s) -
Li Jiangrong,
Feng Zhiguang,
Zhang Changzhu
Publication year - 2017
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.1484
Subject(s) - discrete time and continuous time , intersection (aeronautics) , mathematics , bounded function , ellipsoid , linear matrix inequality , weighting , set (abstract data type) , control theory (sociology) , lyapunov function , matrix (chemical analysis) , mathematical optimization , computer science , mathematical analysis , nonlinear system , control (management) , engineering , medicine , statistics , physics , materials science , astronomy , artificial intelligence , composite material , radiology , programming language , aerospace engineering , quantum mechanics
This paper is concerned with the problem of reachable set estimation for discrete‐time singular systems with bounded input disturbances. Based on the Lyapunov method, a new sufficient condition is established in terms of linear matrix inequality (LMI) to guarantee that the reachable set of discrete‐time singular system is bounded by the intersection of ellipsoids. Then the result is extended to the problem for discrete‐time singular systems with time‐varying delay by utilizing the delay‐dependent approach and free weighting matrices. Two numerical examples are provided to demonstrate the effectiveness of the obtained results proposed in this paper.