Published in: LIPIcs, Volume 322, 35th International Symposium on Algorithms and Computation (ISAAC 2024)
Sándor P. Fekete, Ramin Kosfeld, Peter Kramer, Jonas Neutzner, Christian Rieck, and Christian Scheffer. Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain. In 35th International Symposium on Algorithms and Computation (ISAAC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 322, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fekete_et_al:LIPIcs.ISAAC.2024.29, author = {Fekete, S\'{a}ndor P. and Kosfeld, Ramin and Kramer, Peter and Neutzner, Jonas and Rieck, Christian and Scheffer, Christian}, title = {{Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain}}, booktitle = {35th International Symposium on Algorithms and Computation (ISAAC 2024)}, pages = {29:1--29:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-354-6}, ISSN = {1868-8969}, year = {2024}, volume = {322}, editor = {Mestre, Juli\'{a}n and Wirth, Anthony}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2024.29}, URN = {urn:nbn:de:0030-drops-221565}, doi = {10.4230/LIPIcs.ISAAC.2024.29}, annote = {Keywords: multi-agent path finding, coordinated motion planning, bounded stretch, makespan, swarm robotics, reconfigurability, parallel sorting} }
Feedback for Dagstuhl Publishing