46,865 research outputs found
Joint Probabilistic Data Association-Feedback Particle Filter for Multiple Target Tracking Applications
This paper introduces a novel feedback-control based particle filter for the
solution of the filtering problem with data association uncertainty. The
particle filter is referred to as the joint probabilistic data
association-feedback particle filter (JPDA-FPF). The JPDA-FPF is based on the
feedback particle filter introduced in our earlier papers. The remarkable
conclusion of our paper is that the JPDA-FPF algorithm retains the innovation
error-based feedback structure of the feedback particle filter, even with data
association uncertainty in the general nonlinear case. The theoretical results
are illustrated with the aid of two numerical example problems drawn from
multiple target tracking applications.Comment: In Proc. of the 2012 American Control Conferenc
Interacting Multiple Model-Feedback Particle Filter for Stochastic Hybrid Systems
In this paper, a novel feedback control-based particle filter algorithm for
the continuous-time stochastic hybrid system estimation problem is presented.
This particle filter is referred to as the interacting multiple model-feedback
particle filter (IMM-FPF), and is based on the recently developed feedback
particle filter. The IMM-FPF is comprised of a series of parallel FPFs, one for
each discrete mode, and an exact filter recursion for the mode association
probability. The proposed IMM-FPF represents a generalization of the
Kalmanfilter based IMM algorithm to the general nonlinear filtering problem.
The remarkable conclusion of this paper is that the IMM-FPF algorithm retains
the innovation error-based feedback structure even for the nonlinear problem.
The interaction/merging process is also handled via a control-based approach.
The theoretical results are illustrated with the aid of a numerical example
problem for a maneuvering target tracking application
Hybrid Poisson and multi-Bernoulli filters
The probability hypothesis density (PHD) and multi-target multi-Bernoulli
(MeMBer) filters are two leading algorithms that have emerged from random
finite sets (RFS). In this paper we study a method which combines these two
approaches. Our work is motivated by a sister paper, which proves that the full
Bayes RFS filter naturally incorporates a Poisson component representing
targets that have never been detected, and a linear combination of
multi-Bernoulli components representing targets under track. Here we
demonstrate the benefit (in speed of track initiation) that maintenance of a
Poisson component of undetected targets provides. Subsequently, we propose a
method of recycling, which projects Bernoulli components with a low probability
of existence onto the Poisson component (as opposed to deleting them). We show
that this allows us to achieve similar tracking performance using a fraction of
the number of Bernoulli components (i.e., tracks).Comment: Submitted to 15th International Conference on Information Fusion
(2012
Distributed Maximum Likelihood for Simultaneous Self-localization and Tracking in Sensor Networks
We show that the sensor self-localization problem can be cast as a static
parameter estimation problem for Hidden Markov Models and we implement fully
decentralized versions of the Recursive Maximum Likelihood and on-line
Expectation-Maximization algorithms to localize the sensor network
simultaneously with target tracking. For linear Gaussian models, our algorithms
can be implemented exactly using a distributed version of the Kalman filter and
a novel message passing algorithm. The latter allows each node to compute the
local derivatives of the likelihood or the sufficient statistics needed for
Expectation-Maximization. In the non-linear case, a solution based on local
linearization in the spirit of the Extended Kalman Filter is proposed. In
numerical examples we demonstrate that the developed algorithms are able to
learn the localization parameters.Comment: shorter version is about to appear in IEEE Transactions of Signal
Processing; 22 pages, 15 figure
On-Manifold Preintegration for Real-Time Visual-Inertial Odometry
Current approaches for visual-inertial odometry (VIO) are able to attain
highly accurate state estimation via nonlinear optimization. However, real-time
optimization quickly becomes infeasible as the trajectory grows over time, this
problem is further emphasized by the fact that inertial measurements come at
high rate, hence leading to fast growth of the number of variables in the
optimization. In this paper, we address this issue by preintegrating inertial
measurements between selected keyframes into single relative motion
constraints. Our first contribution is a \emph{preintegration theory} that
properly addresses the manifold structure of the rotation group. We formally
discuss the generative measurement model as well as the nature of the rotation
noise and derive the expression for the \emph{maximum a posteriori} state
estimator. Our theoretical development enables the computation of all necessary
Jacobians for the optimization and a-posteriori bias correction in analytic
form. The second contribution is to show that the preintegrated IMU model can
be seamlessly integrated into a visual-inertial pipeline under the unifying
framework of factor graphs. This enables the application of
incremental-smoothing algorithms and the use of a \emph{structureless} model
for visual measurements, which avoids optimizing over the 3D points, further
accelerating the computation. We perform an extensive evaluation of our
monocular \VIO pipeline on real and simulated datasets. The results confirm
that our modelling effort leads to accurate state estimation in real-time,
outperforming state-of-the-art approaches.Comment: 20 pages, 24 figures, accepted for publication in IEEE Transactions
on Robotics (TRO) 201
- …