Non-fragile state estimation for discrete Markovian jumping neural networks

In this paper, the non-fragile state estimation problem is investigated for a class of discrete-time neural networks subject to Markovian jumping parameters and time delays. In terms of a Markov chain, the mode switching phenomenon at different times is considered in both the parameters and the discrete delays of the neural networks. To account for the possible gain variations occurring in the implementation, the gain of the estimator is assumed to be perturbed by multiplicative norm-bounded uncertainties. We aim to design a non-fragile state estimator such that, in the presence of all admissible gain variations, the estimation error converges to zero exponentially. By adopting the Lyapunov–Krasovskii functional and the stochastic analysis theory, sufficient conditions are established to ensure the existence of the desired state estimator that guarantees the stability of the overall estimation error dynamics. The explicit expression of such estimators is parameterized by solving a convex optimization problem via the semi-definite programming method. A numerical simulation example is provided to verify the usefulness of the proposed methods

A review on analysis and synthesis of nonlinear stochastic systems with randomly occurring incomplete information

Copyright q 2012 Hongli Dong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In the context of systems and control, incomplete information refers to a dynamical system in which knowledge about the system states is limited due to the difficulties in modeling complexity in a quantitative way. The well-known types of incomplete information include parameter uncertainties and norm-bounded nonlinearities. Recently, in response to the development of network technologies, the phenomenon of randomly occurring incomplete information has become more and more prevalent. Such a phenomenon typically appears in a networked environment. Examples include, but are not limited to, randomly occurring uncertainties, randomly occurring nonlinearities, randomly occurring saturation, randomly missing measurements and randomly occurring quantization. Randomly occurring incomplete information, if not properly handled, would seriously deteriorate the performance of a control system. In this paper, we aim to survey some recent advances on the analysis and synthesis problems for nonlinear stochastic systems with randomly occurring incomplete information. The developments of the filtering, control and fault detection problems are systematically reviewed. Latest results on analysis and synthesis of nonlinear stochastic systems are discussed in great detail. In addition, various distributed filtering technologies over sensor networks are highlighted. Finally, some concluding remarks are given and some possible future research directions are pointed out. © 2012 Hongli Dong et al.This work was supported in part by the National Natural Science Foundation of China under Grants 61273156, 61134009, 61273201, 61021002, and 61004067, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, the National Science Foundation of the USA under Grant No. HRD-1137732, and the Alexander von Humboldt Foundation of German

A survey on gain-scheduled control and filtering for parameter-varying systems

Copyright © 2014 Guoliang Wei et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.This paper presents an overview of the recent developments in the gain-scheduled control and filtering problems for the parameter-varying systems. First of all, we recall several important algorithms suitable for gain-scheduling method including gain-scheduled proportional-integral derivative (PID) control, H 2, H ∞ and mixed H 2 / H ∞ gain-scheduling methods as well as fuzzy gain-scheduling techniques. Secondly, various important parameter-varying system models are reviewed, for which gain-scheduled control and filtering issues are usually dealt with. In particular, in view of the randomly occurring phenomena with time-varying probability distributions, some results of our recent work based on the probability-dependent gain-scheduling methods are reviewed. Furthermore, some latest progress in this area is discussed. Finally, conclusions are drawn and several potential future research directions are outlined.The National Natural Science Foundation of China under Grants 61074016, 61374039, 61304010, and 61329301; the Natural Science Foundation of Jiangsu Province of China under Grant BK20130766; the Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; the Program for New Century Excellent Talents in University under Grant NCET-11-1051, the Leverhulme Trust of the U.K., the Alexander von Humboldt Foundation of Germany

Protocol-based state estimation for delayed Markovian jumping neural networks

National Natural Science Foundation of China; the PetroChina Innovation Foundation; the China Postdoctoral Science Foundation; the Natural Science Foundation of Heilongjiang Province of China; the Northeast Petroleum University Innovation Foundation For Postgraduate; the Alexander von Humboldt Foundation of German

Exponential synchronization of a complex dynamical network with piecewise-homogeneous Markovian jump structure and coupling delay

In this paper, exponential synchronization problem is studied for a complex dynamical network (CDN) with a class of Markovian jump structure with coupling-time delay. The CDN under consideration has a piecewise-Markovian jump structure with piecewise-constant transition rates (TRs). First piecewise-homogeneous Markovian process is modeled by two Markov chains then, the synchronization problem of the CDN is inspected by constructing Lyapunov-Krasovskii function with Markov dependent matrices. Ultimately, the controller gain matrices for guaranteeing the synchronization problem in terms of linear matrix inequalities (LMIs) are derived. A CDN with a Chua circuit dynamic for each node is given as a numerical example to show the effectiveness of the theoretical results

Finite time Synchronization of Inertial Memristive Neural Networks with Time Varying Delay

Finite time synchronization control of inertial memristor-based neural networks with varying delay is considered. In view of drive and response concept, the sufficient conditions to ensure finite time synchronization issue of inertial memristive neural networks is given. Based on Lyapunov finite time asymptotic theory, a kind of feedback controllers is designed for inertial memristorbased neural networks to realize the finite time synchronization. Based on Lyapunov stability theory, close loop error system can be proved finite time and fixed time stable. Finally, illustrative example is given to illustrate the effectiveness of theoretical results

Synchronization of a class of fractional-order neural networks with multiple time delays by comparison principles

This paper studies the synchronization of fractional-order neural networks with multiple time delays. Based on an inequality of fractional-order and comparison principles of linear fractional equation with multiple time delays, some sufficient conditions for synchronization of master-slave systems are obtained. Example and related simulations are given to demonstrate the feasibility of the theoretical results

Event-based state estimation for a class of complex networks with time-varying delays: A comparison principle approach

The paper is concerned with the state estimation problem for a class of time-delayed complex networks with event-triggering communication protocol. A novel event generator function, which is dependent not only on the measurement output but also on a predefined positive constant, is proposed with hope to reduce the communication burden. A new concept of exponentially ultimate boundedness is provided to quantify the estimation performance. By means of the comparison principle, some sufficient conditions are obtained to guarantee that the estimation error is exponentially ultimately bounded, and then the estimator gains are obtained in terms of the solution of certain matrix inequalities. Furthermore, a rigorous proof is proposed to show that the designed triggering condition is free of the Zeno behavior. Finally, a numerical example is given to illustrate the effectiveness of the proposed event-based estimator