Abstract
Aerial surveillance missions require a geographical region known as the area of interest to be inspected. The route that the aerial reconnaissance vehicle will follow is known as the flight route. Flight route planning operation has to be done before the actual mission is executed. A flight route may consist of hundreds of pre-defined geographical positions called waypoints. The optimal flight route planning manages to find a tour passing through all of the waypoints by covering the minimum possible distance. Due to the combinatorial nature of the problem it is impractical to devise a solution using brute force approaches. This study presents an approach to find a near-optimal solution to the flight route planning problem. The proposed approach is based on converting the problem into Traveling Salesman Problem which is solved using Genetic Algorithms on Graphical Processing Unit (GPU). The parallel genetic algorithm devised for GPUs has been compared to the alternative algorithms and found to be promising in terms of speed-up. We also present a thorough analysis of the implemented algorithm for several cases using different parameter values.
Similar content being viewed by others
References
You, Y.-S.: Parallel ant system for traveling salesman problem on GPUs. In: GECCO 2009—GPUs for Genetic and Evolutionary Computation, pp 1–2 (2009)
Cross, M., Marlow, D., Looker, J.: Application of the Non-stationary Travelling Salesman Problem to Maritime Surveillance. Proceedings of MISG 2007, pp 1–4 (2007)
CUDA in Action. http://www.nvidia.com/object/cuda_in_action.html (last accessed date: 29 November 2010)
Marlow, D.O., Kilby, P., Mercer, G. N.: Examining Methods for Maximizing Ship Classifications in Maritime Surveillance. In: 18th World IMACS/MODSIM Congress, Cairns, Australia, pp 1630–1632 (2009)
Colorni, A., Dorigo et, M., Maniezzo, V.: Distributed Optimization by Ant Colonies, actes de la première conférence européenne sur la vie artificielle, Paris, France. Elsevier, pp 134–142 (1991)
Bryant, K.: Genetic Algorithms and the Traveling Salesman Problem. Department of Mathematics, Harvey Mudd College, pp 10–12, 20–23 (2000)
John M., Panton D., White K.: Mission planning for regional surveillance. Ann. Oper. Res. 108, 157–173 (2001)
Asbjorn, B.: Implementation of Genetic Algorithm on CUDA. http://fag.grm.hia.no. (last accessed date: 18 December 2009)
Mariusz, N., Riccardo, P.: Parallel Genetic Algorithm Taxonomy. KES’99, pp 1–5 (1999)
NVIDIA Compute PTX ISA 1.2 manual pp 9
Üçoluk G.: Genetic Algorithm Solution of the TSP Avoiding Special Crossover and Mutation. Intell Automat Soft Comput, TSI Press 3(8), 1–3 (2002)
NVIDIA. GPU Gems 3. Addison-Wesley/Pearson education (2008)
Fujimoto, N., Tsutsui, S.: A Highly-Parallel TSP Solver for A GPU Computing Platform. NMA2010, LNCS, vol. 6046, pp 264–271 (2011)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sancı, S., İşler, V. A Parallel Algorithm for UAV Flight Route Planning on GPU. Int J Parallel Prog 39, 809–837 (2011). https://doi.org/10.1007/s10766-011-0171-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10766-011-0171-8