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

Fast Consensus Seeking on Networks with Antagonistic Interactions

Author

Listed:
  • Jijun Qu
  • Zhijian Ji
  • Chong Lin
  • Haisheng Yu

Abstract

It is well known that all agents in a multiagent system can asymptotically converge to a common value based on consensus protocols. Besides, the associated convergence rate depends on the magnitude of the smallest nonzero eigenvalue of Laplacian matrix . In this paper, we introduce a superposition system to superpose to the original system and study how to change the convergence rate without destroying the connectivity of undirected communication graphs. And we find the result if the eigenvector of eigenvalue has two identical entries , then the weight and existence of the edge do not affect the magnitude of , which is the argument of this paper. By taking advantage of the inequality of eigenvalues, conditions are derived to achieve the largest convergence rate with the largest delay margin, and, at the same time, the corresponding topology structure is characterized in detail. In addition, a method of constructing invalid algebraic connectivity weights is proposed to keep the convergence rate unchanged. Finally, simulations are given to demonstrate the effectiveness of the results.

Suggested Citation

  • Jijun Qu & Zhijian Ji & Chong Lin & Haisheng Yu, 2018. "Fast Consensus Seeking on Networks with Antagonistic Interactions," Complexity, Hindawi, vol. 2018, pages 1-15, December.
    • Handle: RePEc:hin:complx:7831317
    DOI: 10.1155/2018/7831317
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Ning Cai & Chen Diao & M. Junaid Khan, 2017. "A Novel Clustering Method Based on Quasi-Consensus Motions of Dynamical Multiagent Systems," Complexity, Hindawi, vol. 2017, pages 1-8, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bo Liu & Ningsheng Xu & Housheng Su & Licheng Wu & Jiahui Bai, 2019. "On the Observability of Leader-Based Multiagent Systems with Fixed Topology," Complexity, Hindawi, vol. 2019, pages 1-10, November.
    2. Liu, Bo & Su, Housheng & Wu, Licheng & Shen, Xixi, 2021. "Controllability for multi-agent systems with matrix-weight-based signed network," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    3. Xin, Youming & Lyu, Huiping & Tuo, Huan & Cheng, Zunshui, 2023. "Event-based consensus for third-order nonlinear multi-agent systems," Chaos, Solitons & Fractals, Elsevier, vol. 169(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:7831317. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.