Particle Filtering for Large-Dimensional State Spaces With Multimodal Observation Likelihoods

  • Authors:
  • N. Vaswani

  • Affiliations:
  • Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA

  • Venue:
  • IEEE Transactions on Signal Processing - Part I
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study efficient importance sampling techniques for particle filtering (PF) when either (a) the observation likelihood (OL) is frequently multimodal or heavy-tailed, or (b) the state space dimension is large or both. When the OL is multimodal, but the state transition pdf (STP) is narrow enough, the optimal importance density is usually unimodal. Under this assumption, many techniques have been proposed. But when the STP is broad, this assumption does not hold. We study how existing techniques can be generalized to situations where the optimal importance density is multimodal, but is unimodal conditioned on a part of the state vector. Sufficient conditions to test for the unimodality of this conditional posterior are derived. Our result is directly extendable to testing for unimodality of any posterior. The number of particles N to accurately track using a PF increases with state space dimension, thus making any regular PF impractical for large dimensional tracking problems. But in most such problems, most of the state change occurs in only a few dimensions, while the change in the rest of the dimensions is small. Using this property, we propose to replace importance sampling from a large part of the state space (whose conditional posterior is narrow enough) by just tracking the mode of the conditional posterior. This introduces some extra error, but it also greatly reduces the importance sampling dimension. The net effect is much smaller error for a given N, especially when the available N is small. An important class of large dimensional problems with multimodal OL is tracking spatially varying physical quantities such as temperature or pressure in a large area using a network of sensors which may be nonlinear and/or may have nonnegligible failure probabilities. Improved performance of our proposed algorithms over existing PFs is demonstrated for this problem.