File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.sysconle.2011.09.003
- Scopus: eid_2-s2.0-81355149497
- WOS: WOS:000300810100006
- Find via
Supplementary
-
Bookmarks:
- CiteULike: 1
- Citations:
- Appears in Collections:
Article: On the synthesis of linear H ∞ filters for polynomial systems
Title | On the synthesis of linear H ∞ filters for polynomial systems | ||||
---|---|---|---|---|---|
Authors | |||||
Keywords | Fixed-Order Filtering H ∞ Filtering Iterative Algorithm Polynomial Systems Sum Of Squares | ||||
Issue Date | 2012 | ||||
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/sysconle | ||||
Citation | Systems And Control Letters, 2012, v. 61 n. 1, p. 31-36 How to Cite? | ||||
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. © 2011 Elsevier B.V. All rights reserved. | ||||
Persistent Identifier | http://hdl.handle.net/10722/157157 | ||||
ISSN | 2023 Impact Factor: 2.1 2023 SCImago Journal Rankings: 1.503 | ||||
ISI Accession Number ID |
Funding Information: This work was partially supported by GRF 7137/09E. | ||||
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, P | en_US |
dc.contributor.author | Lam, J | en_US |
dc.contributor.author | Chesi, G | en_US |
dc.date.accessioned | 2012-08-08T08:45:34Z | - |
dc.date.available | 2012-08-08T08:45:34Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | Systems And Control Letters, 2012, v. 61 n. 1, p. 31-36 | en_US |
dc.identifier.issn | 0167-6911 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/157157 | - |
dc.description.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. © 2011 Elsevier B.V. All rights reserved. | en_US |
dc.language | eng | en_US |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/sysconle | en_US |
dc.relation.ispartof | Systems and Control Letters | en_US |
dc.subject | Fixed-Order Filtering | en_US |
dc.subject | H ∞ Filtering | en_US |
dc.subject | Iterative Algorithm | en_US |
dc.subject | Polynomial Systems | en_US |
dc.subject | Sum Of Squares | en_US |
dc.title | On the synthesis of linear H ∞ filters for polynomial systems | en_US |
dc.type | Article | en_US |
dc.identifier.email | Lam, J:james.lam@hku.hk | en_US |
dc.identifier.email | Chesi, G:chesi@eee.hku.hk | en_US |
dc.identifier.authority | Lam, J=rp00133 | en_US |
dc.identifier.authority | Chesi, G=rp00100 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/j.sysconle.2011.09.003 | en_US |
dc.identifier.scopus | eid_2-s2.0-81355149497 | en_US |
dc.identifier.hkuros | 208799 | - |
dc.identifier.hkuros | 201427 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-81355149497&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 61 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.spage | 31 | en_US |
dc.identifier.epage | 36 | en_US |
dc.identifier.isi | WOS:000300810100006 | - |
dc.publisher.place | Netherlands | en_US |
dc.identifier.scopusauthorid | Li, P=35069715100 | en_US |
dc.identifier.scopusauthorid | Lam, J=7201973414 | en_US |
dc.identifier.scopusauthorid | Chesi, G=7006328614 | en_US |
dc.identifier.citeulike | 10072471 | - |
dc.identifier.issnl | 0167-6911 | - |