Multi-Agent Path Finding - An Overview
Multi-Agent Path Finding - An Overview
复制标题
多代理路径查找 - 概述
DOI：
10.1007/978-3-030-33274-7_6
复制
发表时间：
2019
影响因子：
0.2
通讯作者：
Roni Stern
中科院分区：
文献类型：
--
作者：
Roni Stern
多智能体寻路（MAPF）是为多个智能体寻找路径的问题，使得每个智能体都能到达它的目标，并且智能体之间不会发生冲突。近年来，人工智能（AI）研究界对MAPF的兴趣越来越大。这种兴趣部分是因为现实世界的MAPF应用程序，如仓库管理，多机器人团队和飞机管理，变得越来越普遍。在本概述中，我们讨论了MAPF问题的几种可能的定义。然后，我们调查MAPF算法，从快速但不完整的算法，然后快速，完整，但不是最佳的算法，最后是最佳的算法。然后，我们描述了近似最优算法，并得出结论，与非经典的MAPF和指针，为未来的阅读和未来的工作。
Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. In recent years, there has been a growing interest in MAPF in the Artificial Intelligence (AI) research community. This interest is partially because real-world MAPF applications, such as warehouse management, multi-robot teams, and aircraft management, are becoming more prevalent. In this overview, we discuss several possible definitions of the MAPF problem. Then, we survey MAPF algorithms, starting with fast but incomplete algorithms, then fast, complete but not optimal algorithms, and finally optimal algorithms. Then, we describe approximately optimal algorithms and conclude with non-classical MAPF and pointers for future reading and future work.
大型代理的多代理路径查找
DOI：
--
发表时间：
2019
期刊：
Proceedings of the AAAI Conference on Artificial Intelligence (AAAI
影响因子：
--
作者：
Li, J.;Surynek, P.;Felner, A.;Ma, H.;Kumar, S.;Koenig, S.
通讯作者：
Koenig, S.