New Results on Reachable Sets Bounding for Switched Neural Networks Systems with Discrete, Distributed Delays and Bounded Disturbances

In this paper, problem of reachable sets bounding is considered for switched neural networks systems with mixed time-varying delays and bounded disturbances. By using Lyapunov–Krasovskii functional method, some new sufficient conditions are derived for the existence of (1) the smallest possible oute...

Full description

Saved in:
Bibliographic Details
Published inNeural processing letters Vol. 46; no. 1; pp. 355 - 378
Main Authors Thuan, Mai Viet, Thu, Nguyen Thi Huyen
Format Journal Article
LanguageEnglish
Published New York Springer US 01.08.2017
Springer Nature B.V
Subjects
Algorithms
Artificial Intelligence
Complex Systems
Computational Intelligence
Computer Science
Disturbances
Inequality
Linear matrix inequalities
Mathematical analysis
Neural networks
Signal processing
Switched neural networks
Lyapunov–Krasovskii functionals
Backwards reachable sets
Linear matrix inequalities
Forwards reachable sets
Online AccessGet full text

Cover

More Information
Summary:In this paper, problem of reachable sets bounding is considered for switched neural networks systems with mixed time-varying delays and bounded disturbances. By using Lyapunov–Krasovskii functional method, some new sufficient conditions are derived for the existence of (1) the smallest possible outer bound of forwards reachable sets; and (2) the largest possible inter bound of backward reachable sets. These conditions are delay dependent and in the form of linear matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. A constructive geometric design of switching laws is also presented. Finally, two numerical examples are given to illustrate the effectiveness of the proposed method.
ISSN:1370-4621
1573-773X
DOI:10.1007/s11063-017-9596-4