By Topic

Evolutionary algorithm for path planning in mobile robot environment

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

3 Author(s)
Hoi-Shan Lin ; 26/F, Flat 8 Yan Mui House, Yan Ming Court, Junk Bay, Hong Kong ; Jing Xiao ; Michalewicz, Z.

An evolutionary algorithm is discussed for the path planning problem in mobile robot environment, which may contain a number of unknown obstacles. The evolutionary algorithm searches for paths in the entire, continuous free space. It unifies off-line and on-line planning processes and provides high safety measures without requiring complete information about the obstacles sensed

Published in:

Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on

Date of Conference:

27-29 Jun 1994