State estimation for discrete-time neural networks with Markov-mode-dependent lower and upper bounds on the distributed delays

Copyright @ 2012 Springer VerlagThis paper is concerned with the state estimation problem for a new class of discrete-time neural networks with Markovian jumping parameters and mixed time-delays. The parameters of the neural networks under consideration switch over time subject to a Markov chain. The networks involve both the discrete-time-varying delay and the mode-dependent distributed time-delay characterized by the upper and lower boundaries dependent on the Markov chain. By constructing novel Lyapunov-Krasovskii functionals, sufficient conditions are firstly established to guarantee the exponential stability in mean square for the addressed discrete-time neural networks with Markovian jumping parameters and mixed time-delays. Then, the state estimation problem is coped with for the same neural network where the goal is to design a desired state estimator such that the estimation error approaches zero exponentially in mean square. The derived conditions for both the stability and the existence of desired estimators are expressed in the form of matrix inequalities that can be solved by the semi-definite programme method. A numerical simulation example is exploited to demonstrate the usefulness of the main results obtained.This work was supported in part by the Royal Society of the U.K., the National Natural Science Foundation of China under Grants 60774073 and 61074129, and the Natural Science Foundation of Jiangsu Province of China under Grant BK2010313

Synchronization of coupled neutral-type neural networks with jumping-mode-dependent discrete and unbounded distributed delays

This is the post-print version of the Article. The official published version can be accessed from the links below - Copyright @ 2013 IEEE.In this paper, the synchronization problem is studied for an array of N identical delayed neutral-type neural networks with Markovian jumping parameters. The coupled networks involve both the mode-dependent discrete-time delays and the mode-dependent unbounded distributed time delays. All the network parameters including the coupling matrix are also dependent on the Markovian jumping mode. By introducing novel Lyapunov-Krasovskii functionals and using some analytical techniques, sufficient conditions are derived to guarantee that the coupled networks are asymptotically synchronized in mean square. The derived sufficient conditions are closely related with the discrete-time delays, the distributed time delays, the mode transition probability, and the coupling structure of the networks. The obtained criteria are given in terms of matrix inequalities that can be efficiently solved by employing the semidefinite program method. Numerical simulations are presented to further demonstrate the effectiveness of the proposed approach.This work was supported in part by the Royal Society of the U.K., the National Natural Science Foundation of China under Grants 61074129, 61174136 and 61134009, and the Natural Science Foundation of Jiangsu Province of China under Grants BK2010313 and BK2011598

Delay-dependent criterion for exponential stability analysis of neural networks with time-varying delays

This note investigates the problem of exponential stability of neural networks with time-varying delays. To derive a less conservative stability condition, a novel augmented Lyapunov-Krasovskii functional (LKF) which includes triple and quadruple-integral terms is employed. In order to reduce the complexity of the stability test, the convex combination method is utilized to derive an improved delay dependent stability criterion in the form of linear matrix inequalities (LMIs). The superiority of the proposed approach is demonstrated by two comparative examples

Robust passivity and passification of stochastic fuzzy time-delay systems

The official published version can be obtained from the link below.In this paper, the passivity and passification problems are investigated for a class of uncertain stochastic fuzzy systems with time-varying delays. The fuzzy system is based on the Takagi–Sugeno (T–S) model that is often used to represent the complex nonlinear systems in terms of fuzzy sets and fuzzy reasoning. To reflect more realistic dynamical behaviors of the system, both the parameter uncertainties and the stochastic disturbances are considered, where the parameter uncertainties enter into all the system matrices and the stochastic disturbances are given in the form of a Brownian motion. We first propose the definition of robust passivity in the sense of expectation. Then, by utilizing the Lyapunov functional method, the Itô differential rule and the matrix analysis techniques, we establish several sufficient criteria such that, for all admissible parameter uncertainties and stochastic disturbances, the closed-loop stochastic fuzzy time-delay system is robustly passive in the sense of expectation. The derived criteria, which are either delay-independent or delay-dependent, are expressed in terms of linear matrix inequalities (LMIs) that can be easily checked by using the standard numerical software. Illustrative examples are presented to demonstrate the effectiveness and usefulness of the proposed results.This work was supported by the Teaching and Research Fund for Excellent Young Teachers at Southeast University of China, the Specialized Research Fund for the Doctoral Program of Higher Education for New Teachers 200802861044, the National Natural Science Foundation of China under Grant 60804028 and the Royal Society of the United Kingdom

Combined Convex Technique on Delay-Distribution-Dependent Stability for Delayed Neural Networks

Together with the Lyapunov-Krasovskii functional approach and an improved delay-partitioning idea, one novel sufficient condition is derived to guarantee a class of delayed neural networks to be asymptotically stable in the mean-square sense, in which the probabilistic variable delay and both of delay variation limits can be measured. Through combining the reciprocal convex technique and convex technique one, the criterion is presented via LMIs and its solvability heavily depends on the sizes of both time-delay range and its variations, which can become much less conservative than those present ones by thinning the delay intervals. Finally, it can be demonstrated by four numerical examples that our idea reduces the conservatism more effectively than some earlier reported ones

Finite-time passivity for neutral-type neural networks with time-varying delays – via auxiliary function-based integral inequalities

In this paper, we investigated the problem of the finite-time boundedness and finitetime passivity for neural networks with time-varying delays. A triple, quadrable and five integral terms with the delay information are introduced in the new Lyapunov–Krasovskii functional (LKF). Based on the auxiliary integral inequality, Writinger integral inequality and Jensen’s inequality, several sufficient conditions are derived. Finally, numerical examples are provided to verify the effectiveness of the proposed criterion. There results are compared with the existing results.&nbsp

Event-Triggered State Estimation for a Class of Delayed Recurrent Neural Networks with Sampled-Data Information

The paper investigates the state estimation problem for a class of recurrent neural networks with sampled-data information and time-varying delays. The main purpose is to estimate the neuron states through output sampled measurement; a novel event-triggered scheme is proposed, which can lead to a significant reduction of the information communication burden in the network; the feature of this scheme is that whether or not the sampled data should be transmitted is determined by the current sampled data and the error between the current sampled data and the latest transmitted data. By using a delayed-input approach, the error dynamic system is equivalent to a dynamic system with two different time-varying delays. Based on the Lyapunov-krasovskii functional approach, a state estimator of the considered neural networks can be achieved by solving some linear matrix inequalities, which can be easily facilitated by using the standard numerical software. Finally, a numerical example is provided to show the effectiveness of the proposed event-triggered scheme