arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.08291cs.AIcs.MAcs.RO
收藏

多智能体寻路:定义、变体和基准

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

Ben Gurion University of the Negev(内盖夫本-古里安大学);University of Alberta(阿尔伯塔大学);USC(南加州大学);University of Denver(丹佛大学);Charles University(查理大学)

Roni Stern, Nathan Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Bartak

摘要:

MAPF问题是为多个代理规划路径的基本问题,其中的关键约束是代理将能够同时遵循这些路径而不会相互冲突。MAPF的应用包括自动化仓库和自动驾驶汽车。近几年来,MAPF的研究得到了蓬勃发展。不同的MAPF研究论文做出了不同的假设,例如,智能体是否可以在同一时间穿越同一条道路,并具有不同的目标函数,例如,最小化完工时间或代理人的行动成本之和。这些假设和目标有时是隐含的假设或非正式的描述。这使得难以在研究论文中建立适当的比较基线,也使得从业人员难以找到与其具体应用相关的论文。本文旨在填补这一空白,并支持研究人员和从业人员提供一个统一的术语来描述常见的MAPF假设和目标。此外,我们还提供了两个MAPF基准的指针。特别是,我们引入了一个新的基于网格的基准MAPF,并通过实验证明,它构成了当代MAPF算法的挑战。

英文摘要:

The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently without colliding with each other. Applications of MAPF include automated warehouses and autonomous vehicles. Research on MAPF has been flourishing in the past couple of years. Different MAPF research papers make different assumptions, e.g., whether agents can traverse the same road at the same time, and have different objective functions, e.g., minimize makespan or sum of agents' actions costs. These assumptions and objectives are sometimes implicitly assumed or described informally. This makes it difficult to establish appropriate baselines for comparison in research papers, as well as making it difficult for practitioners to find the papers relevant to their concrete application. This paper aims to fill this gap and support researchers and practitioners by providing a unifying terminology for describing common MAPF assumptions and objectives. In addition, we also provide pointers to two MAPF benchmarks. In particular, we introduce a new grid-based benchmark for MAPF, and demonstrate experimentally that it poses a challenge to contemporary MAPF algorithms.

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

↑