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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | Final Year Project |
| اللغة: | English |
| منشور في: |
Nanyang Technological University
2022
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://hdl.handle.net/10356/156697 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Nanyang Technological University |
| اللغة: | English |
| الملخص: | 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. |
|---|