By Topic

Genetic Algorithm Based Robot Path Planning

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

1 Author(s)
WeiQiang Liao ; Dept. of Electr. Autom., Jimei Univ., Xiamen

In the environment with partially-known information, the real time path planning can be steadily performed by using the grid method and genetic algorithm; one-dimensional coding problems can be simplified into Two-dimensional path coding problems, at the same time, the obstacle avoidance requirements and shortest paths requirements are integrated into a simple appropriate function. Simultaneously, insertion operator and deletion operator are set to guarantee the path continuity and conciseness. In the end, stimulations are conducted to compare the paths planned in varied environments, and it can that proved that algorithm has great applicability.

Published in:

Intelligent Computation Technology and Automation (ICICTA), 2008 International Conference on  (Volume:1 )

Date of Conference:

20-22 Oct. 2008