Cyclic routing of unmanned aerial vehicle
This report proposes an alternative algorithm that uses a metaheuristic technique, Simulated Annealing, to solve for the Cyclic Routing of Unmanned Aerial Vehicles (CR-UAV) problem. This report discusses the implementation of the algorithm and provides experimental results for the algorithm. The pu...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/156446 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-156446 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1564462022-04-16T14:16:37Z Cyclic routing of unmanned aerial vehicle Heng, Jozua Yi Jie Huang Shell Ying School of Computer Science and Engineering ASSYHUANG@ntu.edu.sg Engineering::Computer science and engineering This report proposes an alternative algorithm that uses a metaheuristic technique, Simulated Annealing, to solve for the Cyclic Routing of Unmanned Aerial Vehicles (CR-UAV) problem. This report discusses the implementation of the algorithm and provides experimental results for the algorithm. The purpose is to eventually provide an algorithm that is optimal, consistent, and reasonably scalable such that is it applicable to real world scenarios. Data are collected by running the test cases over 100 runs. The output is exported out as a Comma Separated Value (CSV) file. Analysis and processing of the output is done in Jupyter Notebook and further exported out as another CSV file. Statistics from the test results have proved that algorithm is able to solve for the CR-UAV with relative optimality and consistency under a reasonable amount of time. Bachelor of Engineering (Computer Science) 2022-04-16T14:16:37Z 2022-04-16T14:16:37Z 2022 Final Year Project (FYP) Heng, J. Y. J. (2022). Cyclic routing of unmanned aerial vehicle. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/156446 https://hdl.handle.net/10356/156446 en SCSE21-0494 application/pdf Nanyang Technological University |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Computer science and engineering |
spellingShingle |
Engineering::Computer science and engineering Heng, Jozua Yi Jie Cyclic routing of unmanned aerial vehicle |
description |
This report proposes an alternative algorithm that uses a metaheuristic technique, Simulated Annealing, to solve for the Cyclic Routing of Unmanned Aerial Vehicles (CR-UAV) problem. This report discusses the implementation of the algorithm and provides experimental results for the algorithm. The purpose is to eventually provide an algorithm that is optimal, consistent, and reasonably scalable such that is it applicable to real world scenarios.
Data are collected by running the test cases over 100 runs. The output is exported out as a Comma Separated Value (CSV) file. Analysis and processing of the output is done in Jupyter Notebook and further exported out as another CSV file.
Statistics from the test results have proved that algorithm is able to solve for the CR-UAV with relative optimality and consistency under a reasonable amount of time. |
author2 |
Huang Shell Ying |
author_facet |
Huang Shell Ying Heng, Jozua Yi Jie |
format |
Final Year Project |
author |
Heng, Jozua Yi Jie |
author_sort |
Heng, Jozua Yi Jie |
title |
Cyclic routing of unmanned aerial vehicle |
title_short |
Cyclic routing of unmanned aerial vehicle |
title_full |
Cyclic routing of unmanned aerial vehicle |
title_fullStr |
Cyclic routing of unmanned aerial vehicle |
title_full_unstemmed |
Cyclic routing of unmanned aerial vehicle |
title_sort |
cyclic routing of unmanned aerial vehicle |
publisher |
Nanyang Technological University |
publishDate |
2022 |
url |
https://hdl.handle.net/10356/156446 |
_version_ |
1731235783836172288 |