Robust H∞ performance for discrete time T-S fuzzy switched memristive stochasticneural networks with mixed time-varying delays

ABSTRACT

In this paper, we study the robust H _∞ performance for discrete-time T-S fuzzy switched memristive stochastic neural networks with mixed time-varying delays and switching signal design. The neural network under consideration is subject to time-varying and norm bounded parameter uncertainties. Decomposing of the delay interval approach is employed in both the discrete delays and distributed delays. By constructing a proper Lyapunov-Krasovskii functional (LKF) with triple summation terms and using an improved summation inequality techniques. Sufficient conditions are derived in terms of linear matrix inequalities (LMIs) to guarantee the considered discrete-time neural networks to be exponentially stable. Finally, numerical examples with simulation results are given to illustrate the effectiveness of the developed theoretical results.     

Global Synchronization for Discrete-Time Stochastic Complex Networks With Randomly Occurred Nonlinearities and Mixed Time Delays

In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discrete-time stochastic complex networks with randomly occurred nonlinearities (RONs) and time delays. The discrete-time complex networks under consideration are subject to: 1) stochastic nonlinearities that occur according to the Bernoulli distributed white noise sequences; 2) stochastic disturbances that enter the coupling term, the delayed coupling term as well as the overall network; and 3) time delays that include both the discrete and distributed ones. Note that the newly introduced RONs and the multiple stochastic disturbances can better reflect the dynamical behaviors of coupled complex networks whose information transmission process is affected by a noisy environment (e.g., internet-based control systems). By constructing a novel Lyapunov-like matrix functional, the idea of delay fractioning is applied to deal with the addressed synchronization analysis problem. By employing a combination of the linear matrix inequality (LMI) techniques, the free-weighting matrix method and stochastic analysis theories, several delay-dependent sufficient conditions are obtained which ensure the asymptotic synchronization in the mean square sense for the discrete-time stochastic complex networks with time delays. The criteria derived are characterized in terms of LMIs whose solution can be solved by utilizing the standard numerical software. A simulation example is presented to show the effectiveness and applicability of the proposed results.      

Pseudo Almost Periodic Solution of Recurrent Neural Networks with D Operator on Time Scales

This paper is concerned with a class of neutral type recurrent neural networks with time-varying delays, distributed delay and D operator on time–space scales which unify the continuous-time and the discrete-time recurrent neural networks under the same framework. Some sufficient conditions are given for the existence and the global exponential stability of the pseudo almost periodic solution by using inequality analysis techniques on time scales, fixed point theorem and the theory of calculus on time scales. An example is given to show the effectiveness of the derived results via computer simulations.

     

Synchronization and State Estimation for Discrete-Time Complex Networks With Distributed Delays

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.      

Global exponential stability analysis of delayed Cohen--Grossberg neural networks with distributed delays

In this article, the global exponential stability problem of Cohen--Grossberg neural networks with both discrete-time delays and distributed delays is investigated. The existence and global stability for the unique equilibrium of the Cohen--Grossberg neural networks with distributed delays are achieved by using some new Lyapunov functionals, M-matrix theory and some analytic techniques, and some less restrictive conditions are obtained. An example is also worked out to validate the advantages of our results.     

Delay-distribution-dependent stability of stochastic discrete-time neural networks with randomly mixed time-varying delays

In this paper, the stability analysis problem for a new class of discrete-time neural networks with randomly discrete and distributed time-varying delays has been investigated. Compared with the previous work, the distributed delay is assumed to be time-varying. Moreover, the effects of both variation range and probability distribution of mixed time-delays are taken into consideration in the proposed approach. The distributed time-varying delays and coupling term in complex networks are considered by introducing two Bernoulli stochastic variables. By using some novel analysis techniques and Lyapunov–Krasovskii function, some delay-distribution-dependent conditions are derived to ensure that the discrete-time complex network with randomly coupling term and distributed time-varying delay is synchronized in mean square. A numerical example is provided to demonstrate the effectiveness and the applicability of the proposed method.     

Design of H 2 Controllers for Sampled-Data Systems with Input Time Delays

This paper presents a general framework based on lifting technique for sampled-data systems with input time delays. By analyzing the properties of operator-valued matrices of lifted systems with input time delays, an extended lifting technique is obtained. It is then shown that, with the proposed lifting technique, the complex behavior of the system can be illustrated by two simple lifted systems, which construct the extended lifted system. The extended lifted system has the same induced norm as that of the original system with an input time delay, since the proposed lifting technique is an isometric isomorphism. Through applying the proposed lifting technique to sampled-data systems with input time delays, the time-invariant discrete-time system with infinite-dimensional input and output spaces is obtained. The equivalent discrete-time system, which is derived from the extended lifted system, can satisfy the problem of H ₂ sampled-data control systems with input time delays. Simulation results are given to show that the proposed method can guarantee a more stable system response than the conventional H ₂ sampled-data controller for the sampled-data systems with the various input time delays.     

Robust stability of Markovian jump discrete-time neural networks with partly unknown transition probabilities and mixed mode-dependent delays

This article discusses the robust stability problem for a class of uncertain Markovian jump discrete-time neural networks with partly unknown transition probabilities and mixed mode-dependent time delays. The transition probabilities of the mode jumps are considered to be partly unknown, which relax the traditional assumption in Markovian jump systems that all of them must be completely known a priori. The mixed time delays consist of both discrete and distributed delays that are dependent on the Markovian jump modes. By employing the Lyapunov functional and linear matrix inequality approach, some sufficient criteria are derived for the robust stability of the underlying systems. A numerical example is exploited to illustrate the developed theory.     

Gaussian-consensus filter for nonlinear systems with randomly delayed measurements in sensor networks

This paper presents the decentralized state estimation problem of discrete-time nonlinear systems with randomly delayed measurements in sensor networks. In this problem, measurement data from the sensor network is sent to a remote processing network via data transmission network, with random measurement delays obeying a Markov chain. Here, we present the Gaussian-consensus filter (GCF) to pursue a tradeoff between estimate accuracy and computing time. It includes a novel Gaussian approximated filter with estimated delay probability (GEDPF) online in the sense of minimizing the estimate error covariance in each local processing unit (PU), and a consensus strategy among PUs in processing network to give a fast decentralized fusion. A numerical example with different measurement delays is simulated to validate the proposed method.     

Novel delay-dependent stability condition for mixed delayed stochastic neural networks with leakage delay signals

In this paper, the problem of stability condition for mixed delayed stochastic neural networks with neutral delay and leakage delay is investigated. A novel Lyapunov functional is constructed with double and triple integral terms. New sufficient conditions are derived to guarantee the global asymptotic stability of the concerned neural network. This paper is more general than the paper by Zhu et al. [Robust stability of Markovian jump stochastic neural networks with time delays in the leakage terms, Neural Process. Lett. 41 (2015), pp. 1–27]. In our paper, we considered both the neutral delay and leakage delay, but the paper by Zhu et al. is not considering the neutral delay. Also we employed triple integrals in the Lyapunov functional which is not used in the paper by Zhu et al. Finally, two numerical examples are provided to show the effectiveness of the theoretical results.     

Stability Analysis of Discrete-Time Recurrent Neural Networks With Stochastic Delay

This paper is concerned with the stability analysis of discrete-time recurrent neural networks (RNNs) with time delays as random variables drawn from some probability distribution. By introducing the variation probability of the time delay, a common delayed discrete-time RNN system is transformed into one with stochastic parameters. Improved conditions for the mean square stability of these systems are obtained by employing new Lyapunov functions and novel techniques are used to achieve delay dependence. The merit of the proposed conditions lies in its reduced conservatism, which is made possible by considering not only the range of the time delays, but also the variation probability distribution. A numerical example is provided to show the advantages of the proposed conditions.      

Consensus networks with time-delays over finite fields

In this paper, we investigate the consensus problem in networks with time-delays over finite fields. The delays are categorised into three cases: single constant delay, multiple constant delays, and time-varying bounded delays. For all cases, some sufficient and necessary conditions for consensus are derived. Furthermore, assuming that the communication graph is strongly connected, some of the obtained necessary conditions reveal that the conditions for consensus with time-delays over finite fields depend not only on the diagonal entries but also on the off-diagonal entries, something that is intrinsically distinct from the case over real numbers (where having at least one nonzero diagonal entry is a sufficient and necessary condition to guarantee consensus). In addition, it is shown that delayed networks cannot achieve consensus when the interaction graph is a tree if the corresponding delay-free networks cannot reach consensus, which is consistent with the result over real numbers. As for average consensus, we show that it can never be achieved for delayed networks over finite fields, although it indeed can be reached under several conditions for delay-free networks over finite fields. Finally, networks with time-varying delays are discussed and one sufficient condition for consensus is presented by graph-theoretic method.     

Observer-based H∞ fuzzy control for discrete-time Takagi–Sugeno fuzzy mixed delay systems with random packet losses and multiplicative noises

This paper investigates the observer-based H_∞ fuzzy control problem for a class of discrete-time fuzzy mixed delay systems with random communication packet losses and multiplicative noises, where the mixed delays comprise both discrete time-varying and distributed delays. The random packet losses are described by a Bernoulli distributed white sequence that obeys a conditional probability distribution, and the multiplicative disturbances are in the form of a scalar Gaussian white noise with unit variance. In the presence of mixed delays, random packet losses and multiplicative noises, sufficient conditions for the existence of an observer-based fuzzy feedback controller are derived, such that the closed-loop control system is asymptotically mean-square stable and preserves a guaranteed H_∞ performance. Then a linear matrix inequality approach for designing such an observer-based H_∞ fuzzy controller is presented. Finally, a numerical example is provided to illustrate the effectiveness of the developed theoretical results.     

Input–output approach to stability and -gain analysis of systems with time-varying delays

Stability and L₂ (l₂)-gain of linear (continuous-time and discrete-time) systems with uncertain bounded time-varying delays are analyzed under the assumption that the nominal delay values are not equal to zero. The delay derivatives (in the continuous-time) are not assumed to be less than q<1. An input–output approach is applied by introducing a new input–output model, which leads to effective frequency domain and time domain criteria. The new method significantly improves the existing results for delays with derivatives not greater than 1, which were treated in the past as fast-varying delays (without any constraints on the delay derivatives). New bounded real lemmas (BRLs) are derived for systems with state and objective vector delays and norm-bounded uncertainties. Numerical examples illustrate the efficiency of the new method.     

Consensus protocols for discrete-time multi-agent systems with time-varying delays

This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm proposed by Jadbabaie et al., specifically, the presented protocols allow for the case that agents can only use delayed information of themselves, whereas the popular one is invalid. It is proved that if the union of the interaction topologies across the time interval with some given length always has a spanning tree, then in the presence of bounded time-varying delays, those protocols solve consensus problems.     

State analytical predictor for systems with multiple time delays

An approach for the design of a dead-time compensator for processes with time delays is presented. The proposed algorithm deals with multivariable state-space models instead of input-output models and utilizes not only a single delay but also distributed delays in the feedback loop. Both the continuous-time and discrete-time versions of the algorithm are derived. The design strategy of the controller is based on the approach of LQG design. It is incorporated into the dead-time compensation technique of the analytical predictor, which uses the process model directly to predict the effect of input variables on the process outputs. By introducing an integral action into the observation system, the steady-state observation error of the inaccessible load inputs converges to zero. This permits us to perform disturbance prediction and compensation within a single design. Theoretical analysis shows that this control strategy fully removes time delay elements from a system characteristic equation in the ideal situation of a system without model-plant mismatch and/or noise measurements. By the estimation and prediction of the unknown plant-input disturbances, the capability for rejecting input disturbances has also been improved. The control structure developed is shown to have the same closed-loop relationships as the linear quadratic feedback structure for a system without lime delays. The potential benefits of the proposed controller are demonstrated by the control problem of an industrial grinding system studied previously by Niemi et al. (1982) and Ylinen et al. (1987), which is a challenging problem for MPC-type algorithms.     

Unified stabilizing controller synthesis approach for discrete-time intelligent systems with time delays by dynamic output feedback

A novel model, termed the standard neural network model (SNNM), is advanced to describe some delayed (or non-delayed) discrete-time intelligent systems com- posed of neural networks and Takagi and Sugeno (T-S) fuzzy models. The SNNM is composed of a discrete-time linear dynamic system and a bounded static nonlinear operator. Based on the global asymptotic stability analysis of the SNNMs, linear and nonlinear dynamic output feedback controllers are designed for the SNNMs to stabilize the closed-loop systems, respectively. The control design equations are shown to be a set of linear matrix inequalities (LMIs) which can be easily solved by various convex optimization algorithms to determine the control signals. Most neural-network-based (or fuzzy) discrete-time intelligent systems with time delays or without time delays can be transformed into the SNNMs for controller synthesis in a unified way. Three application examples show that the SNNMs not only make controller synthesis of neural-network-based (or fuzzy) discrete-time intelligent systems much easier, but also provide a new approach to the synthesis of the controllers for the other type of nonlinear systems.     

Predictive Consensus for Networked Multi‐Agent Systems with Switching Topology and Variable Delay

This paper investigates consensus problems of networked linear time invariant (LTI) multi‐agent systems, subject to variable network delays and switching topology. A new protocol is proposed for such systems with matrix B that has full row rank, based on stochastic, indecomposable, aperiodic (SIA) matrix and the predictive control scheme. With the predictive scheme the network delay is compensated. Consensus analysis based on the seminorm is provided. The conditions are obtained for such systems with periodic switching topology to reach consensus. The proposed protocol can deal with time‐varying delays, switching topology, and an unstable mode. The numerical examples demonstrate the effectiveness of the theoretical results.     

Discrete-time multi-agent consensus with quantization and communication delays

In this paper, discrete-time multi-agent consensus problem with quantization and communication delays is investigated. A new discrete-time multi-agent consensus model is considered in which each agent can only receive the delayed quantized information from its neighbors. In the presence of quantization and communication delays, it is shown that the multi-agent network can achieve consensus under the connectivity network topology. Simulation examples are also provided to demonstrate the correctness of the theoretical results.