Distributed multi-target tracking is a canonical task for multi-robot systems, encompassing applications from environmental monitoring to disaster response to surveillance. In many situations, the distribution of unknown objects in a search area is irregular, with objects are likely to distribute in clusters instead of evenly distributed. In this paper, we develop a novel distributed multi-robot multi-target tracking algorithm for effectively tracking clustered targets from noisy measurements. Our algorithm contains two major components. Firstly, both the instantaneous and cumulative target density are estimated, providing the best guess of current target states and long-term coarse distribution of clusters, respectively. Secondly, the power diagram is implemented in Lloyd’s algorithm to optimize task space assignment for each robot to trade-off between tracking detected targets in clusters and searching for potential targets outside clusters. We demonstrate the efficacy of our proposed method and show that our method outperforms of other candidates in tracking accuracy through a set of simulations.
Distributed Multi-robot Tracking of Unknown Clustered Targets with Noisy Measurements
Springer Proceedings in Advanced Robotics
International Symposium on Distributed Autonomous Robotic Systems ; 2022 ; Montbéliard, France November 28, 2022 - November 30, 2022
2024-02-01
13 pages
Article/Chapter (Book)
Electronic Resource
English
Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets
British Library Online Contents | 2002
|