By Topic

Genetic algorithm based path planning and dynamic obstacle avoidance 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

3 Author(s)
Woong-Gie Han ; Sch. of Electr. & Comput. Eng., Sung Kyun Kwan Univ., Suwon, South Korea ; Seung-Min Baek ; Tae-Yong Kuc

A simple path planning scheme is proposed for navigation of mobile robots while avoiding obstacles. In generating the goal directed dynamic path, the path planning scheme uses a genetic search algorithm whose coding technique speeds up the execution of genetic search for fast path generation. The fitness value of the generated paths is evaluated in terms of the safety from the obstructing dynamic objects and the distance to the goal position by the genetic algorithm. The execution time of genetic search is further accelerated by projecting the two dimensional data to one dimensional ones to reduce the size of search space

Published in:

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on  (Volume:3 )

Date of Conference:

12-15 Oct 1997