30,596 research outputs found
A Direct Sampling Particle Filter from Approximate Conditional Density Function Supported on Constrained State Space
Constraints on the state vector must be taken into account in the state estimation problem. Recently, acceptance/rejection and projection methods are proposed in the particle filter framework for constraining the particles. A weighted least squares formulation is used for constraining samples in unscented and ensemble Kalman filters. In this paper, direct sampling from an approximate conditional probability density function (pdf) is proposed. It is obtained by approximating the a priori pdf as a Gaussian. The support of the conditional density is a subset of the intersection of two supports, the 3-sigma bounds of the priori Gaussian and the constrained state space. A direct sampling algorithm is proposed for handling linear and nonlinear equality and inequality constraints. The algorithm uses the constrained mode for nonlinear constraints
Efficient delay-tolerant particle filtering
This paper proposes a novel framework for delay-tolerant particle filtering
that is computationally efficient and has limited memory requirements. Within
this framework the informativeness of a delayed (out-of-sequence) measurement
(OOSM) is estimated using a lightweight procedure and uninformative
measurements are immediately discarded. The framework requires the
identification of a threshold that separates informative from uninformative;
this threshold selection task is formulated as a constrained optimization
problem, where the goal is to minimize tracking error whilst controlling the
computational requirements. We develop an algorithm that provides an
approximate solution for the optimization problem. Simulation experiments
provide an example where the proposed framework processes less than 40% of all
OOSMs with only a small reduction in tracking accuracy
Analysis of error propagation in particle filters with approximation
This paper examines the impact of approximation steps that become necessary
when particle filters are implemented on resource-constrained platforms. We
consider particle filters that perform intermittent approximation, either by
subsampling the particles or by generating a parametric approximation. For such
algorithms, we derive time-uniform bounds on the weak-sense error and
present associated exponential inequalities. We motivate the theoretical
analysis by considering the leader node particle filter and present numerical
experiments exploring its performance and the relationship to the error bounds.Comment: Published in at http://dx.doi.org/10.1214/11-AAP760 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Bridging the ensemble Kalman and particle filter
In many applications of Monte Carlo nonlinear filtering, the propagation step
is computationally expensive, and hence, the sample size is limited. With small
sample sizes, the update step becomes crucial. Particle filtering suffers from
the well-known problem of sample degeneracy. Ensemble Kalman filtering avoids
this, at the expense of treating non-Gaussian features of the forecast
distribution incorrectly. Here we introduce a procedure which makes a
continuous transition indexed by gamma in [0,1] between the ensemble and the
particle filter update. We propose automatic choices of the parameter gamma
such that the update stays as close as possible to the particle filter update
subject to avoiding degeneracy. In various examples, we show that this
procedure leads to updates which are able to handle non-Gaussian features of
the prediction sample even in high-dimensional situations
Fast Monte-Carlo Localization on Aerial Vehicles using Approximate Continuous Belief Representations
Size, weight, and power constrained platforms impose constraints on
computational resources that introduce unique challenges in implementing
localization algorithms. We present a framework to perform fast localization on
such platforms enabled by the compressive capabilities of Gaussian Mixture
Model representations of point cloud data. Given raw structural data from a
depth sensor and pitch and roll estimates from an on-board attitude reference
system, a multi-hypothesis particle filter localizes the vehicle by exploiting
the likelihood of the data originating from the mixture model. We demonstrate
analysis of this likelihood in the vicinity of the ground truth pose and detail
its utilization in a particle filter-based vehicle localization strategy, and
later present results of real-time implementations on a desktop system and an
off-the-shelf embedded platform that outperform localization results from
running a state-of-the-art algorithm on the same environment
- …