Please use this identifier to cite or link to this item:
Title: Efficient cyclic routing of unmanned aerial vehicles
Authors: Ong, Chao Jian
Keywords: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Issue Date: 2018
Abstract: Popularity in adapting Unmanned Aerial Vehicles (UAVs) to military and civilian purposes has been growing at an unprecedented rate, allowing for flexible and better use of precious manpower resources. One use of these UAVs includes surveillance of a set of checkpoints, each with their revisit constraints. Coupled with the time constraint for travelling between these checkpoints, the problem then arises on how best to construct a cyclic route that can satisfy all constraints perpetually with a single UAV. While this problem has been discussed about by some papers, which includes a final year report – by Lim Cheng Siang in 2017 – experimenting with an actual solution, none has been about attempting to design an efficient cyclic route. An example includes critical military functions such that checkpoints should not be revisited too often in risking alerting the enemies that they are being monitored. Therefore, this project intends to design an algorithm for planning an efficient cyclic route in order to solve such issues. This report shall illustrate both the algorithm design and how it works, and at the same time, gather data for comparison between the new algorithm and the one proposed by Lim to show how the new algorithm improves the efficiency of the planned cyclic route.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Ong Chao Jian CR-UAV Final Report.pdf
  Restricted Access
5.94 MBAdobe PDFView/Open

Page view(s) 50

checked on Oct 24, 2020

Download(s) 50

checked on Oct 24, 2020

Google ScholarTM


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