arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.13956cs.CGcs.RO
收藏

基于Shadoks方法的低制造跨度协调运动规划

Shadoks Approach to Low-Makespan Coordinated Motion Planning

LIMOS, Université Clermont Auvergne(克莱蒙奥弗涅大学利摩斯实验室);LIS, Aix-Marseille Université(艾克斯-马赛大学信息与系统科学实验室)

Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso

摘要:

本文介绍了Shadoks团队在CG:SHOP 2021挑战赛中使用的策略。今年的问题是协调多个机器人的运动,以便在没有碰撞的情况下到达目标,并最大限度地减少完工时间。这是一个经典的多智能体路径寻找问题,其特殊性在于,在无界网格中的实例是高度密集的。使用本文中概述的算法,我们的团队赢得了203个实例中202个实例的最佳解决方案和至少105个实例的最佳解决方案的第一名。主要成分包括几种不同的策略来计算初始解决方案,再加上一个启发式称为冲突优化,以减少现有的解决方案的完工时间。

英文摘要:

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. It is a classical multi agent path finding problem with the specificity that the instances are highly dense in an unbounded grid. 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. The main ingredients include several different strategies to compute initial solutions coupled with a heuristic called Conflict Optimizer to reduce the makespan of existing solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑