IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2013y2013i1n791296.html
   My bibliography  Save this article

Resilient L2‐L∞ Filtering of Uncertain Markovian Jumping Systems within the Finite‐Time Interval

Author

Listed:
  • Shuping He

Abstract

This paper studies the resilient L2‐L∞ filtering problem for a class of uncertain Markovian jumping systems within the finite‐time interval. The objective is to design such a resilient filter that the finite‐time L2‐L∞ gain from the unknown input to an estimation error is minimized or guaranteed to be less than or equal to a prescribed value. Based on the selected Lyapunov‐Krasovskii functional, sufficient conditions are obtained for the existence of the desired resilient L2‐L∞ filter which also guarantees the stochastic finite‐time boundedness of the filtering error dynamic systems. In terms of linear matrix inequalities (LMIs) techniques, the sufficient condition on the existence of finite‐time resilient L2‐L∞ filter is presented and proved. The filter matrices can be solved directly by using the existing LMIs optimization techniques. A numerical example is given at last to illustrate the effectiveness of the proposed approach.

Suggested Citation

Handle: RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:791296
DOI: 10.1155/2013/791296
as

Download full text from publisher

File URL: https://doi.org/10.1155/2013/791296
Download Restriction: no

File URL: https://libkey.io/10.1155/2013/791296?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:791296. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1155/4058 .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.