Exponential Natural Particle Filter

by   Ghazal Zand, et al.

Particle Filter algorithm (PF) suffers from some problems such as the loss of particle diversity, the need for large number of particles, and the costly selection of the importance density functions. In this paper, a novel Exponential Natural Particle Filter (xNPF) is introduced to solve the above problems. In this approach, a state transitional probability with the use of natural gradient learning is proposed which balances exploration and exploitation more robustly. The results show that xNPF converges much closer to the true target states than the other state of the art particle filter.



page 5

page 6


Error Analysis for the Particle Filter: Methods and Theoretical Support

The particle filter is a popular Bayesian filtering algorithm for use in...

SVRPF: An Improved Particle Filter for a Nonlinear/non-Gaussian Environment

The performance of a particle filter (PF) in nonlinear and non-Gaussian ...

Feedback Particle Filter With Stochastically Perturbed Innovation And Its Application to Dual Estimation

In this paper, we introduce a stochastically perturbed feedback particle...

Distributed SMC-PHD Fusion for Partial, Arithmetic Average Consensus

We propose an average consensus approach for distributed SMC-PHD (sequen...

TurKPF: TurKontrol as a Particle Filter

TurKontrol, and algorithm presented in (Dai et al. 2010), uses a POMDP t...

DBN-Based Combinatorial Resampling for Articulated Object Tracking

Particle Filter is an effective solution to track objects in video seque...

Intensity Particle Flow SMC-PHD Filter For Audio Speaker Tracking

Non-zero diffusion particle flow Sequential Monte Carlo probability hypo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.