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

Fast finite-time consensus protocol for high-order nonlinear multi-agent systems based on event-triggered communication scheme

Author

Listed:
  • Zhao, Junsheng
  • Zhao, Haina
  • Song, Ying
  • Sun, Zong-Yao
  • Yu, Dengxiu

Abstract

This paper proposes an adaptive fast finite-time tracking consensus protocol for high-order nonlinear multi-agent systems. To overcome the limitation of finite-time stability, where the convergence speed slows down when the initial state is far from the origin, the fast finite-time stability theory is incorporated into the multi-agent systems to ensure rapid convergence of the tracking error. Furthermore, the power integrator technique is integrated into the backstepping framework to address the inherent singularity issues in high-order systems. Meanwhile, neural networks are used as online approximators to model unknown nonlinear functions, with the tanh(⋅) function adopted to mitigate the impact of approximation errors effectively. The developed dynamic event-triggered controller can reduce the frequency of control updates, effectively saving communication resources. Finally, two simulation examples demonstrate the effectiveness of the proposed strategy.

Suggested Citation

  • Zhao, Junsheng & Zhao, Haina & Song, Ying & Sun, Zong-Yao & Yu, Dengxiu, 2026. "Fast finite-time consensus protocol for high-order nonlinear multi-agent systems based on event-triggered communication scheme," Applied Mathematics and Computation, Elsevier, vol. 508(C).
  • Handle: RePEc:eee:apmaco:v:508:y:2026:i:c:s0096300325003571
    DOI: 10.1016/j.amc.2025.129631
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2025.129631?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:508:y:2026:i:c:s0096300325003571. 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.