Multi-agent path finding (part B)

• المؤلف الرئيسي: Cao, Lifeng
• مؤلفون آخرون: Tang Xueyan
• التنسيق: Final Year Project
• اللغة: English
• منشور في: Nanyang Technological University 2020
• الموضوعات: Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/138110
• المؤسسة: 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 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.