AAAI Publications, Tenth Annual Symposium on Combinatorial Search

Font Size: 
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski

Last modified: 2017-06-05

Abstract


In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, a SAT-based approach was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we introduce SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant search-based algorithms.

Full Text: PDF