Stability and synchronization of discrete-time Markovian jumping neural networks with mixed mode-dependent time delays

Copyright [2009] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we introduce a new class of discrete-time neural networks (DNNs) with Markovian jumping parameters as well as mode-dependent mixed time delays (both discrete and distributed time delays). Specifically, the parameters of the DNNs are subject to the switching from one to another at different times according to a Markov chain, and the mixed time delays consist of both discrete and distributed delays that are dependent on the Markovian jumping mode. We first deal with the stability analysis problem of the addressed neural networks. A special inequality is developed to account for the mixed time delays in the discrete-time setting, and a novel Lyapunov-Krasovskii functional is put forward to reflect the mode-dependent time delays. Sufficient conditions are established in terms of linear matrix inequalities (LMIs) that guarantee the stochastic stability. We then turn to the synchronization problem among an array of identical coupled Markovian jumping neural networks with mixed mode-dependent time delays. By utilizing the Lyapunov stability theory and the Kronecker product, it is shown that the addressed synchronization problem is solvable if several LMIs are feasible. Hence, different from the commonly used matrix norm theories (such as the M-matrix method), a unified LMI approach is developed to solve the stability analysis and synchronization problems of the class of neural networks under investigation, where the LMIs can be easily solved by using the available Matlab LMI toolbox. Two numerical examples are presented to illustrate the usefulness and effectiveness of the main results obtained

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

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

Exponential synchronization of complex networks with Markovian jump and mixed delays

This is the post print version of the article. The official published version can be obtained from the link - Copyright 2008 Elsevier LtdIn this Letter, we investigate the exponential synchronization problem for an array of N linearly coupled complex networks with Markovian jump and mixed time-delays. The complex network consists of m modes and the network switches from one mode to another according to a Markovian chain with known transition probability. The mixed time-delays are composed of discrete and distributed delays, both of which are mode-dependent. The nonlinearities imbedded with the complex networks are assumed to satisfy the sector condition that is more general than the commonly used Lipschitz condition. By making use of the Kronecker product and the stochastic analysis tool, we propose a novel Lyapunov–Krasovskii functional suitable for handling distributed delays and then show that the addressed synchronization problem is solvable if a set of linear matrix inequalities (LMIs) are feasible. Therefore, a unified LMI approach is developed to establish sufficient conditions for the coupled complex network to be globally exponentially synchronized in the mean square. Note that the LMIs can be easily solved by using the Matlab LMI toolbox and no tuning of parameters is required. A simulation example is provided to demonstrate the usefulness of the main results obtained.This work was supported in part by the Biotechnology and Biological Sciences Research Council (BBSRC) of the UK under Grants BB/C506264/1 and 100/EGM17735, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grants GR/S27658/01 and EP/C524586/1, an International Joint Project sponsored by the Royal Society of the UK, the Natural Science Foundation of Jiangsu Province of China under Grant BK2007075, the National Natural Science Foundation of China under Grant 60774073, and the Alexander von Humboldt Foundation of Germany

State estimation for discrete-time Markovian jumping neural networks with mixed mode-dependent delays

This is the post print version of the article. The official published version can be obtained from the link - Copyright 2008 Elsevier LtdIn this Letter, we investigate the state estimation problem for a new class of discrete-time neural networks with Markovian jumping parameters as well as mode-dependent mixed time-delays. The parameters of the discrete-time neural networks are subject to the switching from one mode to another at different times according to a Markov chain, and the mixed time-delays consist of both discrete and distributed delays that are dependent on the Markovian jumping mode. New techniques are developed to deal with the mixed time-delays in the discrete-time setting, and a novel Lyapunov–Krasovskii functional is put forward to reflect the mode-dependent time-delays. Sufficient conditions are established in terms of linear matrix inequalities (LMIs) that guarantee the existence of the state estimators. We show that both the existence conditions and the explicit expression of the desired estimator can be characterized in terms of the solution to an LMI. A numerical example is exploited to show the usefulness of the derived LMI-based conditions.This work was supported in part by the Biotechnology and Biological Sciences Research Council (BBSRC) of the UK under Grants BB/C506264/1 and 100/EGM17735, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grants GR/S27658/01 and EP/C524586/1, an International Joint Project sponsored by the Royal Society of the UK, the Natural Science Foundation of Jiangsu Province of China under Grant BK2007075, the National Natural Science Foundation of China under Grant 60774073, and the Alexander von Humboldt Foundation of Germany

Distributed state estimation for uncertain Markov-type sensor networks with mode-dependent distributed delays

This the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 John Wiley & Sons, Ltd.In this paper, the distributed state estimation problem is investigated for a class of sensor networks described by uncertain discrete-time dynamical systems with Markovian jumping parameters and distributed time-delays. The sensor network consists of sensor nodes characterized by a directed graph with a nonnegative adjacency matrix that specifies the interconnection topology (or the distribution in the space) of the network. Both the parameters of the target plant and the sensor measurements are subject to the switches from one mode to another at different times according to a Markov chain. The parameter uncertainties are norm-bounded that enter into both the plant system as well as the network outputs. Furthermore, the distributed time-delays are considered, which are also dependent on the Markovian jumping mode. Through the measurements from a small fraction of the sensors, this paper aims to design state estimators that allow the nodes of the sensor network to track the states of the plant in a distributed way. It is verified that such state estimators do exist if a set of matrix inequalities is solvable. A numerical example is provided to demonstrate the effectiveness of the designed distributed state estimators.This work was supported in part by the Royal Society of the U.K., the National Natural Science Foundation of China under Grants 60804028 and 61028008, the Specialized Research Fund for the Doctoral Program of Higher Education for New Teachers in China under Grant 200802861044, the Teaching and Research Fund for Excellent Young Teachers at Southeast University of China, the International Science and Technology Cooperation Project of China under Grant No. 2009DFA32050, and the Alexander von Humboldt Foundation of Germany

A review on analysis and synthesis of nonlinear stochastic systems with randomly occurring incomplete information

Copyright q 2012 Hongli Dong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In the context of systems and control, incomplete information refers to a dynamical system in which knowledge about the system states is limited due to the difficulties in modeling complexity in a quantitative way. The well-known types of incomplete information include parameter uncertainties and norm-bounded nonlinearities. Recently, in response to the development of network technologies, the phenomenon of randomly occurring incomplete information has become more and more prevalent. Such a phenomenon typically appears in a networked environment. Examples include, but are not limited to, randomly occurring uncertainties, randomly occurring nonlinearities, randomly occurring saturation, randomly missing measurements and randomly occurring quantization. Randomly occurring incomplete information, if not properly handled, would seriously deteriorate the performance of a control system. In this paper, we aim to survey some recent advances on the analysis and synthesis problems for nonlinear stochastic systems with randomly occurring incomplete information. The developments of the filtering, control and fault detection problems are systematically reviewed. Latest results on analysis and synthesis of nonlinear stochastic systems are discussed in great detail. In addition, various distributed filtering technologies over sensor networks are highlighted. Finally, some concluding remarks are given and some possible future research directions are pointed out. © 2012 Hongli Dong et al.This work was supported in part by the National Natural Science Foundation of China under Grants 61273156, 61134009, 61273201, 61021002, and 61004067, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, the National Science Foundation of the USA under Grant No. HRD-1137732, and the Alexander von Humboldt Foundation of German

Synchronization of stochastic genetic oscillator networks with time delays and Markovian jumping parameters

The official published version of the article can be found at the link below.Genetic oscillator networks (GONs) are inherently coupled complex systems where the nodes indicate the biochemicals and the couplings represent the biochemical interactions. This paper is concerned with the synchronization problem of a general class of stochastic GONs with time delays and Markovian jumping parameters, where the GONs are subject to both the stochastic disturbances and the Markovian parameter switching. The regulatory functions of the addressed GONs are described by the sector-like nonlinear functions. By applying up-to-date ‘delay-fractioning’ approach for achieving delay-dependent conditions, we construct novel matrix functional to derive the synchronization criteria for the GONs that are formulated in terms of linear matrix inequalities (LMIs). Note that LMIs are easily solvable by the Matlab toolbox. A simulation example is used to demonstrate the synchronization phenomena within biological organisms of a given GON and therefore shows the applicability of the obtained results.This work was supported in part by the Biotechnology and Biological Sciences Research Council (BBSRC) of the UK under Grants BB/C506264/1 and 100/EGM17735, the Royal Society of the UK, the National Natural Science Foundation of China under Grant 60804028, the Teaching and Research Fund for Excellent Young Teachers at Southeast University of China, the International Science and Technology Cooperation Project of China under Grant 2009DFA32050, and the Alexander von Humboldt Foundation of Germany

Non-fragile state estimation for discrete Markovian jumping neural networks

In this paper, the non-fragile state estimation problem is investigated for a class of discrete-time neural networks subject to Markovian jumping parameters and time delays. In terms of a Markov chain, the mode switching phenomenon at different times is considered in both the parameters and the discrete delays of the neural networks. To account for the possible gain variations occurring in the implementation, the gain of the estimator is assumed to be perturbed by multiplicative norm-bounded uncertainties. We aim to design a non-fragile state estimator such that, in the presence of all admissible gain variations, the estimation error converges to zero exponentially. By adopting the Lyapunov–Krasovskii functional and the stochastic analysis theory, sufficient conditions are established to ensure the existence of the desired state estimator that guarantees the stability of the overall estimation error dynamics. The explicit expression of such estimators is parameterized by solving a convex optimization problem via the semi-definite programming method. A numerical simulation example is provided to verify the usefulness of the proposed methods

Stability and synchronization of discrete-time neural networks with switching parameters and time-varying delays

published_or_final_versio