IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v46y2015i3p405-417.html
   My bibliography  Save this article

Optimal and mode-independent filters for generalised Bernoulli jump systems

Author

Listed:
  • A.R. Fioravanti
  • A.P.C. Gonçalves
  • J.C. Geromel

Abstract

This paper provides the optimal solution of the filtering design problem for a special class of discrete-time Markov jump linear systems whose transition probability matrix has identical rows. In the two-mode case, this is equivalent to saying that the random variable has a Bernoulli distribution. For that class of dynamic systems we design, with the help of new necessary and sufficient linear matrix inequality conditions, H2$\mathcal {H}_2$ and H∞$\mathcal {H}_\infty$ optimal mode-independent filters with the same order of the plant. As a first proposal available in the literature, for partial information characterised by cluster availability of the mode, we also show it is possible to design optimal full-order linear filters. If some plant matrices do not vary within the same cluster, we show that the optimal filter exhibits the internal model structure. We complete the results with illustrative examples. A realistic practical application considering sensors connected to a network using a communication protocol such as the Token Ring is included in order to put in evidence the usefulness of the theoretical results.

Suggested Citation

  • A.R. Fioravanti & A.P.C. Gonçalves & J.C. Geromel, 2015. "Optimal and mode-independent filters for generalised Bernoulli jump systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(3), pages 405-417, February.
  • Handle: RePEc:taf:tsysxx:v:46:y:2015:i:3:p:405-417
    DOI: 10.1080/00207721.2013.784373
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2013.784373
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2013.784373?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tsysxx:v:46:y:2015:i:3:p:405-417. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.