Multi-agent path finding (D)
Multi-Agent Path Finding algorithm has always been a hot topic in the field of Artificial Intelligence. Single-agent path-finding algorithms such as A* algorithm is unable to provide an optimal solution in the multi-agent path-finding problem. In this project, we use an algorithm, called the C...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2022
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/156697 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| id |
sg-ntu-dr.10356-156697 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-1566972022-04-22T06:49:14Z Multi-agent path finding (D) Ang, Yong Xin Tang Xueyan School of Computer Science and Engineering ASXYTang@ntu.edu.sg Engineering::Computer science and engineering Multi-Agent Path Finding algorithm has always been a hot topic in the field of Artificial Intelligence. Single-agent path-finding algorithms such as A* algorithm is unable to provide an optimal solution in the multi-agent path-finding problem. In this project, we use an algorithm, called the Conflict-Based Search algorithm (CBS), aiming to find an optimal path for multi-agent pathfinding problems in grid maps of different dimensions. Our experiments show that the algorithm performs better than A* + OD algorithm as the number of agent increase. Bachelor of Engineering (Computer Science) 2022-04-22T06:49:14Z 2022-04-22T06:49:14Z 2022 Final Year Project (FYP) Ang, Y. X. (2022). Multi-agent path finding (D). Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/156697 https://hdl.handle.net/10356/156697 en SCSE21-0113 application/pdf Nanyang Technological University |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
Engineering::Computer science and engineering |
| spellingShingle |
Engineering::Computer science and engineering Ang, Yong Xin Multi-agent path finding (D) |
| description |
Multi-Agent Path Finding algorithm has always been a hot topic in the field of
Artificial Intelligence. Single-agent path-finding algorithms such as A* algorithm is unable
to provide an optimal solution in the multi-agent path-finding problem. In this project, we use
an algorithm, called the Conflict-Based Search algorithm (CBS), aiming to find an optimal
path for multi-agent pathfinding problems in grid maps of different dimensions. Our
experiments show that the algorithm performs better than A* + OD algorithm as the number
of agent increase. |
| author2 |
Tang Xueyan |
| author_facet |
Tang Xueyan Ang, Yong Xin |
| format |
Final Year Project |
| author |
Ang, Yong Xin |
| author_sort |
Ang, Yong Xin |
| title |
Multi-agent path finding (D) |
| title_short |
Multi-agent path finding (D) |
| title_full |
Multi-agent path finding (D) |
| title_fullStr |
Multi-agent path finding (D) |
| title_full_unstemmed |
Multi-agent path finding (D) |
| title_sort |
multi-agent path finding (d) |
| publisher |
Nanyang Technological University |
| publishDate |
2022 |
| url |
https://hdl.handle.net/10356/156697 |
| _version_ |
1731235791053520896 |