Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/156697
Title: Multi-agent path finding (D)
Authors: Ang, Yong Xin
Keywords: Engineering::Computer science and engineering
Issue Date: 2022
Publisher: Nanyang Technological University
Source: Ang, Y. X. (2022). Multi-agent path finding (D). Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/156697
Project: SCSE21-0113
Abstract: 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.
URI: https://hdl.handle.net/10356/156697
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
ANGYONGXIN_U1821708G_AMMENDED_FINAL_REPORT.pdf
  Restricted Access
1.46 MBAdobe PDFView/Open

Page view(s)

23
Updated on Jun 28, 2022

Download(s)

8
Updated on Jun 28, 2022

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.