Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/156697
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAng, Yong Xinen_US
dc.date.accessioned2022-04-22T06:49:14Z-
dc.date.available2022-04-22T06:49:14Z-
dc.date.issued2022-
dc.identifier.citationAng, Y. X. (2022). Multi-agent path finding (D). Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/156697en_US
dc.identifier.urihttps://hdl.handle.net/10356/156697-
dc.description.abstractMulti-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.en_US
dc.language.isoenen_US
dc.publisherNanyang Technological Universityen_US
dc.relationSCSE21-0113en_US
dc.subjectEngineering::Computer science and engineeringen_US
dc.titleMulti-agent path finding (D)en_US
dc.typeFinal Year Project (FYP)en_US
dc.contributor.supervisorTang Xueyanen_US
dc.contributor.schoolSchool of Computer Science and Engineeringen_US
dc.description.degreeBachelor of Engineering (Computer Science)en_US
dc.contributor.supervisoremailASXYTang@ntu.edu.sgen_US
item.grantfulltextrestricted-
item.fulltextWith 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.