Exponential Natural Particle Filter

TL;DR

This paper introduces the Exponential Natural Particle Filter (xNPF), a novel algorithm that improves particle diversity and convergence efficiency in state estimation tasks by leveraging natural gradient learning.

Contribution

The paper presents a new particle filter variant that uses natural gradient learning to enhance exploration and exploitation balance, addressing key limitations of traditional particle filters.

Findings

xNPF converges closer to true target states than existing filters

xNPF maintains higher particle diversity during estimation

xNPF requires fewer particles for accurate results

Abstract

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.