Gain-constrained recursive filtering with stochastic nonlinearities and probabilistic sensor delays

This is the post-print of the Article. The official published version can be accessed from the link below - Copyright @ 2013 IEEE.This paper is concerned with the gain-constrained recursive filtering problem for a class of time-varying nonlinear stochastic systems with probabilistic sensor delays and correlated noises. The stochastic nonlinearities are described by statistical means that cover the multiplicative stochastic disturbances as a special case. The phenomenon of probabilistic sensor delays is modeled by introducing a diagonal matrix composed of Bernoulli distributed random variables taking values of 1 or 0, which means that the sensors may experience randomly occurring delays with individual delay characteristics. The process noise is finite-step autocorrelated. The purpose of the addressed gain-constrained filtering problem is to design a filter such that, for all probabilistic sensor delays, stochastic nonlinearities, gain constraint as well as correlated noises, the cost function concerning the filtering error is minimized at each sampling instant, where the filter gain satisfies a certain equality constraint. A new recursive filtering algorithm is developed that ensures both the local optimality and the unbiasedness of the designed filter at each sampling instant which achieving the pre-specified filter gain constraint. A simulation example is provided to illustrate the effectiveness of the proposed filter design approach.This work was supported in part by the National Natural Science Foundation of China by Grants 61273156, 61028008, 60825303, 61104125, and 11271103, National 973 Project by Grant 2009CB320600, the Fok Ying Tung Education Fund by Grant 111064, the Special Fund for the Author of National Excellent Doctoral Dissertation of China by Grant 2007B4, the State Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. by Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

A particle filtering approach for joint detection/estimation of multipath effects on GPS measurements

Multipath propagation causes major impairments to Global Positioning System (GPS) based navigation. Multipath results in biased GPS measurements, hence inaccurate position estimates. In this work, multipath effects are considered as abrupt changes affecting the navigation system. A multiple model formulation is proposed whereby the changes are represented by a discrete valued process. The detection of the errors induced by multipath is handled by a Rao-Blackwellized particle filter (RBPF). The RBPF estimates the indicator process jointly with the navigation states and multipath biases. The interest of this approach is its ability to integrate a priori constraints about the propagation environment. The detection is improved by using information from near future GPS measurements at the particle filter (PF) sampling step. A computationally modest delayed sampling is developed, which is based on a minimal duration assumption for multipath effects. Finally, the standard PF resampling stage is modified to include an hypothesis test based decision step

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

Probability-dependent gain-scheduled control for discrete stochastic delayed systems with randomly occurring nonlinearities

This is the post-print version of the Article. The official published version can be accessed from the links below - Copyright @ 2012 John Wiley & Sons, Ltd.In this paper, the gain-scheduled control problem is addressed by using probability-dependent Lyapunov functions for a class of discrete-time stochastic delayed systems with randomly occurring sector nonlinearities. The sector nonlinearities are assumed to occur according to a time-varying Bernoulli distribution with measurable probability in real time. The multiplicative noises are given by means of a scalar Gaussian white noise sequence with known variances. The aim of the addressed gain-scheduled control problem is to design a controller with scheduled gains such that, for the admissible randomly occurring nonlinearities, time delays and external noise disturbances, the closed-loop system is exponentially mean-square stable. Note that the designed gain-scheduled controller is based on the measured time-varying probability and is therefore less conservative than the conventional controller with constant gains. It is shown that the time-varying controller gains can be derived in terms of the measurable probability by solving a convex optimization problem via the semi-definite programme method. A simulation example is exploited to illustrate the effectiveness of the proposed design procedures.This work was supported in part by the Leverhulme Trust of the UK, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the National Natural Science Foundation of China under Grants 61028008, 61134009, 61074016, 61104125 and 60974030, the Shanghai Natural Science Foundation of China under Grant 10ZR1421200, and the Alexander von Humboldt Foundation of Germany

Quadrature filters for one-step randomly delayed measurements

In this paper, two existing quadrature filters, viz., the Gauss–Hermite filter (GHF) and the sparse-grid Gauss–Hermite filter (SGHF) are extended to solve nonlinear filtering problems with one step randomly delayed measurements. The developed filters are applied to solve a maneuvering target tracking problem with one step randomly delayed measurements. Simulation results demonstrate the enhanced accuracy of the proposed delayed filters compared to the delayed cubature Kalman filter and delayed unscented Kalman filter

A new algorithm for continuous-discrete filtering with randomly delayed measurements

This paper is a postprint of a paper submitted to and accepted for publication in IET Control Theory & Applications and is subject to Institution of Engineering and Technology Copyright. The copy of record is available at IET Digital Library.The filtering of nonlinear continuous-discrete systems is widely applicable in real-life and extensive literature is available to deal with such problems. However, all of these approaches are constrained with the assumption that the current measurement is available at every time step, although delay in measurement is natural in real-life applications. To deal with this problem, we re-derive the conventional Bayesian approximation framework for solving the continuous-discrete filtering problems. In practice, the delay is often smaller than one sampling time, which is the main case considered here. During the filtering of such systems, the actual time of correspondence should be known for a measurement received at the kth time instant. In this paper, a simple and intuitively justified cost function is used to decide the time to which the measurement at kth time instant actually corresponds. The performance of the proposed filter is compared with a conventional filter based on numerical integration which ignores random delays for a continuousdiscrete tracking problem. We show that the conventional filter fails to track the target while the modification proposed in this paper successfully deals with random delays. The proposed method may be seen as a valuable addition to the tools available for continuous-discrete filtering in nonlinear systems

Strong Tracking Filter for Nonlinear Systems with Randomly Delayed Measurements and Correlated Noises

This paper proposes a novel strong tracking filter (STF), which is suitable for dealing with the filtering problem of nonlinear systems when the following cases occur: that is, the constructed model does not match the actual system, the measurements have the one-step random delay, and the process and measurement noises are correlated at the same epoch. Firstly, a framework of decoupling filter (DF) based on equivalent model transformation is derived. Further, according to the framework of DF, a new extended Kalman filtering (EKF) algorithm via using first-order linearization approximation is developed. Secondly, the computational process of the suboptimal fading factor is derived on the basis of the extended orthogonality principle (EOP). Thirdly, the ultimate form of the proposed STF is obtained by introducing the suboptimal fading factor into the above EKF algorithm. The proposed STF can automatically tune the suboptimal fading factor on the basis of the residuals between available and predicted measurements and further the gain matrices of the proposed STF tune online to improve the filtering performance. Finally, the effectiveness of the proposed STF has been proved through numerical simulation experiments

Bibliographic Review on Distributed Kalman Filtering

In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area