Filtering for uncertain 2-D discrete systems with state delays

This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Elsevier Ltd.This paper is concerned with the problem of robust H∞ filtering for two-dimensional (2-D) discrete systems with time-delays in states. The 2-D systems under consideration are described in terms of the well-known Fornasini–Marchesini local state-space (FMLSS) models with time-delays. Our attention is focused on the design of a full-order filter such that the filtering error system is guaranteed to be asymptotically stable with a prescribed H∞ disturbance attenuation performance. Sufficient conditions for the existence of desired filters are established by using a linear matrix inequality (LMI) approach, and the corresponding filter design problem is then cast into a convex optimization problem that can be efficiently solved by resorting to some standard numerical software. Furthermore, the obtained results are extended to more general cases where the system matrices contain either polytopic or norm-bounded parameter uncertainties. A simulation example is provided to illustrate the effectiveness of the proposed design method.This work was partially supported by the National Natural Science Foundation of China (60504008), Program for New Century Excellent Talents in University of China and the Postdoctoral Science Foundation of China (20060390231)

Distributed H∞-consensus filtering in sensor networks with multiple missing measurements: The finite-horizon case

The official published version of the article can be found at the link below.This paper is concerned with a new distributed H∞-consensus filtering problem over a finite-horizon for sensor networks with multiple missing measurements. The so-called H∞-consensus performance requirement is defined to quantify bounded consensus regarding the filtering errors (agreements) over a finite-horizon. A set of random variables are utilized to model the probabilistic information missing phenomena occurring in the channels from the system to the sensors. A sufficient condition is first established in terms of a set of difference linear matrix inequalities (DLMIs) under which the expected H∞-consensus performance constraint is guaranteed. Given the measurements and estimates of the system state and its neighbors, the filter parameters are then explicitly parameterized by means of the solutions to a certain set of DLMIs that can be computed recursively. Subsequently, two kinds of robust distributed H∞-consensus filters are designed for the system with norm-bounded uncertainties and polytopic uncertainties. Finally, two numerical simulation examples are used to demonstrate the effectiveness of the proposed distributed filters design 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, and the Alexander von Humboldt Foundation of Germany

Robust H∞ finite-horizon filtering with randomly occurred nonlinearities and quantization effects

The official published version of this article can be found at the link below.In this paper, the robust H∞ finite-horizon filtering problem is investigated for discrete time-varying stochastic systems with polytopic uncertainties, randomly occurred nonlinearities as well as quantization effects. The randomly occurred nonlinearity, which describes the phenomena of a nonlinear disturbance appearing in a random way, is modeled by a Bernoulli distributed white sequence with a known conditional probability. A new robust H∞ filtering technique is developed for the addressed Itô-type discrete time-varying stochastic systems. Such a technique relies on the forward solution to a set of recursive linear matrix inequalities and is therefore suitable for on-line computation. It is worth mentioning that, in the filtering process, the information of both the current measurement and the previous state estimate is employed to estimate the current state. Finally, a simulation example is exploited to show the effectiveness of the method proposed in this paper.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 973 Program of China under Grant 2009CB320600, the National Natural Science Foundation of China under Grant 60974030, the Shanghai Natural Science Foundation of China under Grant 10ZR1421200, and the Alexander von Humboldt Foundation of Germany

Robust synchronization for 2-D discrete-time coupled dynamical networks

This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 IEEEIn this paper, a new synchronization problem is addressed for an array of 2-D coupled dynamical networks. The class of systems under investigation is described by the 2-D nonlinear state space model which is oriented from the well-known Fornasini–Marchesini second model. For such a new 2-D complex network model, both the network dynamics and the couplings evolve in two independent directions. A new synchronization concept is put forward to account for the phenomenon that the propagations of all 2-D dynamical networks are synchronized in two directions with influence from the coupling strength. The purpose of the problem addressed is to first derive sufficient conditions ensuring the global synchronization and then extend the obtained results to more general cases where the system matrices contain either the norm-bounded or the polytopic parameter uncertainties. An energy-like quadratic function is developed, together with the intensive use of the Kronecker product, to establish the easy-to-verify conditions under which the addressed 2-D complex network model achieves global synchronization. Finally, a numerical example is given to illustrate the theoretical results and the effectiveness of the proposed synchronization scheme.This work was supported in part by the National Natural Science Foundation of China under Grants 61028008 and 61174136, the International Science and Technology Cooperation Project of China under Grant No. 2009DFA32050, the Natural Science Foundation of Jiangsu Province of China under Grant BK2011598, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding

Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a special case of the truncated moment problem in which only the zero-th order moment is known (i.e., the support). By writing the dual of the above semi-infinite linear programming problem, it is shown that, if the nonlinearities in the measurement and process equations are polynomial and if the bounding sets for initial state, process and measurement noises are described by polynomial inequalities, then an approximation of this semi-infinite linear programming problem can efficiently be obtained by using the theory of sum-of-squares polynomial optimization. We then derive a smart greedy procedure to compute a polytopic outer-approximation of the true membership-set, by computing the minimum-volume polytope that outer-bounds the set that includes all the means computed with respect to P

Robust H∞ filtering for networked systems with multiple state delays

This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Taylor & Francis Ltd.In this paper, a new robust H∞ filter design problem is studied for a class of networked systems with multiple state-delays. Two kinds of incomplete measurements, namely, measurements with random delays and measurements with stochastic missing phenomenon, are simultaneously considered. Such incomplete measurements are induced by the limited bandwidth of communication networks, and are modelled as a linear function of a certain set of indicator functions that depend on the same stochastic variable. Attention is focused on the analysis and design problems of a full-order robust H∞ filter such that, for all admissible parameter uncertainties and all possible incomplete measurements, the filtering error dynamics is exponentially mean-square stable and a prescribed H∞ attenuation level is guaranteed. Some recently reported methodologies, such as delay-dependent and parameter-dependent stability analysis approaches, are employed to obtain less conservative results. Sufficient conditions, which are dependent on the occurrence probability of both the random sensor delay and missing measurement, are established for the existence of the desired filters in terms of certain linear matrix inequalities (LMIs). When these LMIs are feasible, the explicit expression of the desired filter can also be characterized. Finally, numerical examples are given to illustrate the effectiveness and applicability of the proposed design method.This work was supported by the National Natural Science Foundation of China under Grant 60574084, the National 863 Project of China under Grant 2006AA04Z428, and the National 973 Program of China under Grant 2002CB312200

Robust constrained model predictive control based on parameter-dependent Lyapunov functions

The problem of robust constrained model predictive control (MPC) of systems with polytopic uncertainties is considered in this paper. New sufficient conditions for the existence of parameter-dependent Lyapunov functions are proposed in terms of linear matrix inequalities (LMIs), which will reduce the conservativeness resulting from using a single Lyapunov function. At each sampling instant, the corresponding parameter-dependent Lyapunov function is an upper bound for a worst-case objective function, which can be minimized using the LMI convex optimization approach. Based on the solution of optimization at each sampling instant, the corresponding state feedback controller is designed, which can guarantee that the resulting closed-loop system is robustly asymptotically stable. In addition, the feedback controller will meet the specifications for systems with input or output constraints, for all admissible time-varying parameter uncertainties. Numerical examples are presented to demonstrate the effectiveness of the proposed techniques

Robust H∞ filtering for markovian jump systems with randomly occurring nonlinearities and sensor saturation: The finite-horizon case

This article is posted with the permission of IEEE - Copyright @ 2011 IEEEThis paper addresses the robust H∞ filtering problem for a class of discrete time-varying Markovian jump systems with randomly occurring nonlinearities and sensor saturation. Two kinds of transition probability matrices for the Markovian process are considered, namely, the one with polytopic uncertainties and the one with partially unknown entries. The nonlinear disturbances are assumed to occur randomly according to stochastic variables satisfying the Bernoulli distributions. The main purpose of this paper is to design a robust filter, over a given finite-horizon, such that the H∞ disturbance attenuation level is guaranteed for the time-varying Markovian jump systems in the presence of both the randomly occurring nonlinearities and the sensor saturation. Sufficient conditions are established for the existence of the desired filter satisfying the H∞ performance constraint in terms of a set of recursive linear matrix inequalities. Simulation results demonstrate the effectiveness of the developed filter design scheme.This work was supported in part by the National Natural Science Foundation of China under Grants 61028008, 60825303, and 61004067, National 973 Project under Grant 2009CB320600, the Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) from the Ministry of Education of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K., under Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

On delayed genetic regulatory networks with polytopic uncertainties: Robust stability analysis

Copyright [2008] 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.In this paper, we investigate the robust asymptotic stability problem of genetic regulatory networks with time-varying delays and polytopic parameter uncertainties. Both cases of differentiable and nondifferentiable time-delays are considered, and the convex polytopic description is utilized to characterize the genetic network model uncertainties. By using a Lyapunov functional approach and linear matrix inequality (LMI) techniques, the stability criteria for the uncertain delayed genetic networks are established in the form of LMIs, which can be readily verified by using standard numerical software. An important feature of the results reported here is that all the stability conditions are dependent on the upper and lower bounds of the delays, which is made possible by using up-to-date techniques for achieving delay dependence. Another feature of the results lies in that a novel Lyapunov functional dependent on the uncertain parameters is utilized, which renders the results to be potentially less conservative than those obtained via a fixed Lyapunov functional for the entire uncertainty domain. A genetic network example is employed to illustrate the applicability and usefulness of the developed theoretical results