A tutorial on particle filters for online nonlinear/non-GaussianBayesian tracking
Arulampalam, M.S.
Maskell, S.
Gordon, N.
Clapp, T.
Defence Sci. & Technol. Organ., Adelaide, SA ;
This paper appears in: Signal Processing, IEEE Transactions on
Publication Date: Feb 2002
Volume: 50,
Issue: 2
On page(s): 174-188
ISSN: 1053-587X
References Cited: 43
CODEN: ITPRED
INSPEC Accession Number: 7173038
Digital Object Identifier: 10.1109/78.978374
Current Version Published: 2002-08-07
Abstract
Increasingly, for many application areas, it is becoming important
to include elements of nonlinearity and non-Gaussianity in order to
model accurately the underlying dynamics of a physical system. Moreover,
it is typically crucial to process data on-line as it arrives, both from
the point of view of storage costs as well as for rapid adaptation to
changing signal characteristics. In this paper, we review both optimal
and suboptimal Bayesian algorithms for nonlinear/non-Gaussian tracking
problems, with a focus on particle filters. Particle filters are
sequential Monte Carlo methods based on point mass (or "particle")
representations of probability densities, which can be applied to any
state-space model and which generalize the traditional Kalman filtering
methods. Several variants of the particle filter such as SIR, ASIR, and
RPF are introduced within a generic framework of the sequential
importance sampling (SIS) algorithm. These are discussed and compared
with the standard EKF through an illustrative example
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
