2026-07-24T00:34:30Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13862 2024-03-06T10:52:54Z ddc:004 open_access

Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge) Crombez, Loïc da Fonseca, Guilherme D. Gerard, Yan Gonzalez-Lorenzo, Aldo Lafourcade, Pascal Libralesso, Luc heuristics motion planning digital geometry shortest path 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Loïc Crombez and Guilherme D. da Fonseca and Yan Gerard and Aldo Gonzalez-Lorenzo and Pascal Lafourcade and Luc Libralesso 2021 Is Part Of LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2021.63 urn:nbn:de:0030-drops-138622 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.63 eng https://creativecommons.org/licenses/by/4.0/legalcode