@inproceedings{07ab4df27a1d4846a5bbe8adf6632bc1,
title = "Moving agents in formation in congested environments",
abstract = "We study the Moving Agents in Formation problem, that combines the tasks of finding short collision-free paths for multiple agents and keeping them in close adherence to a desired formation. We develop a two-phase complete algorithm, called SWARM-MAPF, whose first phase is inspired by swarm-based algorithms (in open regions) and whose second phase is inspired by multi-agent path finding algorithms (in congested regions). Empirically, we show that SWARMMAPF scales well and finds close-to-optimal solutions.",
author = "Jiaoyang Li and Kexuan Sun and Hang Ma and Ariel Felner and Kumar, \{T. K.Satish\} and Sven Koenig",
note = "Publisher Copyright: {\textcopyright} 2020 Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020. All rights reserved.; 13th International Symposium on Combinatorial Search, SoCS 2020 ; Conference date: 26-05-2020 Through 28-05-2020",
year = "2020",
month = jan,
day = "1",
language = "الإنجليزيّة",
series = "Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020",
publisher = "The AAAI Press",
pages = "131--132",
editor = "Daniel Harabor and Mauro Vallati",
booktitle = "Proceedings of the 13th International Symposium on Combinatorial Search, SoCS 2020",
}