Parallel bacterial potential field algorithm for path planning in mobile robots: A GPU implementation

Ulises Orozco-Rosas, Oscar Montiel, Roberto Sepúlveda

Producción científica: Capítulo del libro/informe/acta de congresoCapítulorevisión exhaustiva

9 Citas (Scopus)

Resumen

Path planning is a fundamental task in autonomous mobile robot navigation and one of the most computationally intensive tasks. In this work, a parallel version of the bacterial potential field (BPF) method for path planning in mobile robots is presented. The BPF is a hybrid algorithm, which makes use of a bacterial evolutionary algorithm (BEA) with the artificial potential field (APF) method, to take advantage of intelligent and classical methods. The parallel bacterial potential field (parallel-BPF) algorithm is implemented on a graphics processing unit (GPU) to speed up the path planning computation in mobile robot navigation. Simulation results to validate the analysis and implementation are provided; the experiments were specially designed to show the effectiveness and the efficiency of the parallel-BPF algorithm.

Idioma originalInglés
Título de la publicación alojadaStudies in Computational Intelligence
EditorialSpringer Verlag
Páginas207-222
Número de páginas16
DOI
EstadoPublicada - 2018
Publicado de forma externa

Serie de la publicación

NombreStudies in Computational Intelligence
Volumen749
ISSN (versión impresa)1860-949X

Huella

Profundice en los temas de investigación de 'Parallel bacterial potential field algorithm for path planning in mobile robots: A GPU implementation'. En conjunto forman una huella única.

Citar esto