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

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

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

9 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationStudies in Computational Intelligence
PublisherSpringer Verlag
Pages207-222
Number of pages16
DOIs
StatePublished - 2018
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume749
ISSN (Print)1860-949X

Keywords

  • Bacterial potential field
  • GPU
  • Mobile robots
  • Path planning

Fingerprint

Dive into the research topics of 'Parallel bacterial potential field algorithm for path planning in mobile robots: A GPU implementation'. Together they form a unique fingerprint.

Cite this