Cart (Loading....) | Create Account
Close category search window
 

Bee colony algorithm for real-time optimal path planning of mobile robots

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Saffari, M.H. ; Sch. of Mech. Eng., Univ. of Tehran, Tehran, Iran ; Mahjoob, M.J.

This paper presents a novel method to solve the problem of path planning for mobile robots based on bee colony algorithm. The method is inspired by collective behavior of honeybees to find food sources around the hive. The proposed method includes two steps. The first step is to use a simple rule to establish an initial collision-free path from the starting point to the target and the second step is utilizing bee colony algorithm to optimize the initial path. The results of computer simulations show that the proposed method is effective and can be used in the real-time path planning of mobile robots.

Published in:

Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control, 2009. ICSCCW 2009. Fifth International Conference on

Date of Conference:

2-4 Sept. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.