IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i4p921-d1065413.html
   My bibliography  Save this article

Consensus in Networks of Agents with Cooperative and Antagonistic Interactions

Author

Listed:
  • Yanping Gao

    (School of E-Business and Logistics, Beijing Technology and Business University, Beijing 100048, China
    National Engineering Laboratory for Agri-Product Quality Traceability, Beijing 100048, China
    Research Center for Consumption Big Data and Intelligent Decision-Making, Beijing 100048, China)

  • Kaixuan Kou

    (School of E-Business and Logistics, Beijing Technology and Business University, Beijing 100048, China
    National Engineering Laboratory for Agri-Product Quality Traceability, Beijing 100048, China
    Research Center for Consumption Big Data and Intelligent Decision-Making, Beijing 100048, China)

  • Weijing Zhang

    (School of E-Business and Logistics, Beijing Technology and Business University, Beijing 100048, China
    National Engineering Laboratory for Agri-Product Quality Traceability, Beijing 100048, China
    Research Center for Consumption Big Data and Intelligent Decision-Making, Beijing 100048, China)

  • Yishu Dai

    (School of E-Business and Logistics, Beijing Technology and Business University, Beijing 100048, China
    National Engineering Laboratory for Agri-Product Quality Traceability, Beijing 100048, China
    Research Center for Consumption Big Data and Intelligent Decision-Making, Beijing 100048, China)

  • Jingwei Ma

    (Safety Assessment Guarantee Room, Beijing 100073, China)

Abstract

This paper studies the consensus of first-order discrete-time multi-agent systems with fixed and switching topology, and there exists cooperative and antagonistic interactions among agents. A signed graph is used to model the interactions among agents, and some sufficient conditions for consensus are obtained by analyzing the eigenvalues of a Laplacian matrix in the case of fixed topology. The results indicate that having a spanning tree is only a necessary condition for the consensus of multi-agent systems with signed graphs, which is also affected by edge weights. Consensus is further discussed in the case of switching topology, and the results reveal that consensus can be reached if the controller gain and the union graphs among some consecutive time intervals satisfy some conditions. Finally, several simulation examples further confirm the theoretical results.

Suggested Citation

  • Yanping Gao & Kaixuan Kou & Weijing Zhang & Yishu Dai & Jingwei Ma, 2023. "Consensus in Networks of Agents with Cooperative and Antagonistic Interactions," Mathematics, MDPI, vol. 11(4), pages 1-13, February.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:4:p:921-:d:1065413
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/4/921/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/4/921/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Norberto Urbina-Brito & María-Eusebia Guerrero-Sánchez & Guillermo Valencia-Palomo & Omar Hernández-González & Francisco-Ronay López-Estrada & José Antonio Hoyo-Montaño, 2021. "A Predictive Control Strategy for Aerial Payload Transportation with an Unmanned Aerial Vehicle," Mathematics, MDPI, vol. 9(15), pages 1-15, August.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Araceli Queiruga-Dios & María Jesus Santos Sánchez & Fatih Yilmaz & Deolinda M. L. Dias Rasteiro & Jesús Martín-Vaquero & Víctor Gayoso Martínez, 2022. "Mathematics and Its Applications in Science and Engineering," Mathematics, MDPI, vol. 10(19), pages 1-2, September.

    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:gam:jmathe:v:11:y:2023:i:4:p:921-:d:1065413. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.