Multi-Agent Coordination Off-Line: Structure and Complexity

Coordination between processing entities is one of the most widely studied areas in multi-agent planning research. Recently, efforts have been made to understand the formal computational issues of this important area. In this paper, we make a step toward this direction, and analyze a certain class of coordination problems for dependent agents with independent goals acting in the same environment. We assume that a state-transition description of each agent is given, and that preconditioning an agent's transitions by the states of other agents is the only considered kind of inter-agent dependence. Off-line coordination between the agents is considered. We analyze some structural properties of these problems, and investigate the relationship between these properties and the complexity of coordination in this domain. We show that our general problem is provably intractable, but some significant subclasses are in NP and even polynomial.

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

[2]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[3]  Michael P. Georgeff,et al.  Communication and interaction in multi-agent planning , 1983, AAAI 1983.

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

[5]  Claude Le Pape.  A combination of centralized and distributed methods for multi-agent planning and scheduling , 1990, ICRA.

[6]  Hector J. Levesque,et al.  Confirmations and Joint Action , 1991, IJCAI.

[7]  Shin'ichi Yuta,et al.  Coordinating Autonomous And Centralized Decision Making To Achieve Cooperative Behaviors Between Multiple Mobile Robots , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[8]  Gil Tidhar,et al.  Planned Team Activity , 1992, MAAMAW.

[9]  Moshe Tennenholtz,et al.  Multi-entity Models , 1996, Machine Intelligence 14.

[10]  Eithan Ephrati,et al.  Divide and Conquer in Multi-Agent Planning , 1994, AAAI.

[11]  Rachid Alami,et al.  Multi-robot cooperation through incremental plan-merging , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[12]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[13]  Alex Fukunaga,et al.  Cooperative mobile robotics: antecedents and directions , 1995 .

[14]  Tucker R. Balch,et al.  Io, Ganymede, and Callisto A Multiagent Robot Trash-Collecting Team , 1995, AI Mag..

[15]  Victor R. Lesser,et al.  Designing a Family of Coordination Algorithms , 1997, ICMAS.

[16]  Michael R. M. Jenkin,et al.  A taxonomy for multi-agent robotics , 1996, Auton. Robots.

[17]  Sarit Kraus,et al.  Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents * , 1996 .

[18]  B. Grosz.  Collaborative Systems , 1996 .

[19]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

[21]  Michael Luck,et al.  Cooperation Structures , 1997, IJCAI.

[22]  Michael Wooldridge,et al.  Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23-29, 1997, 2 Volumes , 1997, IJCAI.

[23]  Christer Bäckström,et al.  State-Variable Planning Under Structural Restrictions: Algorithms and Complexity , 1998, Artif. Intell..

[24]  Cooperative multiagent robotic systems , 1998 .

[25]  Rachid Alami,et al.  A Scheme for Coordinating Multi-robots Planning Activities and Plans Execution , 1998, ECAI.

[26]  Edmund H. Durfee,et al.  Top-down search for coordinating the hierarchical plans of multiple agents , 1999, AGENTS '99.

[27]  Ronen I. Brafman,et al.  Strucutre and Complexitiy in Planning with Unary Operators , 2000, PuK.

[28]  Carmel Domshlak,et al.  Multi-agent off-line coordination: Structure and complexity , 2001 .