The design of robust H∞ filtering problem of polytopic uncertain linear time-delay systems is addressed. The uncertain parameters are supposed to reside in a polytope. A parameter-dependent Lyapunov function approach...The design of robust H∞ filtering problem of polytopic uncertain linear time-delay systems is addressed. The uncertain parameters are supposed to reside in a polytope. A parameter-dependent Lyapunov function approach is proposed for the design of filters that ensure a prescribed H∞performance level for al ad-missible uncertain parameters, which is different from the quadratic framework that entails fixed matrices for the entire uncertainty do-main. This idea is realized by careful y selecting the structure of the matrices involved in the products with system matrices. An extended H∞ sufficient condition for the existence of robust esti-mators is formulated in terms of linear matrix inequalities, which can be solved via efficient interior-point algorithms.展开更多
基金supported by the Innovative Team Program of the National Natural Science Foundation of China(61021002)the Specialized Research Fund for the Doctoral Program of Higher Education(20122302120069)+3 种基金the Basic Research Plan in Shenzhen City(JC201105160564AJCYJ20120613135212389)the Fundamental Research Funds for the Central Universities(HIT.NSRIF.2009137)the Key Lab of Wind Power and Smart Grid in Shenzhen City(CXB201005250025A)
文摘The design of robust H∞ filtering problem of polytopic uncertain linear time-delay systems is addressed. The uncertain parameters are supposed to reside in a polytope. A parameter-dependent Lyapunov function approach is proposed for the design of filters that ensure a prescribed H∞performance level for al ad-missible uncertain parameters, which is different from the quadratic framework that entails fixed matrices for the entire uncertainty do-main. This idea is realized by careful y selecting the structure of the matrices involved in the products with system matrices. An extended H∞ sufficient condition for the existence of robust esti-mators is formulated in terms of linear matrix inequalities, which can be solved via efficient interior-point algorithms.
