This paper describes the heuristics used by the Shadoks team for the CG:SHOP 2021 challenge. This year's problem is to coordinate the motion of multiple robots in order to reach their targets without collisions and minimizing the makespan. 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.
翻译:本文描述了Shadoks团队在CG:SHOP 2021挑战中使用的超自然论。 今年的问题是协调多个机器人的运动,以便不发生碰撞地达到目标,并尽可能减少黑桃。 使用本文概述的超自然论,我们的团队以203例中的202例的最佳解决方案和至少105例中的最佳解决方案为首。