Sub-optimal SAT-based approach to multi-agent path-finding problem

Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

In multi-agent path finding (MAPF) the task is to find nonconflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sumof- costs variant. Recently, a SAT-based approached was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we present SAT-based unbounded- and boundedsuboptimal algorithms and compare them to relevant algorithms. Experimental results show that in many case the SAT-based solver significantly outperforms the search-based solvers.

Original languageEnglish
Title of host publicationProceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018
EditorsVadim Bulitko, Sabine Storandt
PublisherAAAI press
Pages99-105
Number of pages7
ISBN (Electronic)9781577358022
StatePublished - 1 Jan 2018
Event11th International Symposium on Combinatorial Search, SoCS 2018 - Stockholm, Sweden
Duration: 14 Jul 201815 Jul 2018

Publication series

NameProceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018

Conference

Conference11th International Symposium on Combinatorial Search, SoCS 2018
Country/TerritorySweden
CityStockholm
Period14/07/1815/07/18

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Sub-optimal SAT-based approach to multi-agent path-finding problem'. Together they form a unique fingerprint.

Cite this