IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v526y2019ics0378437119304625.html
   My bibliography  Save this article

Containment control of directed networks with time-varying nonlinear multi-agents using minimum number of leaders

Author

Listed:
  • Gao, Leitao
  • Zhao, Guangshe
  • Li, Guoqi
  • Liu, Yuming
  • Huang, Jiangshuai
  • Deng, Lei

Abstract

In this paper, the problem of containment control with minimum number of leaders in arbitrary directed networks consisting of time-varying nonlinear multi-agents is investigated. Unlike the existing containment control problem with redundant leaders in special networks, we consider the problem with minimum number of leaders in arbitrary directed networks. We show that the problem of finding the minimum number of leaders can be converted into a minimum spanning tree problem by introducing a toll station connecting with each agent. By employing the developed Edmonds’ algorithm, the minimum number of leaders is located at the roots of each tree in the obtained spanning forest. This situation allows us to achieve containment control in a distributed manner. On the basis of this situation, a distributed protocol is developed to address the containment control of multi-agent systems with time-varying nonlinear dynamics. Simulation results are provided to illustrate the efficiency of the proposed methodology. Our work makes it possible for studying and extending application of containment control problems in various complex networks.

Suggested Citation

  • Gao, Leitao & Zhao, Guangshe & Li, Guoqi & Liu, Yuming & Huang, Jiangshuai & Deng, Lei, 2019. "Containment control of directed networks with time-varying nonlinear multi-agents using minimum number of leaders," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 526(C).
    • Handle: RePEc:eee:phsmap:v:526:y:2019:i:c:s0378437119304625
    DOI: 10.1016/j.physa.2019.04.095
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119304625
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2019.04.095?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. Zhuoran Wang & Dian Ouyang & Yikun Wang & Qi Liang & Zhuo Huang, 2023. "Efficient and Effective Directed Minimum Spanning Tree Queries," Mathematics, MDPI, vol. 11(9), pages 1-17, May.

    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:eee:phsmap:v:526:y:2019:i:c:s0378437119304625. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.