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

Global bounded consensus of multi-agent systems with non-identical nodes and communication time-delay topology

Author

Listed:
  • Wei-Song Zhong
  • Guo-Ping Liu
  • David Rees

Abstract

This article investigates the global bounded consensus problem of networked multi-agent systems exhibiting nonlinear, non-identical node dynamics with communication time-delays. Globally bounded consensus conditions for both delay-independent and delay-dependent conditions based on the Lypunov–Krasovskii functional method are derived. The proposed consensus criteria ensures that all agents eventually move along the desired trajectories in the sense of boundedness. The proposed consensus criteria generalises the case of identical agent dynamics to the case of non-identical agent dynamics, and many related results in this area can be viewed as special cases of the above results. We finally demonstrate the effectiveness of the theoretical results by means of a numerical simulation.

Suggested Citation

  • Wei-Song Zhong & Guo-Ping Liu & David Rees, 2013. "Global bounded consensus of multi-agent systems with non-identical nodes and communication time-delay topology," International Journal of Systems Science, Taylor & Francis Journals, vol. 44(2), pages 346-357.
    • Handle: RePEc:taf:tsysxx:v:44:y:2013:i:2:p:346-357
    DOI: 10.1080/00207721.2011.601346
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2011.601346
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2011.601346?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:44:y:2013:i:2:p:346-357. 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.