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

Scaled cluster consensus of discrete-time multi-agent systems with general directed topologies

Author

Listed:
  • Bo Hou
  • Fuchun Sun
  • Hongbo Li
  • Yao Chen
  • Guangbin Liu

Abstract

This note proposes a notion of scaled cluster consensus, wherein the final consensus states within different clusters converge to prescribed ratios. Unlike most results in existing literature on cluster consensus, no constraints are imposed on the system topologies under the designed protocol, i.e. the agents are not required to possess any cluster affiliation information of others. For the delay-free case, an explicit scaled cluster consensus function is provided by exploring the characteristics of stochastic matrices. Diverse input delays and asymmetric communication delays are both considered, and sufficient condition for scaled cluster consensus is derived based on frequency domain analysis. Finally, numerical examples are given to illustrate the effectiveness of the presented results.

Suggested Citation

  • Bo Hou & Fuchun Sun & Hongbo Li & Yao Chen & Guangbin Liu, 2016. "Scaled cluster consensus of discrete-time multi-agent systems with general directed topologies," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(16), pages 3839-3845, December.
    • Handle: RePEc:taf:tsysxx:v:47:y:2016:i:16:p:3839-3845
    DOI: 10.1080/00207721.2015.1129675
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2015.1129675
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2015.1129675?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. Yao, Lingling & Xie, Dongmei & Wang, Han, 2023. "Complex group consensus of multi-agent systems with cooperative-competitive mechanisms: acyclic partition method," Applied Mathematics and Computation, Elsevier, vol. 443(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:47:y:2016:i:16:p:3839-3845. 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.