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:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2022
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/156697 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | 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. |
|---|