Reachable set bounding for a class of bidirectional associative memory NNSs with Markov jump switching parameters
- 74 Downloads
This paper studies the problem how to estimate the reachable set for a class of delayed bidirectional associative memory neural network systems (NNSs), which have Markov switching parameters and unit-energy or unit-peak bounded disturbance inputs. The feature of the Markov jump bidirectional associative memory NNSs shows in the following twofold: the time delay is time varying; the transition rates is time varying. Moreover, the time-varying transition rates is piecewise constant. Using the Lyapunov functional method, delay-partitioning and linear matrix inequalities techniques, the estimate problem of the reachable set depending on time delay is solved. The effectiveness of the given results is illustrated by the proposed numerical examples.
KeywordsMarkov jump Reachable set estimation Bidirectional associative memory NNSs Piecewise-constant transition rates Time delay
Mathematics Subject Classification00-01 99-00
This work was supported in part supported by both the National Natural Science Foundation of China under Grants 11401062 and 61374104, NSFC 61374086, the Natural Science Foundation of Jiangsu Province under Grant BK20140770, BK20131097. The authors would like to express sincere appreciation to the editor and anonymous reviewers for their valuable comments which have led to an improvement in the presentation of the paper.
- Boyd S, El Ghaoui L, Feron E, Balakrishnan V (1994) Linear matrix inequalities in system and control theory, vol 15. Society for Industrial and Applied Mathematics (SIAM)Google Scholar
- Gu K (2000) An integral inequality in the stability problem of time-delay systems. In Decision and Control, 2000. In: Proceedings of the 39th IEEE conference on, vol 3, pp 2805–2810). IEEE. https://doi.org/10.1109/CDC.2000.914233