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

MIF-based event-triggered schemes for synchronization control of coupling complex dynamic networks

Author

Listed:
  • Ma, Xiuli
  • Liu, Bo
  • Jia, Xinchun
  • Liu, Xin-Ge
  • Zhang, Xian-Ming

Abstract

Synchronization of complex dynamical networks (CDNs) is one of fundamental objectives in control and network science. This paper introduces an event-triggered sampling scheme defined by a monotonically increasing function (MIF), which starts from an initially negative value and triggers a sampling event once it reaches zero. Compared with some existing event-triggered strategies, the MIF-based mechanism is more natural and flexible, as it yields an explicit expression for the estimation on the inter-event times. This event-triggered scheme is then applied to synchronization control of coupled complex dynamical networks via a time-varying state-feedback controller. By employing the looped-functional method, several algorithms are developed to jointly design appropriate control gains and event-triggering parameters. Finally, a numerical example based on an unforced isolate node is presented to demonstrate the effectiveness of the proposed approach.

Suggested Citation

  • Ma, Xiuli & Liu, Bo & Jia, Xinchun & Liu, Xin-Ge & Zhang, Xian-Ming, 2026. "MIF-based event-triggered schemes for synchronization control of coupling complex dynamic networks," Applied Mathematics and Computation, Elsevier, vol. 524(C).
  • Handle: RePEc:eee:apmaco:v:524:y:2026:i:c:s0096300326000950
    DOI: 10.1016/j.amc.2026.130043
    as

    Download full text from publisher

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

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