IDEAS home Printed from https://ideas.repec.org/a/hin/complx/2075603.html
   My bibliography  Save this article

Heterogeneous and Competitive Multiagent Networks: Couple-Group Consensus with Communication or Input Time Delays

Author

Listed:
  • Nanxiang Yu
  • Lianghao Ji
  • Fengmin Yu

Abstract

This paper discusses the couple-group consensus problems for a class of heterogeneous multiagent networks including the following two cases: with communication and input time delays, respectively. Different from the related cooperative networks, two novel delayed group consensus protocols are designed based on the competitive relationship between the agents. Furthermore, we absolutely relax the in-degree balance and other restrictive preconditions which existed in the relevant works. Some sufficient algebraic criteria for the achievement of couple-group consensus and the upper bound of the input time delays are technically obtained via the frequency domain method and matrix theory, respectively. The results show that the achievement of the couple-group consensus depends on the second-order agents’ in-degree and the control parameters of the systems, whereas it is independent of the communication time delays. Meanwhile, the upper bound of the input time delay is determined by the control parameters and the in-degree of the first-order agents. Finally, the validity of the proposed results is verified by several simulated examples.

Suggested Citation

  • Nanxiang Yu & Lianghao Ji & Fengmin Yu, 2017. "Heterogeneous and Competitive Multiagent Networks: Couple-Group Consensus with Communication or Input Time Delays," Complexity, Hindawi, vol. 2017, pages 1-10, December.
    • Handle: RePEc:hin:complx:2075603
    DOI: 10.1155/2017/2075603
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2017/2075603.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2017/2075603.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2017/2075603?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
    ---><---

    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:hin:complx:2075603. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.