Correlation clustering based coalition formation for multi-robot task allocation

Due to the inherent complexity of many real world tasks and the limited capabilities of currently available robots in the market, it is almost impossible for a single robot to finish a complex task. Therefore several robots may need to form coalitions to complete such tasks. In this paper, we study the multi-robot coalition formation problem for instantaneous task allocation (IA) where a group of robots needs to be allocated to a set of tasks so that the tasks can be finished optimally. This is a well-known NP-hard problem. To tackle this notoriously difficult problem, we use a correlation clustering technique that enables us to bring similar robots together to form coalitions. This clustering is achieved by using a Linear Programming-based graph partitioning approach along with a region growing strategy. The algorithm presented in this paper is fast and efficient in allocating (near) optimal robot coalitions to tasks.

[1]  Nicholas R. Jennings,et al.  An improved dynamic programming algorithm for coalition structure generation , 2008, AAMAS.

[2]  Gul A. Agha,et al.  Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems , 2004, MMAS.

[3]  Anthony Stentz,et al.  A comprehensive taxonomy for multi-robot task allocation , 2013, Int. J. Robotics Res..

[4]  Sarvapali D. Ramchurn,et al.  An Anytime Algorithm for Optimal Coalition Structure Generation , 2014, J. Artif. Intell. Res..

[5]  Julie A. Adams,et al.  Coalition formation for task allocation: theory and algorithms , 2011, Autonomous Agents and Multi-Agent Systems.

[6]  Prithviraj Dasgupta,et al.  Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

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

[8]  Howie Choset,et al.  M*: A complete multirobot path planning algorithm with performance bounds , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

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

[11]  Vladimir Ufimtsev,et al.  Dynamic reconfiguration in modular robots using graph partitioning-based coalitions , 2012, AAMAS.

[12]  Sarvapali D. Ramchurn,et al.  Anytime Optimal Coalition Structure Generation , 2007, AAAI.

[13]  Lynne E. Parker,et al.  A Complete Methodology for Generating Multi-Robot Task Solutions using ASyMTRe-D and Market-Based Task Allocation , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[14]  Lei Zhang,et al.  Task allocation via multi-agent coalition formation: taxonomy, algorithms and complexity , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[15]  Anthony Wirth,et al.  Correlation Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[16]  Nicholas R. Jennings,et al.  A distributed algorithm for anytime coalition structure generation , 2010, AAMAS.

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

[18]  Nicole Immorlica,et al.  Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques , 2003, Lecture Notes in Computer Science.

[19]  Sarvapali D. Ramchurn,et al.  Near-Optimal Anytime Coalition Structure Generation , 2006, IJCAI.