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

基于一致优先级的多Agent路径搜索

Searching with Consistent Prioritization for Multi-Agent Path Finding

University of Southern California(南加州大学);Monash University(莫纳什大学)

Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig

摘要:

我们研究了多智能体路径搜索(MAPF)的优先规划。现有的优先级MAPF算法依赖于经验法则和随机分配,以确定一个固定的总优先级排序的所有代理先验。相反,我们探索空间的所有可能的部分优先级排序的一部分,一个新的系统和冲突驱动的组合搜索框架。在各种实证比较中,我们展示了最先进的解决方案质量和成功率,通常与现有算法具有相似的运行时间。我们还开发了新的理论成果,探索优先规划的局限性,在完整性和最优性方面,首次。

英文摘要:

We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed total priority ordering of all agents a priori. We instead explore the space of all possible partial priority orderings as part of a novel systematic and conflict-driven combinatorial search framework. In a variety of empirical comparisons, we demonstrate state-of-the-art solution qualities and success rates, often with similar runtimes to existing algorithms. We also develop new theoretical results that explore the limitations of prioritized planning, in terms of completeness and optimality, for the first time.

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

↑