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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/138110 |
| _version_ | 1824453960612708352 |
|---|---|
| author | Cao, Lifeng |
| author2 | Tang Xueyan |
| author_facet | Tang Xueyan Cao, Lifeng |
| author_sort | Cao, Lifeng |
| collection | NTU |
| description | 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. |
| first_indexed | 2025-02-19T03:14:43Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/138110 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2025-02-19T03:14:43Z |
| publishDate | 2020 |
| publisher | Nanyang Technological University |
| record_format | dspace |
| spelling | ntu-10356/1381102020-04-24T07:01:10Z Multi-agent path finding (part B) Cao, Lifeng Tang Xueyan School of Computer Science and Engineering ASXYTang@ntu.edu.sg Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity 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. Bachelor of Engineering (Computer Science) 2020-04-24T06:56:14Z 2020-04-24T06:56:14Z 2020 Final Year Project (FYP) https://hdl.handle.net/10356/138110 en application/pdf Nanyang Technological University |
| spellingShingle | Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity Cao, Lifeng Multi-agent path finding (part B) |
| title | Multi-agent path finding (part B) |
| title_full | Multi-agent path finding (part B) |
| title_fullStr | Multi-agent path finding (part B) |
| title_full_unstemmed | Multi-agent path finding (part B) |
| title_short | Multi-agent path finding (part B) |
| title_sort | multi agent path finding part b |
| topic | Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity |
| url | https://hdl.handle.net/10356/138110 |
| work_keys_str_mv | AT caolifeng multiagentpathfindingpartb |