Stability and stabilization of delayed T-S fuzzy systems: A delay partitioning approach

This paper proposes a new approach, namely, the delay partitioning approach, to solving the problems of stability analysis and stabilization for continuous time-delay Takagi-Sugeno fuzzy systems. Based on the idea of delay fractioning, a new method is proposed for the delay-dependent stability analysis of fuzzy time-delay systems. Due to the instrumental idea of delay partitioning, the proposed stability condition is much less conservative than most of the existing results. The conservatism reduction becomes more obvious with the partitioning getting thinner. Based on this, the problem of stabilization via the so-called parallel distributed compensation scheme is also solved. Both the stability and stabilization results are further extended to time-delay fuzzy systems with time-varying parameter uncertainties. All the results are formulated in the form of linear matrix inequalities (LMIs), which can be readily solved via standard numerical software. The advantage of the results proposed in this paper lies in their reduced conservatism, as shown via detailed illustrative examples. The idea of delay partitioning is well demonstrated to be efficient for conservatism reduction and could be extended to solving other problems related to fuzzy delay systems. © 2009 IEEE.published_or_final_versio

Dissipativity analysis of stochastic fuzzy neural networks with randomly occurring uncertainties using delay dividing approach

This paper focuses on the problem of delay-dependent robust dissipativity analysis for a class of stochastic fuzzy neural networks with time-varying delay. The randomly occurring uncertainties under consideration are assumed to follow certain mutually uncorrelated Bernoulli-distributed white noise sequences. Based on the Itô's differential formula, Lyapunov stability theory, and linear matrix inequalities techniques, several novel sufficient conditions are derived using delay partitioning approach to ensure the dissipativity of neural networks with or without time-varying parametric uncertainties. It is shown, by comparing with existing approaches, that the delay-partitioning projection approach can largely reduce the conservatism of the stability results. Numerical examples are constructed to show the effectiveness of the theoretical results

Reliable H∞ filtering for discrete time-delay systems with randomly occurred nonlinearities via delay-partitioning method

The official published version can be found at the link below.In this paper, the reliable H∞ filtering problem is investigated for a class of uncertain discrete time-delay systems with randomly occurred nonlinearities (RONs) and sensor failures. RONs are introduced to model a class of sector-like nonlinearities that occur in a probabilistic way according to a Bernoulli distributed white sequence with a known conditional probability. The failures of sensors are quantified by a variable varying in a given interval. The time-varying delay is unknown with given lower and upper bounds. The aim of the addressed reliable H∞ filtering problem is to design a filter such that, for all possible sensor failures, RONs, time-delays as well as admissible parameter uncertainties, the filtering error dynamics is asymptotically mean-square stable and also achieves a prescribed H∞ performance level. Sufficient conditions for the existence of such a filter are obtained by using a new Lyapunov–Krasovskii functional and delay-partitioning technique. The filter gains are characterized in terms of the solution to a set of linear matrix inequalities (LMIs). A numerical example is given to demonstrate the effectiveness of the proposed design approach

Further results on exponential estimates of markovian jump systems with mode-dependent time-varying delays

This technical note studies the problem of exponential estimates for Markovian jump systems with mode-dependent interval time-varying delays. A novel LyapunovKrasovskii functional (LKF) is constructed with the idea of delay partitioning, and a less conservative exponential estimate criterion is obtained based on the new LKF. Illustrative examples are provided to show the effectiveness of the proposed results. © 2010 IEEE.published_or_final_versio

Stability and dissipativity analysis of static neural networks with time delay

This paper is concerned with the problems of stability and dissipativity analysis for static neural networks (NNs) with time delay. Some improved delay-dependent stability criteria are established for static NNs with time-varying or time-invariant delay using the delay partitioning technique. Based on these criteria, several delay-dependent sufficient conditions are given to guarantee the dissipativity of static NNs with time delay. All the given results in this paper are not only dependent upon the time delay but also upon the number of delay partitions. Some examples are given to illustrate the effectiveness and reduced conservatism of the proposed results.published_or_final_versio

On design of quantized fault detection filters with randomly occurring nonlinearities and mixed time-delays

This paper is concerned with the fault detection problem for a class of discrete-time systems with randomly occurring nonlinearities, mixed stochastic time-delays as well as measurement quantizations. The nonlinearities are assumed to occur in a random way. The mixed time-delays comprise both the multiple discrete time-delays and the infinite distributed delays that occur in a random way as well. A sequence of stochastic variables is introduced to govern the random occurrences of the nonlinearities, discrete time-delays and distributed time-delays, where all the stochastic variables are mutually independent but obey the Bernoulli distribution. The main purpose of this paper is to design a fault detection filter such that, in the presence of measurement quantization, the overall fault detection dynamics is exponentially stable in the mean square and, at the same time, the error between the residual signal and the fault signal is made as small as possible. Sufficient conditions are first established via intensive stochastic analysis for the existence of the desired fault detection filters, and then the explicit expression of the desired filter gains is derived by means of the feasibility of certain matrix inequalities. Also, the optimal performance index for the addressed fault detection problem can be obtained by solving an auxiliary convex optimization problem. A practical example is provided to show the usefulness and effectiveness of the proposed design method

Piecewise Convex Technique for the Stability Analysis of Delayed Neural Network

On the basis of the fact that the neuron activation function is sector bounded, this paper transforms the researched original delayed neural network into a linear uncertain system. Combined with delay partitioning technique, by using the convex combination between decomposed time delay and positive matrix, this paper constructs a novel Lyapunov function to derive new less conservative stability criteria. The benefit of the method used in this paper is that it can utilize more information on slope of the activations and time delays. To illustrate the effectiveness of the new established stable criteria, one numerical example and an application example are proposed to compare with some recent results

On Computing the Worst-case H∞ Performance of Lur'e Systems with Uncertain Time-invariant Delays

This paper presents a worst-case H∞ performance analysis for Lur'e systems with time-invariant delays. The sucient condition to guarantee an upper bound of worst-case performance is developed based on the delay-partitioning Lyapunov-Krasovskii functional containing the integral of sector-bounded nonlinearities. Using Jensen inequality and S-procedure, the delay-dependent criterion is given in terms of linear matrix inequalities. In addition, we extend the criterion to compute the worst-case performance for Lur'e systems subject to norm-bounded uncertainties by using a matrix eliminating lemma. Numerical results show that our criterion provide the least upper bound on the worst-case H∞ performance comparing to the criteria derived based on existing techniques