IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v222y2024icp110-147.html
   My bibliography  Save this article

Hierarchical clustering cooperation flocking based on feedback mechanism

Author

Listed:
  • Li, Saisai
  • Wang, Wenke
  • Li, Le
  • Huang, Chuangxia
  • Yao, Zhaoye

Abstract

The mathematical theory of flocking underlies several omnipresent multi-agent phenomena in biology, ecology, sensor networks, and economics, and also plays an important role in the study of swarm intelligence. Motivated by the results of recent research on flocking estimates, we study a class of hierarchical clustering cooperative models based on feedback mechanism. First, we present hierarchical clustering cooperative models with feedback. By means of new differential inequality techniques and Lyapunov functional method, sufficient criteria on the asymptotic convergence of these models are obtained. Meanwhile, the appropriate initial data that allows collision avoidance between agents are presented. Further, similar results are extended to the case where some pairs of agents do not have direct communication, but the whole system is connected. Moreover, the free-will agents are added to the clustering cooperative models, and unconditional convergence is proved. Combined clustering cooperative flocking with virtual structure, a scenario is simulated with unmanned aerial vehicle (UAV) swarms accomplishing coordinated control with multiple formations. The introduction of the cluster-structure and feedback mechanism makes the flocking models more suitable for practical applications.

Suggested Citation

  • Li, Saisai & Wang, Wenke & Li, Le & Huang, Chuangxia & Yao, Zhaoye, 2024. "Hierarchical clustering cooperation flocking based on feedback mechanism," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 222(C), pages 110-147.
  • Handle: RePEc:eee:matcom:v:222:y:2024:i:c:p:110-147
    DOI: 10.1016/j.matcom.2023.08.028
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475423003543
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2023.08.028?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.

    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:matcom:v:222:y:2024:i:c:p:110-147. 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/mathematics-and-computers-in-simulation/ .

    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.