H-infinity state estimation for discrete-time complex networks with randomly occurring sensor saturations and randomly varying sensor delays

This is the post-print of the Article. The official published version can be accessed from the link below - Copyright @ 2012 IEEEIn this paper, the state estimation problem is investigated for a class of discrete time-delay nonlinear complex networks with randomly occurring phenomena from sensor measurements. The randomly occurring phenomena include randomly occurring sensor saturations (ROSSs) and randomly varying sensor delays (RVSDs) that result typically from networked environments. A novel sensor model is proposed to describe the ROSSs and the RVSDs within a unified framework via two sets of Bernoulli-distributed white sequences with known conditional probabilities. Rather than employing the commonly used Lipschitz-type function, a more general sector-like nonlinear function is used to describe the nonlinearities existing in the network. The purpose of the addressed problem is to design a state estimator to estimate the network states through available output measurements such that, for all probabilistic sensor saturations and sensor delays, the dynamics of the estimation error is guaranteed to be exponentially mean-square stable and the effect from the exogenous disturbances to the estimation accuracy is attenuated at a given level by means of an $H_{infty}$-norm. In terms of a novel Lyapunov–Krasovskii functional and the Kronecker product, sufficient conditions are established under which the addressed state estimation problem is recast as solving a convex optimization problem via the semidefinite programming method. A simulation example is provided to show the usefulness of the proposed state estimation conditions.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., the National Natural Science Foundation of China under Grants 61028008, 61134009, 61104125 and 60974030, the Natural Science Foundation of Universities in Anhui Province of China under Grant KJ2011B030, and the Alexander von Humboldt Foundation of Germany

Robust filtering for a class of stochastic uncertain nonlinear time-delay systems via exponential state estimation

Copyright [2001] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.We investigate the robust filter design problem for a class of nonlinear time-delay stochastic systems. The system under study involves stochastics, unknown state time-delay, parameter uncertainties, and unknown nonlinear disturbances, which are all often encountered in practice and the sources of instability. The aim of this problem is to design a linear, delayless, uncertainty-independent state estimator such that for all admissible uncertainties as well as nonlinear disturbances, the dynamics of the estimation error is stochastically exponentially stable in the mean square, independent of the time delay. Sufficient conditions are proposed to guarantee the existence of desired robust exponential filters, which are derived in terms of the solutions to algebraic Riccati inequalities. The developed theory is illustrated by numerical simulatio

Sampled-data synchronization control of dynamical networks with stochastic sampling

Copyright @ 2012 IEEEThis technical note is concerned with the sampled-data synchronization control problem for a class of dynamical networks. The sampling period considered here is assumed to be time-varying that switches between two different values in a random way with given probability. The addressed synchronization control problem is first formulated as an exponentially mean-square stabilization problem for a new class of dynamical networks that involve both the multiple probabilistic interval delays (MPIDs) and the sector-bounded nonlinearities (SBNs). Then, a novel Lyapunov functional is constructed to obtain sufficient conditions under which the dynamical network is exponentially mean-square stable. Both Gronwall's inequality and Jenson integral inequality are utilized to substantially simplify the derivation of the main results. Subsequently, a set of sampled-data synchronization controllers is designed in terms of the solution to certain matrix inequalities that can be solved effectively by using available software. Finally, a numerical simulation example is employed to show the effectiveness of the proposed sampled-data synchronization control scheme.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, the National Natural Science Foundation of China under Grants 61028008, 60974030, 61134009 and 61104125, the National 973 Program of China under Grant 2009CB320600, and the Alexander von Humboldt Foundation of Germany

Model predictive control based on LPV models with parameter-varying delays

© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This paper presents a Model Predictive Control (MPC) strategy based on Linear Parameter Varying (LPV) models with varying delays affecting states and inputs. The proposed control approach allows the controller to accommodate the scheduling parameters and delay change. By computing the prediction of the state variables and delay along a prediction time horizon, the system model can be modified according to the evaluation of the estimated state and delay at each time instant. Moreover, the solution of the optimization problem associated with the MPC design is achieved by solving a series of Quadratic Programming (QP) problem at each time instant. This iterative approach reduces the computational burden compared to the solution of a non-linear optimization problem. A pasteurization plant system is used as a case study to demonstrate the effectiveness of the proposed approach.Peer ReviewedPostprint (author's final draft

Robust filtering under randomly varying sensor delay with variance constraints

Copyright [2004] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper deals with a new filtering problem for linear uncertain discrete-time stochastic systems with randomly varying sensor delay. The norm-bounded parameter uncertainties enter into the system matrix of the state space model. The system measurements are subject to randomly varying sensor delays, which often occur in information transmissions through networks. The problem addressed is the design of a linear filter such that, for all admissible parameter uncertainties and all probabilistic sensor delays, the error state of the filtering process is mean square bounded, and the steady-state variance of the estimation error for each state is not more than the individual prescribed upper bound. We show that the filtering problem under consideration can effectively be solved if there are positive definite solutions to a couple of algebraic Riccati-like inequalities or linear matrix inequalities. We also characterize the set of desired robust filters in terms of some free parameters. An illustrative numerical example is used to demonstrate the usefulness and flexibility of the proposed design approach