1,365 research outputs found

    Robust Filtering and Smoothing with Gaussian Processes

    Full text link
    We propose a principled algorithm for robust Bayesian filtering and smoothing in nonlinear stochastic dynamic systems when both the transition function and the measurement function are described by non-parametric Gaussian process (GP) models. GPs are gaining increasing importance in signal processing, machine learning, robotics, and control for representing unknown system functions by posterior probability distributions. This modern way of "system identification" is more robust than finding point estimates of a parametric function representation. In this article, we present a principled algorithm for robust analytic smoothing in GP dynamic systems, which are increasingly used in robotics and control. Our numerical evaluations demonstrate the robustness of the proposed approach in situations where other state-of-the-art Gaussian filters and smoothers can fail.Comment: 7 pages, 1 figure, draft version of paper accepted at IEEE Transactions on Automatic Contro

    Robust filtering for bilinear uncertain stochastic discrete-time systems

    Get PDF
    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 with stochastic nonlinearities and multiple missing measurements

    Get PDF
    This is the post print version of the article. The official published version can be obtained from the link - Copyright 2009 Elsevier LtdThis paper is concerned with the filtering problem for a class of discrete-time uncertain stochastic nonlinear time-delay systems with both the probabilistic missing measurements and external stochastic disturbances. The measurement missing phenomenon is assumed to occur in a random way, and the missing probability for each sensor is governed by an individual random variable satisfying a certain probabilistic distribution over the interval . Such a probabilistic distribution could be any commonly used discrete distribution over the interval . The multiplicative stochastic disturbances are in the form of a scalar Gaussian white noise with unit variance. The purpose of the addressed filtering problem is to design a filter such that, for the admissible random measurement missing, stochastic disturbances, norm-bounded uncertainties as well as stochastic nonlinearities, the error dynamics of the filtering process is exponentially mean-square stable. By using the linear matrix inequality (LMI) method, sufficient conditions are established that ensure the exponential mean-square stability of the filtering error, and then the filter parameters are characterized by the solution to a set of LMIs. Illustrative examples are exploited to show the effectiveness of the proposed design procedures.This work was supported in part by the Shanghai Natural Science Foundation under Grant 07ZR14002, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, an International Joint Project sponsored by the Royal Society of the UK, the Nuffield Foundation of the UK under Grant NAL/00630/G and the Alexander von Humboldt Foundation of Germany

    Robust filtering by fictitious noises

    Get PDF
    Author name used in this publication: David ZhangVersion of RecordPublishe

    Robust filtering with randomly varying sensor delay: The finite-horizon case

    Get PDF
    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
    corecore