Abstract
Particle filters (PF), as a kind of non-linear/non-Gaussian estimation method, are suffering from two problems in large-dimensional cases, namely particle impoverishment and sample size dependency. Previous studies from the authors have proposed a novel PF algorithm that incorporates ant colony optimisation (PF ACO), to alleviate these problems. In this paper the authors will provide a theoretical foundation of this new algorithm; two theorems are introduced to validate that the PF ACO introduces smaller Kullback-Leibler divergence (K-L divergence) between the proposal distribution and the optimal one compared to those produced by the generic PF. In addition, with the same threshold level, the PF ACO has a higher probability than the generic PF to achieve a certain K-L divergence. A mobile robot localisation experiment is applied to examine the performance between various PF schemes.
| Original language | English |
|---|---|
| Pages (from-to) | 689-697 |
| Number of pages | 9 |
| Journal | IET Control Theory and Applications |
| Volume | 6 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 15 Mar 2012 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Human-Computer Interaction
- Computer Science Applications
- Control and Optimization
- Electrical and Electronic Engineering