IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v523y2026ics0096300326000779.html

Bipartite consensus for multi-agent systems under distributed sequential scaling attacks: An edge-based event-triggered scheme

Author

Listed:
  • Ruan, Xiaoli
  • Du, Zhiwei
  • Tang, Ze
  • Feng, Jianwen
  • Wang, Jingyi

Abstract

This paper addresses the bipartite consensus problem for leader-follower multi-agent systems (MASs) under distributed sequential scaling (DSS) attacks. First, a DSS attack model is introduced, where scaling factors are manipulated on individual communication channels, enabling flexible switching among different attack strategies. To compensate the effect of DSS attacks, an edge-based dynamic event-triggered (DET) mechanism is developed and a minimum inter-event interval is introduced simultaneously to avoid the Zeno phenomenon. Furthermore, to address more practical scenarios, an explicit attack-delay mechanism is incorporated, accounting for the fact that communication requires a certain recovery period after an attack, for the case of signed undirected graphs, a Lyapunov function is constructed under the proposed mechanism, and several sufficient conditions are derived to ensure that bipartite consensus can be achieved. Finally, the effectiveness of the theoretical results is validated through numerical simulations.

Suggested Citation

  • Ruan, Xiaoli & Du, Zhiwei & Tang, Ze & Feng, Jianwen & Wang, Jingyi, 2026. "Bipartite consensus for multi-agent systems under distributed sequential scaling attacks: An edge-based event-triggered scheme," Applied Mathematics and Computation, Elsevier, vol. 523(C).
    • Handle: RePEc:eee:apmaco:v:523:y:2026:i:c:s0096300326000779
    DOI: 10.1016/j.amc.2026.130025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300326000779
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2026.130025?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:apmaco:v:523:y:2026:i:c:s0096300326000779. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.