Abstract
This paper is concerned with the H ∞ filtering problem for polynomial systems. By means of Lyapunov theory and matrix inequality techniques, sufficient conditions are first obtained to ensure that the filtering error system is asymptotically stable and satisfies H ∞ performance constraint. Then, a sufficient condition for the existence of desired filters is established with a free matrix introduced, which will greatly facilitate the design of filter matrices. By virtue of sum-of-squares (SOS) approaches, a convergent iterative algorithm is developed to tackle the polynomial H ∞ filtering problem. Note that the approach can be efficiently implemented by means of recently developed SOS decomposition techniques, and the filter matrices can be designed explicitly. Finally, a numerical example is given to illustrate the main results of this paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
