Comparing Three Approaches to Large-Scale Coordination

Coordination of large groups of agents or robots is starting to reach a level of maturity where prototype systems can be built and tested in realistic environments. These more realistic systems require that both algorithmic and practical issues are addressed in an integrated solution. In this chapter, we look at three implementations of large-scale coordination examining common issues, approaches, and open problems. The key result of the comparison is that there is a surprising degree of commonality between the independently developed approaches, in particular the use of partial, dynamic centralization. Conversely, open issues and problems encountered varied greatly with the notable exception that debugging was a major issue for each approach.

[1]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[2]  Yang Xu,et al.  Scaling teamwork to very large teams , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[3]  Wei-Min Shen,et al.  Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach , 2001, ATAL.

[4]  Wei-Min Shen,et al.  A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation , 2001, CP.

[5]  Takayuki Ito,et al.  Task Allocation in the RoboCup Rescue Simulation Domain: A Short Note , 2001, RoboCup.

[6]  Milind Tambe,et al.  Toward Team-Oriented Programming , 1999, ATAL.

[7]  Victor R. Lesser,et al.  Cooperative negotiation for soft real-time distributed resource allocation , 2003, AAMAS '03.

[8]  Joseph C. Culberson,et al.  Frozen development in graph coloring , 2001, Theor. Comput. Sci..

[9]  Katia P. Sycara,et al.  Conversational Case-Based Planning for Agent Team Coordination , 2001, ICCBR.

[10]  Jean Oh,et al.  Electric Elves: Agent Technology for Supporting Human Organizations , 2002, AI Mag..

[11]  Panos M. Pardalos,et al.  Theory and algorithms for cooperative systems , 2004 .

[12]  Hiroaki Kitano,et al.  RoboCup: A Challenge Problem for AI , 1997, AI Mag..

[13]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[14]  Weixiong Zhang,et al.  Analysis of Negotiation Protocols by Distributed Search , 2003 .

[15]  Milind Tambe,et al.  A prototype infrastructure for distributed robot-agent-person teams , 2003, AAMAS '03.

[16]  Norman M. Sadeh,et al.  Constrained Heuristic Search , 1989, IJCAI.

[17]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[18]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[19]  Milind Tambe,et al.  Agent Architectures for Flexible, Practical Teamwork , 1997, AAAI/IAAI.

[20]  Milind Tambe,et al.  Building large-scale robot systems: Distributed role assignment in dynamic, uncertain domains , 2003 .

[21]  Milind Tambe,et al.  An Automated Teamwork Infrastructure for Heterogeneous Software Agents and Humans , 2003, Autonomous Agents and Multi-Agent Systems.

[22]  Kurt Konolige,et al.  Centibots: Very Large Scale Distributed Robotic Teams , 2004, AAAI.

[23]  Jim Waldo,et al.  The Jini architecture for network-centric computing , 1999, CACM.

[24]  Nicholas R. Jennings,et al.  Controlling Cooperative Problem Solving in Industrial Multi-Agent Systems Using Joint Intentions , 1995, Artif. Intell..

[25]  Makoto Yokoo,et al.  Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems , 1995, CP.

[26]  Sarit Kraus,et al.  Collaborative Plans for Complex Group Action , 1996, Artif. Intell..