Analysis of path planning algorithms based on travelling salesman problem embedded in UAVs
Analysis of path planning algorithms based on travelling salesman problem embedded in UAVs
Monitoring and recognition of large areas bring great challenge and Unmanned Aerial Vehicles (UAV) promise to be a great help. The challenge is to optimize the task of UAVs, in order to reach the goals with maximum possible quality. The objective of this work is to analyze possible path algorithms and the feasibility of embedded them in a UAV. The question we aim at answering is: given a set of points to be visited and a battery level of the UAV, what is the best possible trajectory to visit all points with the highest resolution of the images? This work proposes the application of two algorithms for solving well known problems from literature, namely the Traveling Salesman Problem and the Close-Enough Traveling Salesman Problem, in the path planing of UAVs. Both approaches present satisfactory results, and a discussion is raised about whether it is possible to embed optimization software into a light and small computing platform.
Bandeira, Thiago W.
7b1b5ed1-c645-4c50-8a26-58050a309ddf
Pereira Coutinho, Walton
844cd0ea-6cef-45fd-98f6-906493797077
Brito, Alisson
94128a47-12a2-4b83-8664-c4adced4bf4b
Subramanian, Anand
12026cc6-35f0-4a66-8806-e992fbd26d1e
Bandeira, Thiago W.
7b1b5ed1-c645-4c50-8a26-58050a309ddf
Pereira Coutinho, Walton
844cd0ea-6cef-45fd-98f6-906493797077
Brito, Alisson
94128a47-12a2-4b83-8664-c4adced4bf4b
Subramanian, Anand
12026cc6-35f0-4a66-8806-e992fbd26d1e
Bandeira, Thiago W., Pereira Coutinho, Walton, Brito, Alisson and Subramanian, Anand
(2015)
Analysis of path planning algorithms based on travelling salesman problem embedded in UAVs.
2015 Brazilian Symposium on Computing Systems Engineering (SBESC), Foz do Iguacu, Brazil.
03 - 06 Nov 2015.
6 pp
.
(doi:10.1109/SBESC.2015.20).
Record type:
Conference or Workshop Item
(Paper)
Abstract
Monitoring and recognition of large areas bring great challenge and Unmanned Aerial Vehicles (UAV) promise to be a great help. The challenge is to optimize the task of UAVs, in order to reach the goals with maximum possible quality. The objective of this work is to analyze possible path algorithms and the feasibility of embedded them in a UAV. The question we aim at answering is: given a set of points to be visited and a battery level of the UAV, what is the best possible trajectory to visit all points with the highest resolution of the images? This work proposes the application of two algorithms for solving well known problems from literature, namely the Traveling Salesman Problem and the Close-Enough Traveling Salesman Problem, in the path planing of UAVs. Both approaches present satisfactory results, and a discussion is raised about whether it is possible to embed optimization software into a light and small computing platform.
Text
index.html_reload=true
- Other
Restricted to Repository staff only
Request a copy
More information
Accepted/In Press date: 10 September 2015
e-pub ahead of print date: 3 November 2015
Venue - Dates:
2015 Brazilian Symposium on Computing Systems Engineering (SBESC), Foz do Iguacu, Brazil, 2015-11-03 - 2015-11-06
Organisations:
Operational Research
Identifiers
Local EPrints ID: 401558
URI: http://eprints.soton.ac.uk/id/eprint/401558
PURE UUID: 08a56012-7fab-4bde-bfcb-8615b5053316
Catalogue record
Date deposited: 18 Oct 2016 13:11
Last modified: 15 Mar 2024 02:49
Export record
Altmetrics
Contributors
Author:
Thiago W. Bandeira
Author:
Walton Pereira Coutinho
Author:
Alisson Brito
Author:
Anand Subramanian
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics