强连通有向图上的多智能体路径寻找:可行性与求解算法
Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
AI总结:
针对强连通有向图上的 MAPF 问题,论文将既有无向图和双连通有向图算法推广到更一般情形,并为至少有两个洞的问题提出线性可行性检查与多项式可行解构造算法。
摘要:
在给定图上,多智能体路径寻找(Multi-Agent Pathfinding,MAPF)问题在于为多个智能体寻找路径,同时避免碰撞。寻找最短长度的解已知是 NP 难的,并且计算时间随智能体数量呈指数增长。然而,在工业应用中,重要的是在随智能体数量多项式增长的时间内找到可行的次优解。此类算法已存在于无向图和双连通有向图中。我们的主要贡献是将这些算法推广到更一般的强连通有向图情形。具体而言,给定一个至少有两个洞的 MAPF 问题,我们提出一种算法,可在相对于节点数量的线性时间内检查问题可行性,并在多项式时间内提供一个可行解。
英文摘要:
On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known to be NP-hard, and computation times grows exponentially with the number of agents. However, in industrial applications, it is important to find feasible, suboptimal solutions, in a time that grows polynomially with the number of agents. Such algorithms exist for undirected and biconnected directed graphs. Our main contribution is to generalize these algorithms to the more general case of strongly connected directed graphs. In particular, given a MAPF problem with at least two holes, we present an algorithm that checks the problem feasibility in linear time with respect to the number of nodes, and provides a feasible solution in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。