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

Anti-windup design for networked time-delay systems subject to saturating actuators under round-robin protocol

Author

Listed:
  • Chen, Yonggang
  • Zhao, Yaxue
  • Gu, Zhou
  • Yang, Xinfen

Abstract

This paper investigates the anti-windup design for networked time-delay systems subject to saturating actuators under the round-robin protocol. Firstly, the actual measurement output is represented by the model that is dependent on a periodic function. Then, using the generalized delay-dependent sector condition, the augmented periodic Lyapunov-Krasovskii functional together with certain inequalities, an anti-windup design criterion is derived based on linear matrix inequalities under which the closed-loop systems have the desirable properties such as boundedness, H∞ performance, and asymptotic stability. The corresponding results are also presented for the case of constant delay and the case of no time delay. Moreover, the relevant optimizations in the main results are discussed. In the end, two numerical examples illustrate the availability and advantages of the proposed results.

Suggested Citation

  • Chen, Yonggang & Zhao, Yaxue & Gu, Zhou & Yang, Xinfen, 2025. "Anti-windup design for networked time-delay systems subject to saturating actuators under round-robin protocol," Applied Mathematics and Computation, Elsevier, vol. 499(C).
    • Handle: RePEc:eee:apmaco:v:499:y:2025:i:c:s0096300325001407
    DOI: 10.1016/j.amc.2025.129413
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325001407
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129413?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:499:y:2025:i:c:s0096300325001407. 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.