Paper Info
Title
Algorithms for Routing an Unmanned Aerial Vehicle in the presence of Refueling Depots
Abstract
We consider a single Unmanned Aerial Vehicle (UAV) routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot. The objective of the problem is to find a path for the UAV such that each target is visited at least once by the vehicle, the fuel constraint is never violated along the path for the UAV, and the total fuel required by the UAV is a minimum. We develop an approximation algorithm for the problem, and propose fast construction and improvement heuristics to solve the same. Computational results show that solutions whose costs are on an average within 1.4% of the optimum can be obtained relatively fast for the problem involving five depots and 25 targets.
Year
DOI
Venue
2013
10.1109/TASE.2013.2279544
IEEE T. Automation Science and Engineering
Keywords
DocType
Volume
Fuels,Approximation algorithms,Approximation methods,Routing,Unmanned aerial vehicles,Heuristic algorithms
Journal
abs/1304.0494
Issue
ISSN
Citations 
1
1545-5955
24
PageRank 
References 
Authors
1.29
4
2
Name
Order
Citations
PageRank
Kaarthik Sundar17511.68
Sivakumar Rathinam221623.81