A two-stage approach for routing multiple unmanned aerial vehicles with stochastic fuel consumption

21Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

Abstract

The past decade has seen a substantial increase in the use of small unmanned aerial vehicles (UAVs) in both civil and military applications. This article addresses an important aspect of refueling in the context of routing multiple small UAVs to complete a surveillance or data collection mission. Specifically, this article formulates a multiple-UAV routing problem with the refueling constraint of minimizing the overall fuel consumption for all the vehicles as a two-stage stochastic optimization problem with uncertainty associated with the fuel consumption of each vehicle. The two-stage model allows for the application of sample average approximation (SAA). Although the SAA solution asymptotically converges to the optimal solution for the two-stage model, the SAA run time can be prohibitive for medium-and large-scale test instances. Hence, we develop a tabu search-based heuristic that exploits the model structure while considering the uncertainty in fuel consumption. Extensive computational experiments corroborate the benefits of the two-stage model compared to a deterministic model and the effectiveness of the heuristic for obtaining high-quality solutions.

Cite

CITATION STYLE

APA

Venkatachalam, S., Sundar, K., & Rathinam, S. (2018). A two-stage approach for routing multiple unmanned aerial vehicles with stochastic fuel consumption. Sensors (Switzerland), 18(11). https://doi.org/10.3390/s18113756

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free