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

多智能体走廊生成算法

Multi-Agent Corridor Generating Algorithm

Arseniy Pertzovsky, Roni Stern, Roie Zivan, Ariel Felner

AI总结:

提出MACGA及MACGA+PIBT算法,通过构建走廊并疏散其他智能体解决密集多智能体路径规划问题,具有多项式时间和可达性,实验证明在成功率、运行时间和完工时间上优于基线。

摘要:

在本文中,我们提出了多智能体走廊生成算法(MACGA)来解决多智能体路径规划(MAPF)问题,在该问题中,一组智能体需要找到通往各自目标位置的无碰撞路径。现有方法难以解决密集的MAPF实例。在MACGA中,智能体从当前位置向智能体目标构建“走廊”,即连接顶点的序列,并将其他智能体疏散出走廊以避免碰撞和死锁。我们还提出了MACGA+PIBT算法,该算法将众所周知的基于规则的PIBT算法集成到MACGA中,以提高运行时间和解的质量。所提出的算法以多项式时间运行,并具有可达性属性,即每个智能体保证在某个时刻到达其目标位置。我们通过实验证明,在多种MAPF基准网格上,MACGA和MACGA+PIBT在成功率、运行时间和完工时间方面优于基线算法。

英文摘要:

In this paper, we propose the Multi-Agent Corridor Generating Algorithm (MACGA) for solving the Multi-agent Pathfinding (MAPF) problem, where a group of agents need to find non-colliding paths to their target locations. Existing approaches struggle to solve dense MAPF instances. In MACGA, the agents build \emph{corridors}, which are sequences of connected vertices, from current locations towards agents' goals, and evacuate other agents out of the corridors to avoid collisions and deadlocks. We also present the MACGA+PIBT algorithm, which integrates the well-known rule-based PIBT algorithm into MACGA to improve runtime and solution quality. The proposed algorithms run in polynomial time and have a reachability property, i.e., every agent is guaranteed to reach its goal location at some point. We demonstrate experimentally that MACGA and MACGA+PIBT outperform baseline algorithms in terms of success rate, runtime, and makespan across diverse MAPF benchmark grids.

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

↑