Min-Max Tours for Task Allocation to Heterogeneous Agents

We consider a scenario consisting of a set of heterogeneous mobile agents located at a depot, and a set of tasks dispersed over a geographic area. The agents are partitioned into different types. The tasks are partitioned into specialized tasks that can only be done by agents of a certain type, and generic tasks that can be done by any agent. The distances between every pair of tasks are specified, and satisfy the triangle inequality. Given this scenario, we address the problem of allocating these tasks among the available agents (subject to type compatibility constraints) while minimizing the maximum cost to tour the allocation by any agent and return to the depot. This problem is NP-hard, and we give a three phase algorithm to solve this problem that provides 5-factor approximation, regardless of the total number of agents and the number of agents of each type. We also show that in the special case where there is only one agent of each type, the algorithm has an approximation factor of 4.

[1]  R. Ravi,et al.  Min-max tree covers of graphs , 2004, Oper. Res. Lett..

[2]  Zhaohui Liu,et al.  Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems , 2015, COCOON.

[3]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[4]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[5]  Marco Dorigo,et al.  Division of labor in a group of robots inspired by ants' foraging behavior , 2006, TAAS.

[6]  M. Reza Khani,et al.  Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems , 2011, Algorithmica.

[7]  K. Sundar,et al.  An exact algorithm for a heterogeneous, multiple depot, multiple traveling salesman problem , 2015, 2015 International Conference on Unmanned Aircraft Systems (ICUAS).

[8]  Brett Browning,et al.  Dynamically formed heterogeneous robot teams performing tightly-coordinated tasks , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[9]  Emilio Frazzoli,et al.  Dynamic Vehicle Routing for Robotic Systems , 2011, Proceedings of the IEEE.

[10]  Brian Rodrigues,et al.  A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots , 2015, INFORMS J. Comput..

[11]  M. Ani Hsieh,et al.  ADAPTIVE DISTRIBUTION OF A SWARM OF HETEROGENEOUS ROBOTS , 2016 .

[12]  Swaroop Darbha,et al.  An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem , 2007, Oper. Res. Lett..

[13]  Kai Zhang,et al.  Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction , 2012, TAAS.

[14]  Mary L. Cummings,et al.  Mission Planning and Monitoring for Heterogeneous Unmanned Vehicle Teams: A Human-Centered Perspective , 2007 .

[15]  Esther M. Arkin,et al.  Approximations for minimum and min-max vehicle routing problems , 2006, J. Algorithms.

[16]  Alan Frieze,et al.  An extension of Christofides heuristic to the k-person travelling salesman problem , 1983, Discret. Appl. Math..

[17]  Han-Lim Choi,et al.  Real-Time Multi-UAV Task Assignment in Dynamic and Uncertain Environments , 2009 .

[18]  Sivakumar Rathinam,et al.  A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem , 2016, Optim. Lett..

[19]  Han-Lim Choi,et al.  Consensus-Based Decentralized Auctions for Robust Task Allocation , 2009, IEEE Transactions on Robotics.

[20]  Stephen L. Smith,et al.  Heterogeneous Task Allocation and Sequencing via Decentralized Large Neighborhood Search , 2017, Unmanned Syst..

[21]  Qi Han,et al.  Multi-Objective Optimization Based Allocation of Heterogeneous Spatial Crowdsourcing Tasks , 2018, IEEE Transactions on Mobile Computing.

[22]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[23]  Swaroop Darbha,et al.  3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem , 2012, Optim. Lett..