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

基于图的多机器人最优路径规划:结构与计算复杂性

Optimal Multi-Robot Path Planning on Graphs: Structure and Computational Complexity

Massachusetts Institute of Technology(麻省理工学院);University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)

Jingjin Yu, Steven M. LaValle

摘要:

我们研究了图上的最优多机器人路径规划问题(MPP)在四个不同的最小化目标:总到达时间,最大完工时间(最后到达时间),总距离,最大(单机器人行驶)距离。在结构方面,我们表明,这四个目标的每一对诱导帕累托前沿,并不能总是同时优化。然后,通过从3-SAT的减少,我们进一步建立了每个目标的计算是一个NP-难的任务,提供的证据表明,最佳地解决MPP通常是棘手的。尽管如此,在一篇相关论文中,我们设计了完整的算法和有效的算法来优化所有四个目标,能够在具有挑战性的设置中为数百个机器人最佳或接近最佳地解决MPP。

英文摘要:

We study the problem of optimal multi-robot path planning on graphs (MPP) over four distinct minimization objectives: the total arrival time, the makespan (last arrival time), the total distance, and the maximum (single-robot traveled) distance. On the structure side, we show that each pair of these four objectives induces a Pareto front and cannot always be optimized simultaneously. Then, through reductions from 3-SAT, we further establish that computation over each objective is an NP-hard task, providing evidence that solving MPP optimally is generally intractable. Nevertheless, in a related paper, we design complete algorithms and efficient heuristics for optimizing all four objectives, capable of solving MPP optimally or near-optimally for hundreds of robots in challenging setups.

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

↑