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

Fault detection for discrete time-delay networked systems with round-robin protocol in finite-frequency domain

Author

Listed:
  • Yamei Ju
  • Guoliang Wei
  • Derui Ding
  • Sunjie Zhang

Abstract

The paper considers the fault detection problem over finite-frequency domain for a class of discrete time-delayed networked systems subject to round-robin protocol. This protocol is a periodic one to schedule the information transmitted via a shared communication network with an intent to prevent the data from collisions. In this scenario, the error dynamics can be regarded as a periodic protocol-induced system. The aim of the problem addressed is to design a fault detection filter that (1) the sensitivity of the residual to the fault is enhanced by means of a maximised $H_{-} $H− index and (2) the effect from the exogenous disturbances on the residual is decreased with considering a minimised $H_{\infty } $H∞ index. By resorting to a Lyapunov function, an improved version of generalised Kalman–Yakubovich–Popov lemma (GKYP) is first developed for protocol-induced periodic system. Then, in light of such a lemma, sufficient conditions are derived to guarantee both the fault sensitivity and the disturbance attenuation capability by solving a set of matrix inequalities. Finally, the usefulness of the presented fault detection algorithm is utilised via a numerical simulation.

Suggested Citation

  • Yamei Ju & Guoliang Wei & Derui Ding & Sunjie Zhang, 2019. "Fault detection for discrete time-delay networked systems with round-robin protocol in finite-frequency domain," International Journal of Systems Science, Taylor & Francis Journals, vol. 50(13), pages 2497-2509, October.
  • Handle: RePEc:taf:tsysxx:v:50:y:2019:i:13:p:2497-2509
    DOI: 10.1080/00207721.2019.1671530
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2019.1671530?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:50:y:2019:i:13:p:2497-2509. 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.