Reachable sets bounding for generalized neural networks with interval time-varying delay and bounded disturbances
| Autor: | Hieu Trinh, H. M. Tran, Mai Viet Thuan |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization Artificial neural network Regular polygon 02 engineering and technology Interval (mathematics) Delay dependent Matrix (mathematics) 020901 industrial engineering & automation Artificial Intelligence Bounding overwatch Bounded function 0202 electrical engineering electronic engineering information engineering Applied mathematics Computational Science and Engineering 020201 artificial intelligence & image processing Software Mathematics |
| Zdroj: | Neural Computing and Applications. 29:783-794 |
| ISSN: | 1433-3058 0941-0643 |
| DOI: | 10.1007/s00521-016-2580-5 |
| Popis: | This paper deals with the problem of finding outer bound of forwards reachable sets and interbound of backwards reachable sets of generalized neural network systems with interval nondifferentiable time-varying delay and bounded disturbances. Based on constructing a suitable Lyapunov–Krasovskii functional and utilizing some improved Jensen integral-based inequalities, two sufficient conditions are derived for the existence of: (1) the smallest possible outer bound of forwards reachable sets and (2) the largest possible interbound of backwards reachable sets. These conditions are delay dependent and in the form of matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. Three numerical examples with simulation results are provided to demonstrate the effectiveness of our results. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink