License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2021.63
URN: urn:nbn:de:0030-drops-138622
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13862/
Crombez, Loïc ;
da Fonseca, Guilherme D. ;
Gerard, Yan ;
Gonzalez-Lorenzo, Aldo ;
Lafourcade, Pascal ;
Libralesso, Luc
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge)
Abstract
This paper describes the heuristics used by the Shadoks team for the CG:SHOP 2021 challenge on motion planning. Using the heuristics outlined in this paper, our team won first place with the best solution to 202 out of 203 instances and optimal solutions to at least 105 of them.
BibTeX - Entry
@InProceedings{crombez_et_al:LIPIcs.SoCG.2021.63,
author = {Crombez, Lo\"{i}c and da Fonseca, Guilherme D. and Gerard, Yan and Gonzalez-Lorenzo, Aldo and Lafourcade, Pascal and Libralesso, Luc},
title = {{Shadoks Approach to Low-Makespan Coordinated Motion Planning}},
booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)},
pages = {63:1--63:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-184-9},
ISSN = {1868-8969},
year = {2021},
volume = {189},
editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13862},
URN = {urn:nbn:de:0030-drops-138622},
doi = {10.4230/LIPIcs.SoCG.2021.63},
annote = {Keywords: heuristics, motion planning, digital geometry, shortest path}
}
