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

Robust finite/fixed-time bipartite flocking control for networked agents under actuator attacks and perturbations

Author

Listed:
  • Lu, Jiaqi
  • Qin, Kaiyu
  • Li, Meng
  • Lin, Boxian
  • Shi, Mengji

Abstract

Flocking is a remarkable phenomenon observed in self-organization agent groups, where individuals follow simple interaction rules to achieve collective grouping behavior. This paper aims to address the challenge of robust bipartite flocking control for networked agents that are susceptible to actuator attacks and external perturbations. The interactions among the networked agents are represented using a signed network model, which encompasses both attractive and repulsive interactions. To begin with, distinct finite-time and fixed-time bipartite flocking control schemes are formulated, with predetermined upper bounds for the settling time of both schemes. Additionally, a nonlinear component associated with velocity alignment errors is incorporated into the flocking controller to compensate for external disturbances encountered by the agents, thereby enhancing the system’s resilience in the face of such disruptions. Furthermore, fault-tolerant finite-time and fixed-time control schemes are proposed for the agents experiencing actuator attacks, enabling the adjustment of settling times based on the actual capabilities of each agent. Finally, the effectiveness of the developed bipartite flocking control schemes for networked agents is demonstrated through some numerical simulation examples.

Suggested Citation

  • Lu, Jiaqi & Qin, Kaiyu & Li, Meng & Lin, Boxian & Shi, Mengji, 2024. "Robust finite/fixed-time bipartite flocking control for networked agents under actuator attacks and perturbations," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
  • Handle: RePEc:eee:chsofr:v:180:y:2024:i:c:s0960077924001073
    DOI: 10.1016/j.chaos.2024.114556
    as

    Download full text from publisher

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

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

    References listed on IDEAS

    as
    1. Jiang, Xiaowei & Zhang, Ni & Li, Bo & Zhang, Xianhe, 2023. "Impulsive consensus of nonlinear multi-agent systems with input and state saturation constraints," Chaos, Solitons & Fractals, Elsevier, vol. 174(C).
    2. Parivallal, Arumugam & Jung, Yoon Mo & Yun, Sangwoon, 2023. "Dynamic event-triggered formation control for Takagi–Sugeno fuzzy multi-agent systems with mismatched membership functions," Chaos, Solitons & Fractals, Elsevier, vol. 177(C).
    3. Kim, Jong-Ho & Park, Jea-Hyun, 2023. "Analysis of mono- and multi-cluster flocking for a nonlinear Cucker–Smale model with external force," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    4. Ma, Yajing & Li, Zhanjie & Xie, Xiangpeng & Yue, Dong, 2023. "Adaptive consensus of uncertain switched nonlinear multi-agent systems under sensor deception attacks," Chaos, Solitons & Fractals, Elsevier, vol. 175(P1).
    5. Kim, Jong-Ho & Park, Jea-Hyun, 2020. "Complete characterization of flocking versus nonflocking of Cucker–Smale model with nonlinear velocity couplings," Chaos, Solitons & Fractals, Elsevier, vol. 134(C).
    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. Kim, Jong-Ho & Park, Jea-Hyun, 2023. "Analysis of mono- and multi-cluster flocking for a nonlinear Cucker–Smale model with external force," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    2. Zhao, Xiao-Wen & Deng, Dong-Dong & Ge, Ming-Feng & Liu, Zhi-Wei, 2024. "Neural adaptive predefined-time formation tracking control of multiple Euler–Lagrange systems with switching topologies based on hierarchical mechanism," Chaos, Solitons & Fractals, Elsevier, vol. 178(C).
    3. He, Xinyi & Liu, Chang & Li, Xiaodi, 2024. "A practical leader–follower hybrid control scheme for wheeled mobile robots," Chaos, Solitons & Fractals, Elsevier, vol. 184(C).
    4. Lee, Dongsun & Lee, Chaeyoung, 2022. "Numerical solutions of the Allen–Cahn equation with the p-Laplacian," Applied Mathematics and Computation, Elsevier, vol. 434(C).

    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:chsofr:v:180:y:2024:i:c:s0960077924001073. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.