Multi-agent Path Planning in Known Dynamic Environments

We consider the problem of planning paths of multiple agents in a dynamic but predictable environment. Typical scenarios are evacuation, reconfiguration, and containment. We present a novel representation of abstract path-planning problems in which the stationary environment is explicitly coded as a graph (called the arena) while the dynamic environment is treated as just another agent. The complexity of planning using this representation is pspace-complete. The arena complexity (i.e., the complexity of the planning problem in which the graph is the only input, in particular, the number of agents is fixed) is np-hard. Thus, we provide structural restrictions that put the arena complexity of the planning problem into ptime(for any fixed number of agents). The importance of our work is that these structural conditions (and hence the complexity results) do not depend on graph-theoretic properties of the arena (such as clique- or tree-width), but rather on the abilities of the agents.

[1]  Aniello Murano,et al.  Relentful strategic reasoning in alternating-time temporal logic , 2010, J. Log. Comput..

[2]  Pierre Feyzeau,et al.  Path planning: A 2013 survey , 2013, Proceedings of 2013 International Conference on Industrial Engineering and Systems Management (IESM).

[3]  Kee-Eung Kim,et al.  Solving Stochastic Planning Problems with Large State and Action Spaces , 1998, AIPS.

[4]  Hubie Chen,et al.  Causal graphs and structurally restricted planning , 2010, J. Comput. Syst. Sci..

[5]  Marco Pistore,et al.  The Planning Spectrum - One, Two, Three, Infinity , 2007, J. Artif. Intell. Res..

[6]  Malte Helmert,et al.  Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984) , 2012, SOCS.

[7]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[8]  Blai Bonet,et al.  A Concise Introduction to Models and Methods for Automated Planning , 2013, A Concise Introduction to Models and Methods for Automated Planning.

[9]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[10]  Malik Ghallab,et al.  Chapter 14 – Temporal Planning , 2004 .

[11]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[12]  Michael Wooldridge,et al.  Tractable multiagent planning for epistemic goals , 2002, AAMAS '02.

[13]  V. Lumelsky,et al.  Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .

[14]  Wojciech Jamroga,et al.  Strategic Planning through Model Checking of ATL Formulae , 2004, ICAISC.

[15]  Fausto Giunchiglia,et al.  Planning as Model Checking , 1999, ECP.

[16]  Gordon T. Wilfong,et al.  Motion planning in the presence of movable obstacles , 1988, SCG '88.

[17]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[18]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[19]  Dinesh Manocha,et al.  Centralized path planning for multiple robots: Optimal decoupling into sequential plans , 2009, Robotics: Science and Systems.

[20]  Martin C. Cooper,et al.  Monotone Temporal Planning: Tractability, Extensions and Applications , 2014, J. Artif. Intell. Res..

[21]  Ronen I. Brafman,et al.  From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.

[22]  Kostas E. Bekris,et al.  Towards Using Discrete Multiagent Pathfinding to Address Continuous Problems , 2012, MAPF@AAAI.

[23]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[24]  Giuseppe De Giacomo,et al.  Automata-Theoretic Approach to Planning for Temporally Extended Goals , 1999, ECP.

[25]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[26]  Pavel Surynek.  An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.

[27]  Aniello Murano,et al.  A Game-based Model for Human-robots Interaction , 2015, WOA.

[28]  Madhu Sudan,et al.  Motion Planning on a Graph (Extended Abstract) , 1994, FOCS 1994.

[29]  Marco Pistore,et al.  Planning as Model Checking for Extended Goals in Non-deterministic Domains , 2001, IJCAI.

[30]  Xiaolan Xie,et al.  A stochastic model for operating room planning with elective and emergency demand for surgery , 2008, Eur. J. Oper. Res..

[31]  Gary William Flake,et al.  Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants" , 2002, Theoretical Computer Science.

[32]  John Tromp,et al.  Limits of Rush Hour Logic Complexity , 2005, ArXiv.

[33]  Paul G. Spirakis,et al.  Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications , 2015, FOCS.