Necessary and sufficient conditions for analysis and synthesis of markov jump linear systems with incomplete transition descriptions

This technical note is concerned with exploring a new approach for the analysis and synthesis for Markov jump linear systems with incomplete transition descriptions. In the study, not all the elements of the transition rate matrices (TRMs) in continuous-time domain, or transition probability matrices (TPMs) in discrete-time domain are assumed to be known. By fully considering the properties of the TRMs and TPMs, and the convexity of the uncertain domains, necessary and sufficient criteria of stability and stabilization are obtained in both continuous and discrete time. Numerical examples are used to illustrate the results. © 2006 IEEE.published_or_final_versio

Stability Analysis for Markovian Jump Neutral Systems with Mixed Delays and Partially Known Transition Rates

The delay-dependent stability problem is studied for Markovian jump neutral systems with partial information on transition probabilities, and the considered delays are mixed and model dependent. By constructing the new stochastic Lyapunov-Krasovskii functional, which combined the introduced free matrices with the analysis technique of matrix inequalities, a sufficient condition for the systems with fully known transition rates is firstly established. Then, making full use of the transition rate matrix, the results are obtained for the other case, and the uncertain neutral Markovian jump system with incomplete transition rates is also considered. Finally, to show the validity of the obtained results, three numerical examples are provided

Finite-Time Boundedness for a Class of Delayed Markovian Jumping Neural Networks with Partly Unknown Transition Probabilities

This paper is concerned with the problem of finite-time boundedness for a class of delayed Markovian jumping neural networks with partly unknown transition probabilities. By introducing the appropriate stochastic Lyapunov-Krasovskii functional and the concept of stochastically finite-time stochastic boundedness for Markovian jumping neural networks, a new method is proposed to guarantee that the state trajectory remains in a bounded region of the state space over a prespecified finite-time interval. Finally, numerical examples are given to illustrate the effectiveness and reduced conservativeness of the proposed results

Weight Try-Once-Discard Protocol-Based L_2 L_infinity State Estimation for Markovian Jumping Neural Networks with Partially Known Transition Probabilities

It was the L_2 L_infinity performance index that for the first time is initiated into the discussion on state estimation of delayed MJNNs with with partially known transition probabilities, which provides a more general promotion for the estimation error.The WTOD protocol is adopted to dispatch the sensor nodes so as to effectively alleviate the updating frequency of output signals. The hybrid effects of the time delays, Markov chain, and protocol parameters are apparently reflected in the co-designed estimator which can be solved by a combination of comprehensive matrix inequalities

Stability Analysis for Stochastic Markovian Jump Reaction-Diffusion Neural Networks with Partially Known Transition Probabilities and Mixed Time Delays

The stability problem is proposed for a new class of stochastic Markovian jump reaction-diffusion neural networks with partial information on transition probability and mixed time delays. The new stability conditions are established in terms of linear matrix inequalities (LMIs). To reduce the conservatism of the stability conditions, an improved Lyapunov-Krasovskii functional and free-connection weighting matrices are introduced. The obtained results are dependent on delays and the measure of the space AND, therefore, have less conservativeness than delay-independent and space-independent ones. An example is given to show the effectiveness of the obtained results

Parameters identification of unknown delayed genetic regulatory networks by a switching particle swarm optimization algorithm

The official published version can be found at the link below.This paper presents a novel particle swarm optimization (PSO) algorithm based on Markov chains and competitive penalized method. Such an algorithm is developed to solve global optimization problems with applications in identifying unknown parameters of a class of genetic regulatory networks (GRNs). By using an evolutionary factor, a new switching PSO (SPSO) algorithm is first proposed and analyzed, where the velocity updating equation jumps from one mode to another according to a Markov chain, and acceleration coefficients are dependent on mode switching. Furthermore, a leader competitive penalized multi-learning approach (LCPMLA) is introduced to improve the global search ability and refine the convergent solutions. The LCPMLA can automatically choose search strategy using a learning and penalizing mechanism. The presented SPSO algorithm is compared with some well-known PSO algorithms in the experiments. It is shown that the SPSO algorithm has faster local convergence speed, higher accuracy and algorithm reliability, resulting in better balance between the global and local searching of the algorithm, and thus generating good performance. Finally, we utilize the presented SPSO algorithm to identify not only the unknown parameters but also the coupling topology and time-delay of a class of GRNs.This research was partially supported by the National Natural Science Foundation of PR China (Grant No. 60874113), the Research Fund for the Doctoral Program of Higher Education (Grant No. 200802550007), the Key Creative Project of Shanghai Education Community (Grant No. 09ZZ66), the Key Foundation Project of Shanghai (Grant No. 09JC1400700), the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant No. GR/S27658/01, the International Science and Technology Cooperation Project of China under Grant No. 2009DFA32050, an International Joint Project sponsored by the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Filtering for discrete-time nonhomogeneous Markov jump systems with uncertainties

This paper studies the problem of robust H1 filtering for a class of uncertain discrete-time nonhomogeneous Markov jump systems. The time-varying jump transition probability matrix is described by a polytope. By Lyapunov function approach, mode-dependent and variation-dependent H1 filter is designed such that the resulting error dynamic system is stochastically stable and has a prescribed H1 performance index. A numerical example is given to illustrate the effectiveness of the developed techniques

Stability Analysis of Stochastic Markovian Jump Neural Networks with Different Time Scales and Randomly Occurred Nonlinearities Based on Delay-Partitioning Projection Approach

In this paper, the mean square asymptotic stability of stochastic Markovian jump neural networks with different time scales and randomly occurred nonlinearities is investigated. In terms of linear matrix inequality (LMI) approach and delay-partitioning projection technique, delay-dependent stability criteria are derived for the considered neural networks for cases with or without the information of the delay rates via new Lyapunov-Krasovskii functionals. We also obtain that the thinner the delay is partitioned, the more obviously the conservatism can be reduced. An example with simulation results is given to show the effectiveness of the proposed approach