A comprehensive taxonomy for multi-robot task allocation

Task allocation is an important aspect of many multi-robot systems. The features and complexity of multi-robot task allocation (MRTA) problems are dictated by the requirements of the particular domain under consideration. These problems can range from those involving instantaneous distribution of simple, independent tasks among members of a homogenous team, to those requiring the time-extended scheduling of complex interrelated multi-step tasks for members of a heterogenous team related by several constraints. The existing widely used taxonomy for task allocation in multi-robot systems was designed for problems with independent tasks and does not deal with problems with interrelated utilities and constraints. While that taxonomy was a ground-breaking contribution to the MRTA literature, a survey of recent work in MRTA reveals that it is no longer a sufficient taxonomy, due to the increasing importance of interrelated utilities and constraints in realistic MRTA problems under consideration. Thus, in this paper, we present a new, comprehensive taxonomy, iTax, that explicitly takes into consideration the issues of interrelated utilities and constraints. Our taxonomy maps categories of MRTA problems to existing mathematical models from combinatorial optimization and operations research, and hence draws important parallels between robotics and these fields.

[1]  Evangelos Markakis,et al.  Auction-Based Multi-Robot Routing , 2005, Robotics: Science and Systems.

[2]  P. M. Shiroma,et al.  CoMutaR: A framework for multi-robot coordination and task allocation , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Brett Browning,et al.  xBots: An approach to generating and executing optimal multi-robot plans with cross-schedule dependencies , 2012, 2012 IEEE International Conference on Robotics and Automation.

[4]  Alantha Newman,et al.  Traveling salesman path problems , 2008, Math. Program..

[5]  Jitender S. Deogun,et al.  A Personnel Assignment Problem , 1984, J. Algorithms.

[6]  W.-D. Wei,et al.  On A Personnel Assignment Problem , 1990, Int. J. Found. Comput. Sci..

[7]  José Guerrero,et al.  Multi-Robot Task Allocation Strategies Using Auction-Like Mechanisms , 2003 .

[8]  Sarvapali D. Ramchurn,et al.  Coalition formation with spatial and temporal constraints , 2010, AAMAS.

[9]  Sven Koenig,et al.  Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control , 2007, IJCAI.

[10]  Joseph B. Mazzola,et al.  Resource-Constrained Assignment Scheduling , 1986, Oper. Res..

[11]  Lovekesh Vig,et al.  Multi-robot coalition formation , 2006, IEEE Transactions on Robotics.

[12]  Rachid Alami,et al.  M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[13]  Anthony Stentz,et al.  Time-extended multi-robot coordination for domains with intra-path constraints , 2009, Robotics: Science and Systems.

[14]  Maja J. Matarić,et al.  On multi-robot task allocation , 2003 .

[15]  Tara A. Estlin,et al.  A comparison of coordinated planning methods for cooperating rovers , 1999, AGENTS '00.

[16]  Wanmi Chen,et al.  Multi-robot dynamic role assignment based on path cost , 2011, 2011 Chinese Control and Decision Conference (CCDC).

[17]  Sarit Kraus,et al.  Task Allocation Via Coalition Formation Among Autonomous Agents , 1995, IJCAI.

[18]  Wolfram Burgard,et al.  Coordination for Multi-Robot Exploration and Mapping , 2000, AAAI/IAAI.

[19]  Michail G. Lagoudakis,et al.  Multi-robot routing under limited communication range , 2008, 2008 IEEE International Conference on Robotics and Automation.

[20]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[21]  Anthony Stentz,et al.  An auction-based approach to complex task allocation for multirobot teams , 2006 .

[22]  Illah R. Nourbakhsh,et al.  Constraint optimization coordination architecture for search and rescue robotics , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[23]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[24]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

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

[26]  Sven Koenig,et al.  Robot exploration with combinatorial auctions , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[27]  Manuela Veloso,et al.  Multi-Robot Dynamic Role Assignment and Coordination Through Shared Potential Fields , 2002 .

[28]  Anthony Stentz,et al.  Time-extended multi-robot coordination for domains with intra-path constraints , 2011, Auton. Robots.

[29]  Zhiqiang Zheng,et al.  Combinatorial Bids based Multi-robot Task Allocation Method , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[30]  Lucio Bianco,et al.  Minimizing makespan in a multimode multiprocessor shop scheduling problem , 1999 .

[31]  Anthony Stentz,et al.  Traderbots: a new paradigm for robust and efficient multirobot coordination in dynamic environments , 2004 .

[32]  Lynne E. Parker,et al.  ALLIANCE: an architecture for fault tolerant multirobot cooperation , 1998, IEEE Trans. Robotics Autom..

[33]  Rachid Alami,et al.  A distributed tasks allocation scheme in multi-UAV context , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[34]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[35]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[36]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[37]  E. Gil Jones.  Multi-robot coordination in domains with intra-path constraints , 2010 .

[38]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[39]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[40]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..

[41]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[42]  Jesper Larsen,et al.  The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies , 2012, Eur. J. Oper. Res..

[43]  Jesper Larsen,et al.  The vehicle routing problem with time windows and temporal dependencies , 2011, Networks.

[44]  Mikael Rönnqvist,et al.  Combined vehicle routing and scheduling with temporal precedence and synchronization constraints , 2008, Eur. J. Oper. Res..

[45]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[46]  G. Ayorkor Korsah,et al.  Exploring Bounded Optimal Coordination for Heterogeneous Teams with Cross-Schedule Dependencies , 2011 .

[47]  Barry Brumitt,et al.  GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[48]  Lynne E. Parker,et al.  Building Multirobot Coalitions Through Automated Task Solution Synthesis , 2006, Proceedings of the IEEE.

[49]  M. Rönnqvist,et al.  A Branch and Price Algorithm for the Combined Vehicle Routing and Scheduling Problem With Synchronization Constraints , 2007 .

[50]  Pedro U. Lima,et al.  Multi-Robot Systems , 2005, Innovations in Robot Mobility and Control.

[51]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[52]  Anthony Stentz,et al.  Market-Based Complex Task Allocation for Multirobot Teams , 2006 .

[53]  Sven Koenig,et al.  Multi-robot routing with rewards and disjoint time windows , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[54]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[55]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..