Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. Surynek, P., Felner, A., Stern, R., & Boyarski, E. In Proceedings of the Symposium on Combinatorial Search (SoCS), pages 169–170, 2017.
abstract   bibtex   
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.
@INPROCEEDINGS{AFeln17e, 
 AUTHOR= "P. Surynek and A. Felner and R. Stern and E. Boyarski",
 TITLE= "Modifying Optimal {SAT}-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants",
 BOOKTITLE= "Proceedings of the Symposium on Combinatorial Search (SoCS)",
 PAGES= "169--170",
 YEAR= "2017",
 PDF= "https://static.wixstatic.com/ugd/749b4b_f28d63b09e5546479f1f541f19804681.pdf",
 FLAGS= ":2017:,:arielfelner:,:ronistern:,:eliboyarski:,:pavelsurynek:",
 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."
}

Downloads: 0