Path Planning of an Autonomous Mobile Robot using Directed Artificial Bee Colony Algorithm

  • HadiAbbas N
  • Mahdi Ali F
N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

This paper describes the problem of offline autonomous mobile robot path planning, which is consist of generating 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 improved algorithm for solving the problem of path planning using Artificial Bee Colony algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of bees around their hive, is used to find the optimal path from a starting point to a target point. The proposed algorithm is demonstrated by simulations in three different environments. A comparative study is evaluated between the developed algorithm, the original ABC and other two state-of-the-art algorithms. This study shows that the proposed method is effective and gets trajectories with satisfactory results.

Cite

CITATION STYLE

APA

HadiAbbas, N., & Mahdi Ali, F. (2014). Path Planning of an Autonomous Mobile Robot using Directed Artificial Bee Colony Algorithm. International Journal of Computer Applications, 96(11), 11–16. https://doi.org/10.5120/16836-6681

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free