The unscented particle filter

Conference item

In this paper, we propose a new particle filter based on sequential importance sampling. The algorithm uses a bank of unscented filters to obtain the importance proposal distribution. This proposal has two very "nice" properties. Firstly, it makes efficient use of the latest available information and, secondly, it can have heavy tails. As a result, we find that the algorithm outperforms standard particle filtering and other nonlinear filtering methods very substantially. This experimental finding is in agreement with the theoretical convergence proof for the algorithm. The algorithm also includes resampling and (possibly) Markov chain Monte Carlo (MCMC) steps.

Authors: Van Der Merwe, R; Doucet, A; De Freitas, N; Wan, E

• Publisher: Neural information processing systems foundation
• Host title: Advances in Neural Information Processing Systems
• Publication date: 2001-01-01
• ISSN: 1049-5258
• ISBN-10: 0262122413
• ISBN-13: 9780262122412