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

A new result on reachable set estimation for Markovian jump neural networks with time-varying delays

Author

Listed:
  • Ya-Li Zhi
  • Yan-Yan Wu
  • Yan Zhang
  • Guozhi Yang

Abstract

This paper is concerned with the problem of reachable set estimation (RSE) for a class of delayed Markovian jump neural networks with periodically time-varying delay. First, by augmenting the state-related vectors in the double integral term and combining with zero inequalities, more cross-term information is captured. According to periodicity and monotonicity, the time-varying delay is divided into monotonically decreasing and increasing intervals. Then, by constructing delay-product terms in each interval, a novel Lyapuov-Krasovskii functional is derived, which contributes to the reduction of conservatism, and thus a refined allowable set of the delay is obtained. Finally, two improved RSE criteria that consider complete and incomplete transition probabilities are obtained, by which smaller bounded sets can be found with less conservatism. In the simulation section, numerical examples are given to demonstrate the superiority of the method.

Suggested Citation

  • Ya-Li Zhi & Yan-Yan Wu & Yan Zhang & Guozhi Yang, 2025. "A new result on reachable set estimation for Markovian jump neural networks with time-varying delays," International Journal of Systems Science, Taylor & Francis Journals, vol. 56(16), pages 4131-4143, December.
  • Handle: RePEc:taf:tsysxx:v:56:y:2025:i:16:p:4131-4143
    DOI: 10.1080/00207721.2025.2482859
    as

    Download full text from publisher

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

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

    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:56:y:2025:i:16:p:4131-4143. 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.