GPU Accelerated Membrane Evolutionary Artificial Potential Field for Mobile Robot Path Planning

This work presents a graphics processing unit (GPU) accelerated membrane evolutionary artificial potential field (MemEAPF) algorithm implementation for mobile robot path planning. Three different implementations are compared to show the performance, effectiveness, and efficiency of the MemEAPF algorithm. Simulation results for the three different implementations of the MemEAPF algorithm, a sequential implementation on CPU, a parallel implementation on CPU using the open multi-processing (OpenMP) application programming interface, and the parallel implementation on GPU using the compute unified device architecture (CUDA) are provided to validate the comparative and analysis. Based on the obtained results, we can conclude that the GPU implementation is a powerful way to accelerate the MemEAPF algorithm because the path planning problem in this work has been stated as a data-parallel problem