Path Planning of an Autonomous Mobile Robot using Enhanced Bacterial Foraging Optimization Algorithm
PDF

Keywords

Autonomous Mobile Robot
Path Planning
Static and Dynamic Environments
Bacterial Foraging Optimization Algorithm

How to Cite

Path Planning of an Autonomous Mobile Robot using Enhanced Bacterial Foraging Optimization Algorithm. (2017). Al-Khwarizmi Engineering Journal, 12(4), 26-35. https://doi.org/10.22153/kej.2016.01.001

Publication Dates

Abstract

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algorithm and other two state-of-the-art algorithms. This study showed that the proposed method is effective and produces trajectories with satisfactory results.

PDF

Copyright: Open Access authors retain the copyrights of their papers, and all open access articles are distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution and reproduction in any medium, provided that the original work is properly cited. The use of general descriptive names, trade names, trademarks, and so forth in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations. While the advice and information in this journal are believed to be true and accurate on the date of its going to press, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein.