scholarly journals Reachable Set Estimation for a Class of Memristor-Based Neural Networks With Time-Varying Delays

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 937-943 ◽  
Author(s):  
Jiemei Zhao
2017 ◽  
Vol 47 (10) ◽  
pp. 3208-3217 ◽  
Author(s):  
Zhaowen Xu ◽  
Hongye Su ◽  
Peng Shi ◽  
Renquan Lu ◽  
Zheng-Guang Wu

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Jiemei Zhao ◽  
Yin Sheng

The reachable set estimation problem for discrete-time systems with delay-range-dependent and bounded disturbances is investigated. A triple-summation term, the upper bound, and the lower bound of time-varying delay are introduced into the Lyapunov function. In this case, an improved delay-range-dependent criterion is established for the addressed problem by constructing the appropriate Lyapunov functional, which guarantees that the reachable set of discrete-time systems with time-varying delay and bounded peak inputs is contained in the ellipsoid. It is worth mentioning that the initial value of the system does not need to be zero. Then, the reachable set estimation problem for time-delay systems with polytopic uncertainties is investigated. The effectiveness and the reduced conservatism of the derived results are demonstrated by an illustrative example.


Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-6 ◽  
Author(s):  
Yuangong Sun ◽  
Fanwei Meng

This paper studies the problem of reachable set estimation for a class of nonlinear time-varying systems with disturbances. New necessary and (or) sufficient conditions are derived for the existence of a ball such that all the solutions of the system converge asymptotically within it. Explicit estimation on the decay rate is also presented. The method used in this paper is motivated by that for positive systems, which is different from the conventional Lyapunov-Krasovskii functional method. A numerical example is given to illustrate the effectiveness of the obtained result.


Sign in / Sign up

Export Citation Format

Share Document