H ∞ sliding mode observer design for a class of nonlinear discrete time-delay systems: A delay-fractioning approach

Copyright @ 2012 John Wiley & SonsIn this paper, the H ∞  sliding mode observer (SMO) design problem is investigated for a class of nonlinear discrete time-delay systems. The nonlinear descriptions quantify the maximum possible derivations from a linear model, and the system states are allowed to be immeasurable. Attention is focused on the design of a discrete-time SMO such that the asymptotic stability as well as the H ∞  performance requirement of the error dynamics can be guaranteed in the presence of nonlinearities, time delay and external disturbances. Firstly, a discrete-time discontinuous switched term is proposed to make sure that the reaching condition holds. Then, by constructing a new Lyapunov–Krasovskii functional based on the idea of ‘delay fractioning’ and by introducing some appropriate free-weighting matrices, a sufficient condition is established to guarantee the desired performance of the error dynamics in the specified sliding mode surface by solving a minimization problem. Finally, an illustrative example is given to show the effectiveness of the designed SMO design scheme

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

Filtering for nonlinear genetic regulatory networks with stochastic disturbances

In this paper, the filtering problem is investigated for nonlinear genetic regulatory networks with stochastic disturbances and time delays, where the nonlinear function describing the feedback regulation is assumed to satisfy the sector condition, the stochastic perturbation is in the form of a scalar Brownian motion, and the time delays exist in both the translation process and the feedback regulation process. The purpose of the addressed filtering problem is to estimate the true concentrations of the mRNA and protein. Specifically, we are interested in designing a linear filter such that, in the presence of time delays, stochastic disturbances as well as sector nonlinearities, the filtering dynamics of state estimation for the stochastic genetic regulatory network is exponentially mean square stable with a prescribed decay rate lower bound beta. By using the linear matrix inequality (LMI) technique, sufficient conditions are first derived for ensuring the desired filtering performance for the gene regulatory model, and the filter gain is then characterized in terms of the solution to an LMI, which can be easily solved by using standard software packages. A simulation example is exploited in order to illustrate the effectiveness of the proposed design procedures

Output Reachable Set Estimation and Verification for Multi-Layer Neural Networks

In this paper, the output reachable estimation and safety verification problems for multi-layer perceptron neural networks are addressed. First, a conception called maximum sensitivity in introduced and, for a class of multi-layer perceptrons whose activation functions are monotonic functions, the maximum sensitivity can be computed via solving convex optimization problems. Then, using a simulation-based method, the output reachable set estimation problem for neural networks is formulated into a chain of optimization problems. Finally, an automated safety verification is developed based on the output reachable set estimation result. An application to the safety verification for a robotic arm model with two joints is presented to show the effectiveness of proposed approaches.Comment: 8 pages, 9 figures, to appear in TNNL