Multi-agent path finding (part C)

Multi-agent path-finding is about the development and evaluation of algorithms and techniques to find high-quality collision-free paths for teams of agents to reach their target locations in real-time with consideration of various types of constraints. In order to ease the formulation of the path-f...

Full description

Bibliographic Details
Main Author: Chua, Wen Kai
Other Authors: Tang Xueyan
Format: Final Year Project (FYP)
Language:English
Published: Nanyang Technological University 2020
Subjects:
Online Access:https://hdl.handle.net/10356/137985
_version_ 1826120718345043968
author Chua, Wen Kai
author2 Tang Xueyan
author_facet Tang Xueyan
Chua, Wen Kai
author_sort Chua, Wen Kai
collection NTU
description Multi-agent path-finding is about the development and evaluation of algorithms and techniques to find high-quality collision-free paths for teams of agents to reach their target locations in real-time with consideration of various types of constraints. In order to ease the formulation of the path-finding problem at hand and present its solution calculated, the scope of this project focuses on the development of an application that allows the users to have a graphical user interface to mimic the different path-finding problems and have the in-built algorithms to calculate the solutions. The application is written in Java and uses the Java Agent DEvelopment (JADE) framework to support the management of agents. Next, the graphical user interface uses JavaFX to present the user with a unique and simple look and feel that cannot be achieved with Java Swing. JavaScript Object Notation (JSON) is the chosen format for data exchanges between the internal files and the server which hosts the various algorithms. The application primarily uses the Model-View-Controller (MVC) design pattern for its architectural design as recommended by Oracle when integrating JavaFX into applications. Additionally, the software lifecycle follows the Agile methodology as it allows the constant delivery of the application in small amounts and any changes that may arise to be made. The result is a simple and functional graphical application that performs the intended purpose written in its functional requirements and can be scaled to include more complex scenarios and path-finding algorithms in the future.
first_indexed 2024-10-01T05:20:54Z
format Final Year Project (FYP)
id ntu-10356/137985
institution Nanyang Technological University
language English
last_indexed 2024-10-01T05:20:54Z
publishDate 2020
publisher Nanyang Technological University
record_format dspace
spelling ntu-10356/1379852020-04-21T04:15:52Z Multi-agent path finding (part C) Chua, Wen Kai Tang Xueyan School of Computer Science and Engineering asxytang@ntu.edu.sg Engineering::Computer science and engineering Multi-agent path-finding is about the development and evaluation of algorithms and techniques to find high-quality collision-free paths for teams of agents to reach their target locations in real-time with consideration of various types of constraints. In order to ease the formulation of the path-finding problem at hand and present its solution calculated, the scope of this project focuses on the development of an application that allows the users to have a graphical user interface to mimic the different path-finding problems and have the in-built algorithms to calculate the solutions. The application is written in Java and uses the Java Agent DEvelopment (JADE) framework to support the management of agents. Next, the graphical user interface uses JavaFX to present the user with a unique and simple look and feel that cannot be achieved with Java Swing. JavaScript Object Notation (JSON) is the chosen format for data exchanges between the internal files and the server which hosts the various algorithms. The application primarily uses the Model-View-Controller (MVC) design pattern for its architectural design as recommended by Oracle when integrating JavaFX into applications. Additionally, the software lifecycle follows the Agile methodology as it allows the constant delivery of the application in small amounts and any changes that may arise to be made. The result is a simple and functional graphical application that performs the intended purpose written in its functional requirements and can be scaled to include more complex scenarios and path-finding algorithms in the future. Bachelor of Engineering (Computer Science) 2020-04-21T04:15:52Z 2020-04-21T04:15:52Z 2020 Final Year Project (FYP) https://hdl.handle.net/10356/137985 en SCSE19-0144 application/pdf Nanyang Technological University
spellingShingle Engineering::Computer science and engineering
Chua, Wen Kai
Multi-agent path finding (part C)
title Multi-agent path finding (part C)
title_full Multi-agent path finding (part C)
title_fullStr Multi-agent path finding (part C)
title_full_unstemmed Multi-agent path finding (part C)
title_short Multi-agent path finding (part C)
title_sort multi agent path finding part c
topic Engineering::Computer science and engineering
url https://hdl.handle.net/10356/137985
work_keys_str_mv AT chuawenkai multiagentpathfindingpartc