Journal Article

·2014

Parallel solution for UAV route planning problem using Ant Colony Optimisation on GPU with CUDA

Uğur Çekmez YTU , Mustafa Ozsifinan

Abstract

Using evolutionary algorithms to solve the optimisation problems yields valuable resutls in a reasonable time. But since the problem domain gets bigger, the still results may not be reached in such a short time. Thus, the new approaches to solve this complexity are being used, that is, for now, the GPU parallelization in contrast to traditional CPUs. Additional advantage of GPUs are: low energy consumption, better performance/price ratio, easy access, high bandwidth, etc. In this study, the Ant Colony Optimisation, a type of an evolutionary algorithm, is examined and re-designed so it is executed on GPU in a parallel manner. The aim here is to use it to solve the route planning problems for UAV. In this context, proposed algorithm is tested in a well-known engineering problem (TSP), and experimental evaluation is conducted to compare with CPUs. The obtained results indicate that our approach leads to a considerable speedup. These results explicitly show that GPUs have a potential for acceleration of ACO in a parallel manner, and it allows to solve more complex real world tasks.

Keywords

CUDA Computer science Speedup Parallel computing Ant colony optimization algorithms Acceleration Context (archaeology) Ant colony Evolutionary algorithm Domain (mathematical analysis) Mathematical optimization Algorithm Artificial intelligence Mathematics

Subject Areas

Robotic Path Planning Algorithms ·Computer Vision and Pattern Recognition ·Physical Sciences
UAV Applications and Optimization ·Aerospace Engineering ·Physical Sciences
Metaheuristic Optimization Algorithms Research ·Artificial Intelligence ·Physical Sciences

Citations by Year

OpenAlex SDG Match

SDGs auto-classified by OpenAlex (score ≥ 0.4 shown).

Affordable and clean energy 91%