A Framework for Multi-Robot Coalition Formation

Task allocation is a fundamental problem that any multirobot system must address. Numerous multi-robot task allocation schemes have been proposed over the past decade. A vast majority of these schemes address the problem of assigning a single robot to each task. However as the complexity of multi-robot tasks increases, often situations arise where multiple robot teams need to be assigned to a set of tasks. This problem, also known as the coalition formation problem has received relatively little attention in the multi-robot community. This paper provides a generic, task independent framework for solutions to this problem for a variety task environments. In particular, the paper introduces RACHNA, a novel auction based coalition formation system for dynamic task environments. This is an extension to our previous work which proposed a static multi-robot coalition formation algorithm based on a popular heuristic from the Distributed Artificial Intelligence

[1]  Tim Lüth,et al.  A distributed control architecture for autonomous mobile robots - implementation of the Karlsruhe Multi-Agent Robot Architecture (KAMARA) , 1997, Adv. Robotics.

[2]  Katia P. Sycara,et al.  Coordination of Multiple Intelligent Software Agents , 1996, Int. J. Cooperative Inf. Syst..

[3]  Onn Shehory,et al.  Coalition structure generation with worst case guarantees , 2022 .

[4]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[5]  Maria L. Gini,et al.  A market architecture for multi-agent contracting , 1998, AGENTS '98.

[6]  Gaurav S. Sukhatme,et al.  Most valuable player: a robot device server for distributed control , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[7]  Lovekesh Vig,et al.  Issues in Multi-Robot Coalition Formation , 2005 .

[8]  Mark Yim,et al.  Indoor automation with many mobile robots , 1990, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications.

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

[10]  Kian Hsiang Low,et al.  Task Allocation via Self-Organizing Swarm Coalitions in Distributed Mobile Sensor Network , 2004, AAAI.

[11]  Maja J. Mataric,et al.  Murdoch: publish/subscribe task allocation for heterogeneous agents , 2000, AGENTS '00.

[12]  Brian P. Gerkey,et al.  Are ( explicit ) multi-robot coordination and multi-agent coordination really so different ? , 2004 .

[13]  Gaurav S. Sukhatme,et al.  Multi-robot task-allocation through vacancy chains , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[14]  Lynne E. Parker,et al.  Cooperative Robotics for Multi-Target Observation , 1999, Intell. Autom. Soft Comput..

[15]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[16]  Rodney A. Brooks,et al.  A Robust Layered Control Syste For A Mobile Robot , 2022 .

[17]  Victor R. Lesser,et al.  Organization-based cooperative coalition formation , 2004, Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)..

[18]  Robert J. Wood,et al.  Towards a 3g crawling robot through the integration of microrobot technologies , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[19]  Maja J. Mataric,et al.  Broadcast of local eligibility: behavior-based control for strongly cooperative robot teams , 2000, International Conference on Autonomous Agents.

[20]  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).

[21]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[22]  Tuomas Sandholm,et al.  An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.

[23]  Victor R. Lesser,et al.  Advantages of a Leveled Commitment Contracting Protocol , 1996, AAAI/IAAI, Vol. 1.

[24]  Anthony Stentz,et al.  Complex Task Allocation For Multiple Robots , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[25]  A. Chella,et al.  Metaphor of Politics: A Mechanism of Coalition Formation , 2004 .

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

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

[28]  Maja J. Mataric,et al.  Pusher-watcher: an approach to fault-tolerant tightly-coupled robot coordination , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

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

[30]  Maja J. Matarić,et al.  A Framework for Studying Multi-Robot Task Allocation , 2003 .

[31]  Anthony Stentz,et al.  A Free Market Architecture for Coordinating Multiple Robots , 1999 .

[32]  Leen-Kiat Soh,et al.  Investigating reinforcement learning in multiagent coalition formation , 2004, AAAI 2004.

[33]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.