Distributed coverage algorithms applied to distributed target tracking - Robustness evaluation


Arnaud Klipfel (1)   
(1) ENSTA Bretagne   


Abstract

Distributed pursuit-evasion games or target tracking problems can be formulated as coverage problems in time-varying environments. The time-varying density function modelling the environment can account for the uncertainty on the targets' position. Previous works have not used the network of agents to reach a consensus on the time-varying density, have considered the velocity of the target as known, and have used Lloyd's time-invariant coverage control algorithm. This work surveys the state of the art in distributed coverage control, implements the most well-established coverage control algorithms, and evaluates their robustness in simulation and hardware experiments on a single-target tracking task. Finally, the dynamic coverage algorithm TVD-D1 is found to be the best option for target tracking applications.

Report: [PDF]

TVD-D1

TVD-Cortes

Llyod Uniform