Abstract
This article examines the finite-time (F-T) synchronization issue for a class of recurrent neural networks (NNs) that have, respectively, bounded and unbounded time-varying delays. First, two novel F-T stability lemmas are presented in the form of generalized Halanay inequalities. Second, based on the obtained lemmas, some simple and easy-to-use F-T synchronization criteria are rendered for the considered NNs under two different Lyapunov functions. The results obtained in this article greatly reduce system constraints and are therefore more applicable. The validity of the theoretical results derived in this article is finally checked using three numerical instances.
| Original language | English |
|---|---|
| Pages (from-to) | 4742-4751 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Systems, Man, and Cybernetics: Systems |
| Volume | 55 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - Jul 2025 |
Fingerprint
Dive into the research topics of 'Finite-time synchronization for delayed NNs via generalized Halanay inequalities'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver