Probability-dependent gain-scheduled filtering for stochastic systems with missing measurements

Copyright @ 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, 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 components of this work in other works.This brief addresses the gain-scheduled filtering problem for a class of discrete-time systems with missing measurements, nonlinear disturbances, and external stochastic noise. The missing-measurement phenomenon is assumed to occur in a random way, and the missing probability is time-varying with securable upper and lower bounds that can be measured in real time. The multiplicative noise is a state-dependent scalar Gaussian white-noise sequence with known variance. The addressed gain-scheduled filtering problem is concerned with the design of a filter such that, for the admissible random missing measurements, nonlinear parameters, and external noise disturbances, the error dynamics is exponentially mean-square stable. The desired filter is equipped with time-varying gains based primarily on the time-varying missing probability and is therefore less conservative than the traditional filter with fixed gains. It is shown that the filter parameters can be derived in terms of the measurable probability via the semidefinite program method.This work was supported in part by the Leverhulme Trust of the U.K., the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the National Natural Science Foundation of China under Grants 61028008, 61074016 and 60974030, the Shanghai Natural Science Foundation of China under Grant 10ZR1421200, and the Alexander von Humboldt Foundation of Germany

Rao-Blackwellized Particle Filters with Out-of-Sequence Measurement Processing

This paper addresses the out-of-sequence measurement (OOSM) problem for mixed linear/nonlinear state-space models, which is a class of nonlinear models with a tractable, conditionally linear substructure. We develop two novel algorithms that utilize the linear substructure. The first algorithm effectively employs the Rao-Blackwellized particle filtering framework for updating with the OOSMs, and is based on storing only a subset of the particles and their weights over an arbitrary, predefined interval. The second algorithm adapts a backward simulation approach to update with the delayed (out-of-sequence) measurements, resulting in superior tracking performance. Extensive simulation studies show the efficacy of our approaches in terms of computation time and tracking performance. Both algorithms yield estimation improvements when compared with recent particle filter algorithms for OOSM processing; in the considered examples they achieve up to 10% enhancements in estimation accuracy. In some cases the proposed algorithms even deliver accuracy that is similar to the lower performance bounds. Because the considered setup is common in various estimation scenarios, the developed algorithms enable improvements in different types of filtering applications

Robust H∞ filtering for discrete nonlinear stochastic systems with time-varying delay

This is the postprint version of the article. The official published version can be accessed from the link below - © 2007 Elsevier IncIn this paper, we are concerned with the robust H∞ filtering problem for a class of nonlinear discrete time-delay stochastic systems. The system under study involves parameter uncertainties, stochastic disturbances, time-varying delays and sector-like nonlinearities. The problem addressed is the design of a full-order filter such that, for all admissible uncertainties, nonlinearities and time delays, the dynamics of the filtering error is constrained to be robustly asymptotically stable in the mean square, and a prescribed H∞ disturbance rejection attenuation level is also guaranteed. By using the Lyapunov stability theory and some new techniques, sufficient conditions are first established to ensure the existence of the desired filtering parameters. These conditions are dependent on the lower and upper bounds of the time-varying delays. Then, the explicit expression of the desired filter gains is described in terms of the solution to a linear matrix inequality (LMI). Finally, a numerical example is exploited to show the usefulness of the results derived.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Nuffield Foundation of the UK under Grant NAL/00630/G, the Alexander von Humboldt Foundation of Germany, the National Natural Science Foundation of China (60774073 and 10471119), the NSF of Jiangsu Province of China (BK2007075 and BK2006064), the Natural Science Foundation of Jiangsu Education Committee of China under Grant 06KJD110206, and the Scientific Innovation Fund of Yangzhou University of China under Grant 2006CXJ002

ILAPF: Incremental Learning Assisted Particle Filtering

This paper is concerned with dynamic system state estimation based on a series of noisy measurement with the presence of outliers. An incremental learning assisted particle filtering (ILAPF) method is presented, which can learn the value range of outliers incrementally during the process of particle filtering. The learned range of outliers is then used to improve subsequent filtering of the future state. Convergence of the outlier range estimation procedure is indicated by extensive empirical simulations using a set of differing outlier distribution models. The validity of the ILAPF algorithm is evaluated by illustrative simulations, and the result shows that ILAPF is more accurate and faster than a recently published state-ofthe-art robust particle filter. It also shows that the incremental learning property of the ILAPF algorithm provides an efficient way to implement transfer learning among related state filtering tasks.Comment: 5 pages, 4 figures, conferenc

Posterior Cramér-Rao bounds for discrete-time nonlinear filtering

A mean-square error lower bound for the discrete-time nonlinear filtering problem is derived based on the van Trees (1968) (posterior) version of the Cramer-Rao inequality. This lower bound is applicable to multidimensional nonlinear, possibly non-Gaussian, dynamical systems and is more general than the previous bounds in the literature. The case of singular conditional distribution of the one-step-ahead state vector given the present state is considered. The bound is evaluated for three important examples: the recursive estimation of slowly varying parameters of an autoregressive process, tracking a slowly varying frequency of a single cisoid in noise, and tracking parameters of a sinusoidal frequency with sinusoidal phase modulation.Facultad de IngenieríaInstituto de Investigaciones en Electrónica, Control y Procesamiento de Señale

Reduced Complexity Filtering with Stochastic Dominance Bounds: A Convex Optimization Approach

This paper uses stochastic dominance principles to construct upper and lower sample path bounds for Hidden Markov Model (HMM) filters. Given a HMM, by using convex optimization methods for nuclear norm minimization with copositive constraints, we construct low rank stochastic marices so that the optimal filters using these matrices provably lower and upper bound (with respect to a partially ordered set) the true filtered distribution at each time instant. Since these matrices are low rank (say R), the computational cost of evaluating the filtering bounds is O(XR) instead of O(X2). A Monte-Carlo importance sampling filter is presented that exploits these upper and lower bounds to estimate the optimal posterior. Finally, using the Dobrushin coefficient, explicit bounds are given on the variational norm between the true posterior and the upper and lower bounds

The Recursive Form of Error Bounds for RFS State and Observation with Pd<1

In the target tracking and its engineering applications, recursive state estimation of the target is of fundamental importance. This paper presents a recursive performance bound for dynamic estimation and filtering problem, in the framework of the finite set statistics for the first time. The number of tracking algorithms with set-valued observations and state of targets is increased sharply recently. Nevertheless, the bound for these algorithms has not been fully discussed. Treating the measurement as set, this bound can be applied when the probability of detection is less than unity. Moreover, the state is treated as set, which is singleton or empty with certain probability and accounts for the appearance and the disappearance of the targets. When the existence of the target state is certain, our bound is as same as the most accurate results of the bound with probability of detection is less than unity in the framework of random vector statistics. When the uncertainty is taken into account, both linear and non-linear applications are presented to confirm the theory and reveal this bound is more general than previous bounds in the framework of random vector statistics.In fact, the collection of such measurements could be treated as a random finite set (RFS)