Assignment Algorithms for Multi-Robot Multi-Target Tracking with Sufficient and Limited Sensing Capability

by   Peihan Li, et al.

We study the problem of assigning robots with actions to track targets. The objective is to optimize the robot team's tracking quality which can be defined as the reduction in the uncertainty of the targets' states. Specifically, we consider two assignment problems given the different sensing capabilities of the robots. In the first assignment problem, a single robot is sufficient to track a target. To this end, we present a greedy algorithm (Algorithm 1) that assigns a robot with its action to each target. We prove that the greedy algorithm has a 1/2 approximation bound and runs in polynomial time. Then, we study the second assignment problem where two robots are necessary to track a target. We design another greedy algorithm (Algorithm 2) that assigns a pair of robots with their actions to each target. We prove that the greedy algorithm achieves a 1/3 approximation bound and has a polynomial running time. Moreover, we illustrate the performance of the two greedy algorithms in the ROS-Gazebo environment where the tracking patterns of one robot following one target using Algorithm 1 and two robots following one target using Algorithm 2 are clearly observed. Further, we conduct extensive comparisons to demonstrate that the two greedy algorithms perform close to their optimal counterparts and much better than their respective (1/2 and 1/3) approximation bounds.


page 1

page 6

page 7


Distributed Assignment with Limited Communication for Multi-Robot Multi-Target Tracking

We study the problem of tracking multiple moving targets using a team of...

Multi-Robot Localization and Target Tracking with Connectivity Maintenance and Collision Avoidance

We study the problem that requires a team of robots to perform joint loc...

Scalable Distributed Planning for Multi-Robot, Multi-Target Tracking

In multi-robot multi-target tracking, robots coordinate to monitor group...

Resilience in multi-robot multi-target tracking with unknown number of targets through reconfiguration

We address the problem of maintaining resource availability in a network...

Target assignment for robots constrained by limited communication range

This paper investigates the task assignment problem for multiple dispers...

Complete characterization of a class of privacy-preserving tracking problems

We examine the problem of target tracking whilst simultaneously preservi...

Multi-target tracking algorithms in 3D

Ladars provide a unique capability for identification of objects and mot...

Please sign up or login with your details

Forgot password? Click here to reset