@inproceedings{5d09b8572d5847c597add0275a546c07,
title = "An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives",
abstract = "In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, existing makespan optimal SAT-based solvers for MAPF have been modified for the sum-of-costs objective. In this paper, we empirically compare the hardness of solving MAPF with SAT-based and search-based solvers under the makespan and the sum-of-costs objectives in a number of domains. The experimental evaluation shows that MAPF under the makespan objective is easier across all the tested solvers and domains.",
author = "Pavel Surynek and Ariel Felner and Roni Stern and Eli Boyarski",
note = "Publisher Copyright: Copyright {\textcopyright} 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 9th Annual Symposium on Combinatorial Search, SoCS 2016 ; Conference date: 06-07-2016 Through 08-07-2016",
year = "2016",
month = jan,
day = "1",
language = "الإنجليزيّة",
series = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",
pages = "145--146",
editor = "Baier, {Jorge A.} and Adi Botea",
booktitle = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",
}