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

Consensus seeking in multi-agent systems with noisy and delayed communication in digraphs having spanning tree

Author

Listed:
  • Sabir Djaidja
  • Qinghe Wu

Abstract

This paper studies the consensus problem of continuous-time single-integrator multi-agent systems with measurement noises and time delays under directed fixed topologies. Each agent in the team receives imprecise and delayed information from its neighbours. The noises are considered white noises, and time delays are assumed to be uniform for all the received information states. An analysis framework based on graph theory and stochastic tools is followed to derive conditions under which the asymptotic unbiased mean square linear χ-consensus is achieved in directed fixed topologies having a spanning tree. Then, conditions to achieve asymptotic unbiased mean square average consensus are deduced for fixed balanced digraphs having a spanning tree. The effectiveness of the proposed algorithms is proved through some simulations.

Suggested Citation

  • Sabir Djaidja & Qinghe Wu, 2016. "Consensus seeking in multi-agent systems with noisy and delayed communication in digraphs having spanning tree," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(12), pages 2975-2984, September.
    • Handle: RePEc:taf:tsysxx:v:47:y:2016:i:12:p:2975-2984
    DOI: 10.1080/00207721.2015.1053831
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2015.1053831
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2015.1053831?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:47:y:2016:i:12:p:2975-2984. 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.