Exploring the finite-time dissipativity of Markovian jump delayed neural networks

  • V. E. Sathishkumar
  • , R. Vadivel
  • , Jaehyuk Cho*
  • , Nallappan Gunasekaran
  • *Corresponding author for this work

    Research output: Contribution to journalJournal articlepeer-review

    Abstract

    In this paper, we study the finite-time dissipativity analysis of Markovian jump-delayed neural networks (MJDNNs). The goal is to establish less conservative results for extended dissipativity conditions for delayed MJDNNs. To achieve this, an appropriate Lyapunov-Krasovskii functional (LKF) with novel inequality like composite slack-matrix-based integral inequality (CSMBII). Next, the CSMBII and other sufficient conditions are employed to estimate the derivative of the constructed LKF. Using these techniques, a delay-dependent finite-time dissipativity condition is derived in terms of linear matrix inequalities (LMIs). These LMIs are used to formulate the finite dissipativity condition for the delayed MJNNs. The utility of the suggested approach is then confirmed by a number of interesting numerical examples, one of which has been confirmed by a real-world application of the benchmark problem that is associated with the designed MJDNNs. The illustrative simulation results conclusively demonstrate the superior performance and success of the developed CSMBII technique in this proposal, surpassing the limitations of existing techniques.

    Original languageEnglish
    Pages (from-to)427-437
    Number of pages11
    JournalAlexandria Engineering Journal
    Volume79
    DOIs
    StatePublished - 2023.09.15

    Keywords

    • Finite-time dissipativity
    • Linear matrix inequality
    • Lyapunov method
    • Markovian jump neural networks
    • Time-varying delays

    Quacquarelli Symonds(QS) Subject Topics

    • Engineering & Technology

    Fingerprint

    Dive into the research topics of 'Exploring the finite-time dissipativity of Markovian jump delayed neural networks'. Together they form a unique fingerprint.

    Cite this