作者: Jiemei Zhao
DOI: 10.1109/ACCESS.2017.2777008
关键词:
摘要: This paper investigates the reachable set estimation problem for a class of memristor-based neural networks with time-varying delays and bounded disturbances. By constructing Lyapunov–Krasovskii functional, sufficient condition solvability addressed is established based on linear matrix inequality. ensuring existence an ellipsoid that contains all states under initial conditions. A stability criterion also given. Two numerical examples are provided to show effectiveness proposed methods.