@inproceedings{b31673d6a7ae4496982f22a3f6e9a5f2,
title = "Sub-optimal SAT-based approach to multi-agent path-finding problem",
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.",
author = "Pavel Surynek and Ariel Felner and Roni Stern and Eli Boyarski",
note = "Publisher Copyright: {\textcopyright} 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 11th International Symposium on Combinatorial Search, SoCS 2018 ; Conference date: 14-07-2018 Through 15-07-2018",
year = "2018",
month = jan,
day = "1",
language = "English",
series = "Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018",
publisher = "AAAI press",
pages = "99--105",
editor = "Vadim Bulitko and Sabine Storandt",
booktitle = "Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018",
}