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

Practical finite-time synchronization for Lur'e systems with performance constraint and actuator faults: A memory-based quantized dynamic event-triggered control strategy

Author

Listed:
  • Hou, Xinzhao
  • Wu, Huaiqin
  • Cao, Jinde

Abstract

This paper focuses on the practical finite-time synchronization (PFTs) for master-slave Lur'e nonlinear systems with performance constraint and time-varying actuator faults via the memory-based quantized dynamic event-triggered control (QDETC). Firstly, to ensure the accuracy of actual convergence, the performance constraint is implemented for synchronization error by utilizing barrier Lyapunov function (BLF). Secondly, a novel memory-based QDETC scheme is firstly developed to reduce unnecessary resource consumption and control waste of information transmission, where the historical dates are used to construct the update law with memory length. For the designed memory-based dynamic event-triggered controller with quantization function, it is verified that the event-triggering interval is larger than the traditional one, and the Zeno behavior is free, rigorously. Thirdly, by Lyapunov functional approach and inequality analysis techniques, the PFTs conditions are established in terms of linear matrix inequalities. And the bound of the settling time is estimated accurately. Finally, a simulation case in chaotic Chua's circuit is adopted to validate the feasibility of the proposed control strategy.

Suggested Citation

  • Hou, Xinzhao & Wu, Huaiqin & Cao, Jinde, 2025. "Practical finite-time synchronization for Lur'e systems with performance constraint and actuator faults: A memory-based quantized dynamic event-triggered control strategy," Applied Mathematics and Computation, Elsevier, vol. 487(C).
  • Handle: RePEc:eee:apmaco:v:487:y:2025:i:c:s0096300324005691
    DOI: 10.1016/j.amc.2024.129108
    as

    Download full text from publisher

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

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

    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:487:y:2025:i:c:s0096300324005691. 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.