Robust synchronization of an array of coupled stochastic discrete-time delayed neural networks

Copyright [2008] 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.This paper is concerned with the robust synchronization problem for an array of coupled stochastic discrete-time neural networks with time-varying delay. The individual neural network is subject to parameter uncertainty, stochastic disturbance, and time-varying delay, where the norm-bounded parameter uncertainties exist in both the state and weight matrices, the stochastic disturbance is in the form of a scalar Wiener process, and the time delay enters into the activation function. For the array of coupled neural networks, the constant coupling and delayed coupling are simultaneously considered. We aim to establish easy-to-verify conditions under which the addressed neural networks are synchronized. By using the Kronecker product as an effective tool, a linear matrix inequality (LMI) approach is developed to derive several sufficient criteria ensuring the coupled delayed neural networks to be globally, robustly, exponentially synchronized in the mean square. The LMI-based conditions obtained are dependent not only on the lower bound but also on the upper bound of the time-varying delay, and can be solved efficiently via the Matlab LMI Toolbox. Two numerical examples are given to demonstrate the usefulness of the proposed synchronization scheme

State estimation for coupled uncertain stochastic networks with missing measurements and time-varying delays: The discrete-time case

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.This paper is concerned with the problem of state estimation for a class of discrete-time coupled uncertain stochastic complex networks with missing measurements and time-varying delay. The parameter uncertainties are assumed to be norm-bounded and enter into both the network state and the network output. The stochastic Brownian motions affect not only the coupling term of the network but also the overall network dynamics. The nonlinear terms that satisfy the usual Lipschitz conditions exist in both the state and measurement equations. Through available output measurements described by a binary switching sequence that obeys a conditional probability distribution, we aim to design a state estimator to estimate the network states such that, for all admissible parameter uncertainties and time-varying delays, the dynamics of the estimation error is guaranteed to be globally exponentially stable in the mean square. By employing the Lyapunov functional method combined with the stochastic analysis approach, several delay-dependent criteria are established that ensure the existence of the desired estimator gains, and then the explicit expression of such estimator gains is characterized in terms of the solution to certain linear matrix inequalities (LMIs). Two numerical examples are exploited to illustrate the effectiveness of the proposed estimator design schemes

Robust H∞ filtering for discrete nonlinear stochastic systems with time-varying delay

This is the postprint version of the article. The official published version can be accessed from the link below - © 2007 Elsevier IncIn this paper, we are concerned with the robust H∞ filtering problem for a class of nonlinear discrete time-delay stochastic systems. The system under study involves parameter uncertainties, stochastic disturbances, time-varying delays and sector-like nonlinearities. The problem addressed is the design of a full-order filter such that, for all admissible uncertainties, nonlinearities and time delays, the dynamics of the filtering error is constrained to be robustly asymptotically stable in the mean square, and a prescribed H∞ disturbance rejection attenuation level is also guaranteed. By using the Lyapunov stability theory and some new techniques, sufficient conditions are first established to ensure the existence of the desired filtering parameters. These conditions are dependent on the lower and upper bounds of the time-varying delays. Then, the explicit expression of the desired filter gains is described in terms of the solution to a linear matrix inequality (LMI). Finally, a numerical example is exploited to show the usefulness of the results derived.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Nuffield Foundation of the UK under Grant NAL/00630/G, the Alexander von Humboldt Foundation of Germany, the National Natural Science Foundation of China (60774073 and 10471119), the NSF of Jiangsu Province of China (BK2007075 and BK2006064), the Natural Science Foundation of Jiangsu Education Committee of China under Grant 06KJD110206, and the Scientific Innovation Fund of Yangzhou University of China under Grant 2006CXJ002

On Robustness Analysis of a Dynamic Average Consensus Algorithm to Communication Delay

This paper studies the robustness of a dynamic average consensus algorithm to communication delay over strongly connected and weight-balanced (SCWB) digraphs. Under delay-free communication, the algorithm of interest achieves a practical asymptotic tracking of the dynamic average of the time-varying agents' reference signals. For this algorithm, in both its continuous-time and discrete-time implementations, we characterize the admissible communication delay range and study the effect of the delay on the rate of convergence and the tracking error bound. Our study also includes establishing a relationship between the admissible delay bound and the maximum degree of the SCWB digraphs. We also show that for delays in the admissible bound, for static signals the algorithms achieve perfect tracking. Moreover, when the interaction topology is a connected undirected graph, we show that the discrete-time implementation is guaranteed to tolerate at least one step delay. Simulations demonstrate our results

On robust stability of stochastic genetic regulatory networks with time delays: A delay fractioning approach

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.Robust stability serves as an important regulation mechanism in system biology and synthetic biology. In this paper, the robust stability analysis problem is investigated for a class of nonlinear delayed genetic regulatory networks with parameter uncertainties and stochastic perturbations. The nonlinear function describing the feedback regulation satisfies the sector condition, the time delays exist in both translation and feedback regulation processes, and the state-dependent Brownian motions are introduced to reflect the inherent intrinsic and extrinsic noise perturbations. The purpose of the addressed stability analysis problem is to establish some easy-to-verify conditions under which the dynamics of the true concentrations of the messenger ribonucleic acid (mRNA) and protein is asymptotically stable irrespective of the norm-bounded modeling errors. By utilizing a new Lyapunov functional based on the idea of “delay fractioning”, we employ the linear matrix inequality (LMI) technique to derive delay-dependent sufficient conditions ensuring the robust stability of the gene regulatory networks. Note that the obtained results are formulated in terms of LMIs that can easily be solved using standard software packages. Simulation examples are exploited to illustrate the effectiveness of the proposed design procedures

Synchronization and state estimation for discrete-time complex networks with distributed delays

Copyright [2008] 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, a synchronization problem is investigated for an array of coupled complex discrete-time networks with the simultaneous presence of both the discrete and distributed time delays. The complex networks addressed which include neural and social networks as special cases are quite general. Rather than the commonly used Lipschitz-type function, a more general sector-like nonlinear function is employed to describe the nonlinearities existing in the network. The distributed infinite time delays in the discrete-time domain are first defined. By utilizing a novel Lyapunov-Krasovskii functional and the Kronecker product, it is shown that the addressed discrete-time complex network with distributed delays is synchronized if certain linear matrix inequalities (LMIs) are feasible. The state estimation problem is then studied for the same complex network, where the purpose is to design a state estimator to estimate the network states through available output measurements such that, for all admissible discrete and distributed delays, the dynamics of the estimation error is guaranteed to be globally asymptotically stable. Again, an LMI approach is developed for the state estimation problem. Two simulation examples are provided to show the usefulness of the proposed global synchronization and state estimation conditions. It is worth pointing out that our main results are valid even if the nominal subsystems within the network are unstable

Mittag–Leffler synchronization for impulsive fractional-order bidirectional associative memory neural networks via optimal linear feedback control

In this paper, we are concerned with the synchronization scheme for fractional-order bidirectional associative memory (BAM) neural networks, where both synaptic transmission delay and impulsive effect are considered. By constructing Lyapunov functional, sufficient conditions are established to ensure the Mittag–Leffler synchronization. Based on Pontryagin’s maximum principle with delay, time-dependent control gains are obtained, which minimize the accumulative errors within the limitation of actuator saturation during the Mittag–Leffler synchronization. Numerical simulations are carried out to illustrate the feasibility and effectiveness of theoretical results with the help of the modified predictor-corrector algorithm and the forward-backward sweep method