良构网络结构中的多机器人路径规划:优先规划与优先等待调整(初步结果)
Multi-robot Path Planning in Well-formed Infrastructures: Prioritized Planning vs. Prioritized Wait Adjustment (Preliminary Results)
摘要:
研究了一类同质机器人的无碰撞路径规划问题。我们提出了一种新的方法,用于将机器人自我中心地规划的路径,例如,不考虑其他机器人的移动,变成无碰撞的轨迹,并根据经验进行评估。建议的算法比最先进的算法快得多(高达一个数量级),但这是以解决方案成本显著下降为代价的。
英文摘要:
We study the problem of planning collision-free paths for a group of homogeneous robots. We propose a novel approach for turning the paths that were planned egocentrically by the robots, e.g. without taking other robots' moves into account, into collision-free trajectories and evaluate it empirically. Suggested algorithm is much faster (up to one order of magnitude) than state-of-the-art but this comes at the price of notable drop-down of the solution cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。