Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs

This paper addresses make span optimal solving of cooperative path-finding problem (CPF) by translating it to propositional satisfiability (SAT). The task is to relocate set of agents to given goal positions so that they do not collide with each other. A novel SAT encoding of CPF is suggested. The novel encoding uses the concept of matching in a bipartite graph to separate spatial constraint of CPF from consideration of individual agents. The separation allowed reducing the size of encoding significantly. The conducted experimental evaluation shown that novel encoding can be solved faster than existing encodings for CPF and also that the SAT based methods dominates over A* based methods in environment densely occupied by agents.

[1]  Roni Stern,et al.  The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding , 2011, IJCAI.

[2]  Yixin Chen,et al.  A Novel Transition Based Encoding Scheme for Planning as Satisfiability , 2010, AAAI.

[3]  David Silver,et al.  Cooperative Pathfinding , 2005, AIIDE.

[4]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[5]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[6]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[7]  Manfred K. Warmuth,et al.  Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable , 1986, AAAI.

[8]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[9]  Kostas E. Bekris,et al.  Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees , 2011, IJCAI.

[10]  Cees Witteveen,et al.  Push and rotate: cooperative multi-agent path planning , 2013, AAMAS.

[11]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[12]  Richard E. Korf,et al.  Complete Algorithms for Cooperative Pathfinding Problems , 2011, IJCAI.

[13]  Pavel Surynek.  On Propositional Encodings of Cooperative Path-Finding , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[14]  Richard E. Korf,et al.  Finding Optimal Solutions to the Twenty-Four Puzzle , 1996, AAAI/IAAI, Vol. 2.

[15]  Malcolm Ross Kinsella Ryan.  Exploiting Subgraph Structure in Multi-Robot Path Planning , 2008, J. Artif. Intell. Res..

[16]  Pavel Surynek,et al.  Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving , 2012, PRICAI.

[17]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[18]  Ilkka Niemelä,et al.  Planning as satisfiability: parallel plans and algorithms for plan search , 2006, Artif. Intell..

[19]  Manuel Cebrián,et al.  Channeling Constraints and Value Ordering in the QuasiGroup Completion Problem , 2003, IJCAI.

[20]  Magnus Björk,et al.  Successful SAT Encoding Techniques , 2009, J. Satisf. Boolean Model. Comput..

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

[22]  Adi Botea,et al.  MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees , 2011, J. Artif. Intell. Res..