Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.
SOCS(2017)
摘要
Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this research area, numerous diverse search-based techniques were developed in the past 6 years for optimally solving MAPF under the sum-of-costs objective function. In this paper we survey these techniques, while placing them into the wider context of the MAPF field of research. Finally, we provide analytical and experimental comparisons that show that no algorithm dominates all others in all circumstances. We conclude by listing important future research directions.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络