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

Set-membership filtering for time-varying complex networks with uniform quantisations over randomly delayed redundant channels

Author

Listed:
  • Zhongyi Zhao
  • Zidong Wang
  • Lei Zou
  • Jiyue Guo

Abstract

This paper investigates the set-membership filtering problem for a class of nonlinear time-varying complex networks with uniformly quantised measurements over redundant channels. The network output is subject to uniform quantisation and then the quantised signal is sent to the filter through redundant channels with random delays. The aim of the proposed problem is to design a set-membership filter such that, at each time instant, the filtering error dynamics is confined within a closed domain whose boundary is a hyper-ellipsoid. Sufficient conditions are proposed to guarantee the existence of addressed set-membership filter in terms of certain recursive matrix inequality. Subsequently, an optimisation problem is proposed to minimise the hyper-ellipsoid (containing the true network state) in the sense of trace and a computational algorithm is then provided. Finally, a simulation example is provided to demonstrate the effectiveness of our proposed method.

Suggested Citation

  • Zhongyi Zhao & Zidong Wang & Lei Zou & Jiyue Guo, 2020. "Set-membership filtering for time-varying complex networks with uniform quantisations over randomly delayed redundant channels," International Journal of Systems Science, Taylor & Francis Journals, vol. 51(16), pages 3364-3377, December.
  • Handle: RePEc:taf:tsysxx:v:51:y:2020:i:16:p:3364-3377
    DOI: 10.1080/00207721.2020.1814898
    as

    Download full text from publisher

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

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zheng, Xiaoyuan & Kang, Yu & Li, Hongyi & Li, Jitao, 2023. "Multiple description encoding-decoding-based resilient filtering for complex networks under the round-Robin protocol," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    2. Wang, Licheng & Chen, Hui, 2022. "Event-based joint state and fault estimation: The envelope-constrained H∞ criterion," Applied Mathematics and Computation, Elsevier, vol. 419(C).

    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:51:y:2020:i:16:p:3364-3377. 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.