arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.02763cs.AI
收藏

解决任意角度或角度受限网格路径集合中的时空冲突

Resolving Spatial-Time Conflicts In A Set Of Any-angle Or Angle-constrained Grid Paths

Peoples’ Friendship University of Russia(俄罗斯人民友谊大学)

Konstantin Yakovlev, Anton Andreychuk

摘要:

我们研究了多智能体路径寻找问题(MAPF)的一组代理,允许移动到任意方向上的二维正方形网格。我们专注于独立计算计划的集中冲突解决方案。我们提出了一个算法,通过使用本地重新规划,并引入时间偏移的路径由不同的代理执行,以消除冲突。实验结果表明,该算法能以较低的计算代价找到高质量的无冲突解。

英文摘要:

We study the multi-agent path finding problem (MAPF) for a group of agents which are allowed to move into arbitrary directions on a 2D square grid. We focus on centralized conflict resolution for independently computed plans. We propose an algorithm that eliminates conflicts by using local re-planning and introducing time offsets to the execution of paths by different agents. Experimental results show that the algorithm can find high quality conflict-free solutions at low computational cost.

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

↑