Multi-agent path finding (part B)

• Main Author: Cao, Lifeng
• Other Authors: Tang Xueyan
• Format: Final Year Project
• Language: English
• Published: Nanyang Technological University 2020
• Subjects: Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
• Online Access: https://hdl.handle.net/10356/138110
• Institution: Nanyang Technological University

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...