###
计算机系统应用英文版:2026,35(1):1-18
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
多智能体路径规划研究综述
(1.南京信息工程大学 软件学院, 南京 210044;2.中国科学院大学南京学院, 南京 211135;3.中国科学院 软件研究所, 北京 100190)
Review of Multi-agent Path Finding
(1.School of Software, Nanjing University of Information Science and Technology, Nanjing 210044, China;2.University of Chinese Academy of Sciences, Nanjing, Nanjing 211135, China;3.Institute of Software, Chinese Academy of Sciences, Beijing 100190, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1453次   下载 952
Received:July 16, 2025    Revised:August 13, 2025
中文摘要: 多智能体路径规划(multi-agent path finding, MAPF)旨在为多个智能体规划无冲突路径以优化协同任务性能. 本文综述了MAPF的研究现状, 涵盖算法分类、应用场景和未来趋势, 并探讨了其在大规模动态环境中的挑战. 首先, 本文详细介绍了MAPF的定义; 接着, 分类总结了基于搜索、智能仿生、采样及强化学习的路径规划算法; 最后, 分析了各类算法的优缺点及适用场景. 本文旨在帮助研究者了解MAPF技术的发展现状及未来方向, 推动相关研究进展.
Abstract:Multi-agent path finding (MAPF) aims to plan conflict-free paths for multiple agents to optimize collaborative task performance. This study reviews the current state of MAPF research, including algorithm classification, application scenarios, and future trends, while discussing the challenges in large-scale dynamic environments. First, the study provides a detailed introduction to the definition of MAPF. Then, it categorizes and summarizes path planning algorithms based on search, bio-inspired methods, sampling, and reinforcement learning. Finally, the study analyzes the advantages and disadvantages of each algorithm and their applicable scenarios. This review aims to help researchers understand the current developments and future directions of MAPF technology, and to promote further progress in this field.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(62002350); 电子数据取证系列产品研发及产业化项目(2020AG007)
引用文本:
张浩珂,丁丽萍,张珩.多智能体路径规划研究综述.计算机系统应用,2026,35(1):1-18
ZHANG Hao-Ke,DING Li-Ping,ZHANG Heng.Review of Multi-agent Path Finding.COMPUTER SYSTEMS APPLICATIONS,2026,35(1):1-18