3,673 research outputs found
Robust filtering for bilinear uncertain stochastic discrete-time systems
Copyright [2002] 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 the robust filtering problem for uncertain bilinear stochastic discrete-time systems with estimation error variance constraints. The uncertainties are allowed to be norm-bounded and enter into both the state and measurement matrices. We focus on the design of linear filters, such that for all admissible parameter uncertainties, the error state of the bilinear stochastic system is mean square bounded, and the steady-state variance of the estimation error of each state is not more than the individual prespecified value. It is shown that the design of the robust filters can be carried out by solving some algebraic quadratic matrix inequalities. In particular, we establish both the existence conditions and the explicit expression of desired robust filters. A numerical example is included to show the applicability of the present method
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
Robust filtering with randomly varying sensor delay: The finite-horizon case
Copyright [2009] 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 consider the robust filtering problem for discrete time-varying systems with delayed sensor measurement subject to norm-bounded parameter uncertainties. The delayed sensor measurement is assumed to be a linear function of a stochastic variable that satisfies the Bernoulli random binary distribution law. An upper bound for the actual covariance of the uncertain stochastic parameter system is derived and used for estimation variance constraints. Such an upper bound is then minimized over the filter parameters for all stochastic sensor delays and admissible deterministic uncertainties. It is shown that the desired filter can be obtained in terms of solutions to two discrete Riccati difference equations of a form suitable for recursive computation in online applications. An illustrative example is presented to show the applicability of the proposed method
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
Probability-guaranteed H∞ finite-horizon filtering for a class of nonlinear time-varying systems with sensor saturations
This is the Post-Print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierIn this paper, the probability-guaranteed H∞ finite-horizon filtering problem is investigated for a class of nonlinear time-varying systems with uncertain parameters and sensor saturations. The system matrices are functions of mutually independent stochastic variables that obey uniform distributions over known finite ranges. Attention is focused on the construction of a time-varying filter such that the prescribed H∞ performance requirement can be guaranteed with probability constraint. By using the difference linear matrix inequalities (DLMIs) approach, sufficient conditions are established to guarantee the desired performance of the designed finite-horizon filter. The time-varying filter gains can be obtained in terms of the feasible solutions of a set of DLMIs that can be recursively solved by using the semi-definite programming method. A computational algorithm is specifically developed for the addressed probability-guaranteed H∞ finite-horizon filtering problem. Finally, a simulation example is given to illustrate the effectiveness of the proposed filtering scheme.This work was supported in part by the National Natural Science Foundation of China under Grants 61028008, 60825303 and
60834003, National 973 Project under Grant 2009CB320600, the Fok Ying Tung Education Fund under Grant 111064, the Special Fund for the Author of National Excellent Doctoral Dissertation of China under Grant 2007B4, 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
Simple Approximations of Semialgebraic Sets and their Applications to Control
Many uncertainty sets encountered in control systems analysis and design can
be expressed in terms of semialgebraic sets, that is as the intersection of
sets described by means of polynomial inequalities. Important examples are for
instance the solution set of linear matrix inequalities or the Schur/Hurwitz
stability domains. These sets often have very complicated shapes (non-convex,
and even non-connected), which renders very difficult their manipulation. It is
therefore of considerable importance to find simple-enough approximations of
these sets, able to capture their main characteristics while maintaining a low
level of complexity. For these reasons, in the past years several convex
approximations, based for instance on hyperrect-angles, polytopes, or
ellipsoids have been proposed. In this work, we move a step further, and
propose possibly non-convex approximations , based on a small volume polynomial
superlevel set of a single positive polynomial of given degree. We show how
these sets can be easily approximated by minimizing the L1 norm of the
polynomial over the semialgebraic set, subject to positivity constraints.
Intuitively, this corresponds to the trace minimization heuristic commonly
encounter in minimum volume ellipsoid problems. From a computational viewpoint,
we design a hierarchy of linear matrix inequality problems to generate these
approximations, and we provide theoretically rigorous convergence results, in
the sense that the hierarchy of outer approximations converges in volume (or,
equivalently, almost everywhere and almost uniformly) to the original set. Two
main applications of the proposed approach are considered. The first one aims
at reconstruction/approximation of sets from a finite number of samples. In the
second one, we show how the concept of polynomial superlevel set can be used to
generate samples uniformly distributed on a given semialgebraic set. The
efficiency of the proposed approach is demonstrated by different numerical
examples
Recommended from our members
Mixed H2/H∞ filtering for uncertain systems with regional pole assignment
Copyright [2005] 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.The mixed H2/H∞ filtering problem for uncertain linear continuous-time systems with regional pole assignment is considered. The purpose of the problem is to design an uncertainty-independent filter such that, for all admissible parameter uncertainties, the following filtering requirements are simultaneously satisfied: 1) the filtering process is asymptotically stable; 2) the poles of the filtering matrix are located inside a prescribed region that compasses the vertical strips, horizontal strips, disks, or conic sectors; 3) both the H2 norm and the H∞ norm on the respective transfer functions are not more than the specified upper bound constraints. We establish a general framework to solve the addressed multiobjective filtering problem completely. In particular, we derive necessary and sufficient conditions for the solvability of the problem in terms of a set of feasible linear matrix inequalities (LMIs). An illustrative example is given to illustrate the design procedures and performances of the proposed method
Robust H-infinity finite-horizon control for a class of stochastic nonlinear time-varying systems subject to sensor and actuator saturations
Copyright [2010] 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 technical note addresses the robust H∞ finite-horizon output feedback control problem for a class of uncertain discrete stochastic nonlinear time-varying systems with both sensor and actuator saturations. In the system under investigation, all the system parameters are allowed to be time-varying, the parameter uncertainties are assumed to be of the polytopic type, and the stochastic nonlinearities are described by statistical means which can cover several classes of well-studied nonlinearities. The purpose of the problem addressed is to design an output feedback controller, over a given finite-horizon, such that the H∞ disturbance attenuation level is guaranteed for the nonlinear stochastic polytopic system in the presence of saturated sensor and actuator outputs. Sufficient conditions are first established for the robust H∞ performance through intensive stochastic analysis, and then a recursive linear matrix inequality (RLMI) approach is employed to design the desired output feedback controller achieving the prescribed H∞ disturbance rejection level. Simulation results demonstrate the effectiveness of the developed controller design scheme.This work was supported under Australian Research Council’s Discovery Projects funding
scheme (project DP0880494) and by the German Science Foundation (DFG) within the priority programme 1305: Control Theory of Digitally Networked Dynamical Systems. Recommended by Associate Editor H. Ito
Recommended from our members
Nonlinear filtering for state delayed systems with Markovian switching
Copyright [2003] 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 the filtering problem for a general class of nonlinear time-delay systems with Markovian jumping parameters. The nonlinear time-delay stochastic systems may switch from one to the others according to the behavior of a Markov chain. The purpose of the problem addressed is to design a nonlinear full-order filter such that the dynamics of the estimation error is guaranteed to be stochastically exponentially stable in the mean square. Both filter analysis and synthesis problems are investigated. Sufficient conditions are established for the existence of the desired exponential filters, which are expressed in terms of the solutions to a set of linear matrix inequalities (LMIs). The explicit expression of the desired filters is also provided. A simulation example is given to illustrate the design procedures and performances of the proposed method
- …