Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots Academic Article

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. 2013 IEEE.

authors

• Rathinam, Sivakumar

published proceedings

• IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING

altmetric score

• 6

author list (cited authors)

• Sundar, K., & Rathinam, S.

citation count

• 135

complete list of authors

• Sundar, Kaarthik||Rathinam, Sivakumar

publication date

• January 2014

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Automation Science and Engineering  Journal

keywords

• Fuel Constraints
• Heuristics
• Traveling Salesman Problem
• Unmanned Aerial Vehicle

Digital Object Identifier (DOI)

• 10.1109/TASE.2013.2279544

start page

• 287

end page

• 294

volume

• 11

issue

• 1

URL

• http://dx.doi.org/10.1109/tase.2013.2279544