Multi-agent networks are known for their scalability, robustness, flexibility, and are typically tasked with a variety of tasks such as target tracking, surveillance, traffic control, and environmental monitoring. Distributed Particle Filters (DPF) are often employed when the for non-linear parameter estimation with non-Gaussian noise. In this paper, we propose a novel distributed particle filter whose transmitted quantities are particles. The fusion process of particles is implemented in a distributed and iterative fashion. To reduce the communication overhead, we adopt the Gaussian process-enhanced resampling algorithm, which reduces the size of local particle set, while still ensures acceptable filtering performance. To determine the local particle set after the communication, we propose two solutions. Our first algorithm (GP-DPF) adopts a “scoring mechanism”, allowing local agents score the received particles and using the scores as the selection criterion. Our second proposed solution (FA-DPF) is a meta-heuristic approach, which uses the well known firefly algorithm as a selection method for particle-based distributed particle filtering. Our simulations demonstrate the superiority of our proposed algorithms under the condition of limited communication and computational resources against other state-of-the-art distributed particle filters.
Distributed Particle Filter Based on Particle Exchanges
2023-03-04
1399770 byte
Conference paper
Electronic Resource
English
Wiley | 2022
|Improved particle filter algorithm based on chaos particle swarm optimization
British Library Online Contents | 2016
|Distributed Particle Filter for Urban Traffic Networks Using a Platoon-Based Model
Online Contents | 2013
|An adaptive color-based particle filter
British Library Online Contents | 2003
|