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

Observer-based event-triggered composite anti-disturbance finite-time bounded consensus control for multi-Agent systems under switching topologies and multiple attacks

Author

Listed:
  • Chen, Menghua
  • Yu, Shuangwei
  • Karimi, Hamid Reza
  • Wang, Xinping
  • Wang, Yunming

Abstract

This paper investigates the finite-time bounded consensus (FTBC) problem for multi-agent systems (MASs) under hybrid attacks and external disturbances (ED), using observer-based methods and switching topologies. First, a dynamic observer is designed to estimate the upper bound of the unknown ED for compensation. Based on this disturbance compensation, a state observer is developed to mitigate false data injection attacks. Subsequently, an observer-based controller is designed to address the FTBC problem in MASs under hybrid attacks and ED. To address switching topologies induced by denial-of-service attacks, a limit-based reasoning method is introduced. Moreover, a fully distributed hybrid dynamic event-triggering mechanism featuring an adjustable lower bound is proposed to markedly lower communication load while steering clear of Zeno behavior. Ultimately, the effectiveness and superiority of the proposed method are verified by simulation examples.

Suggested Citation

  • Chen, Menghua & Yu, Shuangwei & Karimi, Hamid Reza & Wang, Xinping & Wang, Yunming, 2026. "Observer-based event-triggered composite anti-disturbance finite-time bounded consensus control for multi-Agent systems under switching topologies and multiple attacks," Applied Mathematics and Computation, Elsevier, vol. 523(C).
    • Handle: RePEc:eee:apmaco:v:523:y:2026:i:c:s0096300326000706
    DOI: 10.1016/j.amc.2026.130018
    as

    Download full text from publisher

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