An Improved Unscented Particle Filter with Global Sampling Strategy

The Unscented Particle Filter

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 standar...

An Improved FastSLAM Framework Based on Particle Swarm Optimization and Unscented Particle Filter ⋆

FastSLAM is a framework which solves the problem of simultaneous localization and mapping using a Rao-Blackwellized particle filter. Conventional FastSLAM is known to degenerate over time in terms of accuracy due to the particle depletion in resampling phase. To solve this problem, a FastSLAM method based on particle swarm optimization and unscented particle filter is proposed. The number of pa...

Initializing An Unscented Kalman Filter Using A Particle Filter

This work develops an algorithm to initialize an Unscented Kalman Filter using a Particle Filter for applications with initial non-Gaussian probability density functions. The method is applied to estimating the position of a road vehicle along a one-mile test track using terrain-based localization where the pitch response of the vehicle is compared to a premeasured pitch map of the test track. ...

Robust Adaptive Unscented Particle Filter

An unscented particle filter for ground maneuvering target tracking

In this study, an unscented particle filtering method based on an interacting multiple model (IMM) frame for a Markovian switching system is presented. The method integrates the multiple model (MM) filter with an unscented particle filter (UPF) by an interaction step at the beginning. The framework (interaction/mixing, filtering, and combination) is similar to that in a standard IMM filter, but...