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: | Ang, Yong Xin |
---|---|
Other Authors: | Tang Xueyan |
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 |
Similar Items
-
Multi-agent path finding
by: Jia, Xiaochen
Published: (2021) -
Multi-agent path finding
by: Feng, Qingyu
Published: (2023) -
Multi-agent path finding
by: Wang, Xiaoyu
Published: (2021) -
Multi-agent path finding visualizer
by: Tran, Anh Tai
Published: (2022) -
Multi-agent path finding (part C)
by: Chua, Wen Kai
Published: (2020)