arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.11252cs.ROcs.MA
收藏

在多智能体路径规划中引入延迟

Introducing Delays in Multi-Agent Path Finding

University of Colorado Boulder(科罗拉多大学博尔德分校);Tel Aviv University(特拉维夫大学);Technion(以色列理工学院)

Justin Kottinger, Tzvika Geft, Shaull Almagor, Oren Salzman, Morteza Lahijanian

AI总结:

针对多智能体路径规划中执行时部分智能体发生延迟的问题,提出延迟引入方法,通过让额外智能体延迟以安全执行剩余规划,并证明其理论复杂度的同时验证了基于冲突的搜索在实际应用中优于重新规划启发式算法。

摘要:

我们考虑一个多智能体路径规划(MAPF)场景,其中智能体已被分配了规划,但在执行期间部分智能体会发生延迟。当出现此类延迟时,我们提出延迟引入方法,而不是从头重新规划,即我们让一些额外的智能体也延迟,以便规划的剩余部分能够安全执行。我们证明,寻找最少数量的额外延迟是 APX-Hard 的,即对于某些 $\varepsilon>0$,找到 $(1+\varepsilon)$-近似解是 NP-Hard 的。然而,在实际中,我们可以使用基于冲突的搜索为大量智能体找到最优的延迟引入方案,且规划时间和生成的规划长度与最先进的重新规划启发式算法相当,有时甚至表现更优。

英文摘要:

We consider a Multi-Agent Path Finding (MAPF) setting where agents have been assigned a plan, but during its execution some agents are delayed. Instead of replanning from scratch when such a delay occurs, we propose delay introduction, whereby we delay some additional agents so that the remainder of the plan can be executed safely. We show that finding the minimum number of additional delays is APX-Hard, i.e., it is NP-Hard to find a $(1+\varepsilon)$-approximation for some $\varepsilon>0$. However, in practice we can find optimal delay-introductions using Conflict-Based Search for very large numbers of agents, and both planning time and the resulting length of the plan are comparable, and sometimes outperform the state-of-the-art heuristics for replanning.

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

↑