Multi-agent path finding (part B)

Multi-Agent Pathfinding (MAPF) is the problem of finding paths efficient collision-free paths for sets of agents with a designated start and end goal. This project aims to implement and evaluate the algorithms suitable for the MAPF problem in real-time with the involvement of a waypoint. In the proj...

全面介紹

Saved in:
書目詳細資料
主要作者: Cao, Lifeng
其他作者: Tang Xueyan
格式: Final Year Project
語言:English
出版: Nanyang Technological University 2020
主題:
在線閱讀:https://hdl.handle.net/10356/138110
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English
實物特徵
總結:Multi-Agent Pathfinding (MAPF) is the problem of finding paths efficient collision-free paths for sets of agents with a designated start and end goal. This project aims to implement and evaluate the algorithms suitable for the MAPF problem in real-time with the involvement of a waypoint. In the project, the agents will be passing through waypoints before they reach from start node to goal node. Therefore, common MAPF algorithms such as A* algorithm and Conflict Based Search(CBS) will be used to evaluate using varies cost functions. Experimental results will also be compared between various existing algorithms to access the performance of these algorithms.