IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v54y2023i11p2382-2406.html
   My bibliography  Save this article

Unified stability criteria of asynchronous discrete-time impulsive switched delayed systems: bounded admissible edge-dependent average dwell time method

Author

Listed:
  • Mengjie Li
  • Zihan Liu
  • Tao Sun
  • Lijun Gao

Abstract

This article investigates input-to-state stability (ISS) problem of asynchronous discrete-time impulsive switched delayed systems, in which switching and impulse may be asynchronous. A novel bounded admissible edge-dependent average dwell time (BAED-ADT) switching signal is designed. Based on this division rule of switching subsystems, we adopt the slow switching method for the stable subsystems and the fast switching method for the unstable subsystems, so that stable subsystems can compensate unstable subsystems. Combined with admissible edge-dependent average impulsive interval (AED-AII) impulsive signal, a new unified ISS stability result is established, which could be applied to impulsive switched systems with an arbitrary combination of unstable and stable subsystems. Without solving the linear matrix inequality, it is allowed to readjust the AED-ADT boundary of the newly proposed stability condition according to the actual impulsive and switching signal. Further, compared with the existing fruits, the new stability condition is an extension and improvement of the previous one, which is less conservative. Several numerical examples are provided to show the validity of the conditions and the advantages of the theoretic results.

Suggested Citation

  • Mengjie Li & Zihan Liu & Tao Sun & Lijun Gao, 2023. "Unified stability criteria of asynchronous discrete-time impulsive switched delayed systems: bounded admissible edge-dependent average dwell time method," International Journal of Systems Science, Taylor & Francis Journals, vol. 54(11), pages 2382-2406, August.
  • Handle: RePEc:taf:tsysxx:v:54:y:2023:i:11:p:2382-2406
    DOI: 10.1080/00207721.2023.2230469
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2023.2230469
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2023.2230469?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.

    More about this item

    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:taf:tsysxx:v:54:y:2023:i:11:p:2382-2406. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.