Sampled-Data Synchronization of Stochastic Markovian Jump Neural Networks With Time-Varying Delay

In this article, sampled-data synchronization problem for stochastic Markovian jump neural networks (SMJNNs) with time-varying delay under aperiodic sampled-data control is considered. By constructing mode-dependent one-sided loop-based Lyapunov functional and mode-dependent two-sided loop-based Lyapunov functional and using the Itô formula, two different stochastic stability criteria are proposed for error SMJNNs with aperiodic sampled data. The slave system can be guaranteed to synchronize with the master system based on the proposed stochastic stability conditions. Furthermore, two corresponding mode-dependent aperiodic sampled-data controllers design methods are presented for error SMJNNs based on these two different stochastic stability criteria, respectively. Finally, two numerical simulation examples are provided to illustrate that the design method of aperiodic sampled-data controller given in this article can effectively stabilize unstable SMJNNs. It is also shown that the mode-dependent two-sided looped-functional method gives less conservative results than the mode-dependent one-sided looped-functional method.

Weyl almost automorphic solutions in distribution sense of Clifford-valued stochastic neural networks with time-varying delays

In this paper, the existence and stability of Weyl almost automorphic solutions in distribution sense for a class of Clifford-valued stochastic neural networks with time-varying delays are studied by using the direct method. Firstly, the existence and uniqueness of Weyl almost automorphic solutions in distribution sense for this class of neural networks are studied by using the Banach fixed point theorem and the relationship between several different senses of random almost automorphy. Then, the global exponential stability in p th mean of the unique Weyl almost automorphic solution in distribution sense is proved by inequality technique and counter proof method. Even when this class of neural networks we consider is real-valued, our results are new. Meanwhile, the method proposed in this paper can be used to study the existence of Weyl almost automorphic solutions of other types of neural networks including stochastic and deterministic neural networks. Finally, an example is given to illustrate the feasibility of our results.

Protocol-based state estimation for delayed Markovian jumping neural networks

This paper is concerned with the state estimation problem for a class of Markovian jumping neural networks (MJNNs) with sensor nonlinearities, mode-dependent time delays and stochastic disturbances subject to the Round-Robin (RR) scheduling mechanism. The system parameters experience switches among finite modes according to a Markov chain. As an equal allocation scheme, the RR communication protocol is introduced for efficient usage of limited bandwidth and energy saving. The update matrix method is adopted to deal with the periodic time-delays resulting from the RR protocol. The objective of the addressed problem is to construct a state estimator for the MJNNs such that the dynamics of the estimation error is exponentially ultimately bounded in the mean square with a certain upper bound. Sufficient conditions are established for the existence of the desired state estimator by resorting to a combination of the Lyapunov stability theory and the stochastic analysis technique. Furthermore, the estimator gain matrices are characterized in terms of the solution to a convex optimization problem. Finally, a numerical simulation example is exploited to demonstrate the effectiveness of the proposed estimator design strategy.

Neural-Network-Based Adaptive Backstepping Control With Application to Spacecraft Attitude Regulation

This paper investigates the neural-network-based adaptive control problem for a class of continuous-time nonlinear systems with actuator faults and external disturbances. The model uncertainties in the system are not required to satisfy the norm-bounded assumption, and the exact information for components faults and external disturbance is totally unknown, which represents more general cases in practical systems. An indirect adaptive backstepping control strategy is proposed to cope with the stabilization problem, where the unknown nonlinearity is approximated by the adaptive neural-network scheme, and the loss of effectiveness of actuators faults and the norm bounds of exogenous disturbances are estimated via designed online adaptive updating laws. The developed adaptive backstepping control law can ensure the asymptotic stability of the fault closed-loop system despite of unknown nonlinear function, actuator faults, and disturbances. Finally, an application example based on spacecraft attitude regulation is provided to demonstrate the effectiveness and the potential of the developed new neural adaptive control approach.

Reduced- and Full-Order Observers for Delayed Genetic Regulatory Networks

This paper is centered upon the state estimation for delayed genetic regulatory networks. Our aim is at estimating the concentrations of mRNAs and proteins by designing reduced-order and full-order state observers based on available network outputs. We introduce a Lyapunov-Krasovskii functional including quadruplicate integrals, and estimate its derivative by employing the Wirtinger-type integral inequalities, reciprocal convex technique, and convex technique. From which, delay-dependent sufficient conditions, in the form of linear matrix inequalities (LMIs), are investigated to ensure that the resultant error system is asymptotically stable. One can verify these conditions by utilizing the MATLAB Toolboxes LMI or YALMIP. In addition, the gains of reduced-order and full-order observers are represented by the feasible solutions of the LMIs, and thereby, the concrete expressions of the desired reduced-order and full-order state observers are presented. Finally, the simulation results of a numerical example are demonstrated, which explains the validity of the proposed method.

Design of nonlinear optimal control for chaotic synchronization of coupled stochastic neural networks via Hamilton-Jacobi-Bellman equation

This paper presents a new theoretical design of nonlinear optimal control on achieving chaotic synchronization for coupled stochastic neural networks. To obtain an optimal control law, the proposed approach is developed rigorously by using Hamilton-Jacobi-Bellman (HJB) equation, Lyapunov technique, and inverse optimality, and hence guarantees that the chaotic drive network synchronizes with the chaotic response network influenced by uncertain noise signals. Furthermore, the paper provides four numerical examples to demonstrate the effectiveness of the proposed approach.

On Global Dissipativity of Nonautonomous Neural Networks With Multiple Proportional Delays

This brief addresses the problem of global dissipativity analysis of nonautonomous neural networks with multiple proportional delays. By using a novel constructive approach based on some comparison techniques for differential inequalities, new explicit delay-independent conditions are derived using M-matrix theory to ensure the existence of generalized exponential attracting sets and the global dissipativity of the system. The method presented in this brief is also utilized to derive a generalized exponential estimate for a class of Halanay-type inequalities with proportional delays. Finally, three numerical examples are given to illustrate the effectiveness and improvement of the obtained results.

Delay-Dependent Global Exponential Stability for Delayed Recurrent Neural Networks

This paper deals with the global exponential stability for delayed recurrent neural networks (DRNNs). By constructing an augmented Lyapunov-Krasovskii functional and adopting the reciprocally convex combination approach and Wirtinger-based integral inequality, delay-dependent global exponential stability criteria are derived in terms of linear matrix inequalities. Meanwhile, a general and effective method on global exponential stability analysis for DRNNs is given through a lemma, where the exponential convergence rate can be estimated. With this lemma, some global asymptotic stability criteria of DRNNs acquired in previous studies can be generalized to global exponential stability ones. Finally, a frequently utilized numerical example is carried out to illustrate the effectiveness and merits of the proposed theoretical results.

Optimal Communication Network-Based H∞ Quantized Control With Packet Dropouts for a Class of Discrete-Time Neural Networks With Distributed Time Delay

This paper is concerned with optimal communication network-based H∞ quantized control for a discrete-time neural network with distributed time delay. Control of the neural network (plant) is implemented via a communication network. Both quantization and communication network-induced data packet dropouts are considered simultaneously. It is assumed that the plant state signal is quantized by a logarithmic quantizer before transmission, and communication network-induced packet dropouts can be described by a Bernoulli distributed white sequence. A new approach is developed such that controller design can be reduced to the feasibility of linear matrix inequalities, and a desired optimal control gain can be derived in an explicit expression. It is worth pointing out that some new techniques based on a new sector-like expression of quantization errors, and the singular value decomposition of a matrix are developed and employed in the derivation of main results. An illustrative example is presented to show the effectiveness of the obtained results.

The stability of impulsive stochastic Cohen-Grossberg neural networks with mixed delays and reaction-diffusion terms

The global asymptotic stability of impulsive stochastic Cohen-Grossberg neural networks with mixed delays and reaction-diffusion terms is investigated. Under some suitable assumptions and using Lyapunov-Krasovskii functional method, we apply the linear matrix inequality technique to propose some new sufficient conditions for the global asymptotic stability of the addressed model in the stochastic sense. The mixed time delays comprise both the time-varying and continuously distributed delays. The effectiveness of the theoretical result is illustrated by a numerical example.

Exponential stabilization for sampled-data neural-network-based control systems

This paper investigates the problem of sampled-data stabilization for neural-network-based control systems with an optimal guaranteed cost. Using time-dependent Lyapunov functional approach, some novel conditions are proposed to guarantee the closed-loop systems exponentially stable, which fully use the available information about the actual sampling pattern. Based on the derived conditions, the design methods of the desired sampled-data three-layer fully connected feedforward neural-network-based controller are established to obtain the largest sampling interval and the smallest upper bound of the cost function. A practical example is provided to demonstrate the effectiveness and feasibility of the proposed techniques.

Nonlinearly Activated Neural Network for Solving Time-Varying Complex Sylvester Equation

The Sylvester equation is often encountered in mathematics and control theory. For the general time-invariant Sylvester equation problem, which is defined in the domain of complex numbers, the Bartels-Stewart algorithm and its extensions are effective and widely used with an O(n³) time complexity. When applied to solving the time-varying Sylvester equation, the computation burden increases intensively with the decrease of sampling period and cannot satisfy continuous realtime calculation requirements. For the special case of the general Sylvester equation problem defined in the domain of real numbers, gradient-based recurrent neural networks are able to solve the time-varying Sylvester equation in real time, but there always exists an estimation error while a recently proposed recurrent neural network by Zhang et al [this type of neural network is called Zhang neural network (ZNN)] converges to the solution ideally. The advancements in complex-valued neural networks cast light to extend the existing real-valued ZNN for solving the time-varying real-valued Sylvester equation to its counterpart in the domain of complex numbers. In this paper, a complex-valued ZNN for solving the complex-valued Sylvester equation problem is investigated and the global convergence of the neural network is proven with the proposed nonlinear complex-valued activation functions. Moreover, a special type of activation function with a core function, called sign-bi-power function, is proven to enable the ZNN to converge in finite time, which further enhances its advantage in online processing. In this case, the upper bound of the convergence time is also derived analytically. Simulations are performed to evaluate and compare the performance of the neural network with different parameters and activation functions. Both theoretical analysis and numerical simulations validate the effectiveness of the proposed method.

Stability analysis of time-delay neural networks subject to stochastic perturbations

This paper is concerned with the problem of mean-square exponential stability of uncertain neural networks with time-varying delay and stochastic perturbation. Both linear and nonlinear stochastic perturbations are considered. The main features of this paper are twofold: 1) Based on generalized Finsler lemma, some improved delay-dependent stability criteria are established, which are more efficient than the existing ones in terms of less conservatism and lower computational complexity; and 2) when the nonlinear stochastic perturbation acting on the system satisfies a class of Lipschitz linear growth conditions, the restrictive condition P < δI (or the similar ones) in the existing results can be relaxed under some assumptions. The usefulness of the proposed method is demonstrated by illustrative examples.

New algebraic criteria for synchronization stability of chaotic memristive neural networks with time-varying delays

In this brief, we consider the exponential synchronization of chaotic memristive neural networks with time-varying delays using the Lyapunov functional method and inequality technique. The dynamic analysis here employs the theory of differential equations with discontinuous right-hand side as introduced by Filippov. The designing laws in the synchronization of neural networks are proposed via state or output coupling. In addition, the new proposed algebraic criteria are very easy to verify, and they also enrich and improve the earlier publications. Finally, an example is given to show the effectiveness of the obtained results.

Coordination of multiagents interacting under independent position and velocity topologies

We consider the coordination control for multiagent systems in a very general framework where the position and velocity interactions among agents are modeled by independent graphs. Different algorithms are proposed and analyzed for different settings, including the case without leaders and the case with a virtual leader under fixed position and velocity interaction topologies, as well as the case with a group velocity reference signal under switching velocity interaction. It is finally shown that the proposed algorithms are feasible in achieving the desired coordination behavior provided the interaction topologies satisfy the weakest possible connectivity conditions. Such conditions relate only to the structure of the interactions among agents while irrelevant to their magnitudes and thus are easy to verify. Rigorous convergence analysis is preformed based on a combined use of tools from algebraic graph theory, matrix analysis as well as the Lyapunov stability theory.

Synchronization of Coupled Neutral-Type Neural Networks With Jumping-Mode-Dependent Discrete and Unbounded Distributed Delays

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.