Modifying optimal SAT-based approach to multi-agent path-finding problem to suboptimal variants

Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations


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.

Original languageEnglish
Number of pages2
StatePublished - 1 Jan 2017
Event10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States
Duration: 16 Jun 201717 Jun 2017


Conference10th Annual Symposium on Combinatorial Search, SoCS 2017
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this