By Topic

Delaunay Graph Based Path Planning Method for Mobile Robot

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)
Dong Hui-ying ; Shenyang Ligong Univ., Shenyang, China ; Duan Shuo ; Zhao Yu

This paper introduces Delaunay graph into path planning for mobile robot for the shortest path. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using Floyd algorithm. Path can be found easily with adaptive genetic algorithm by adjusting the parameter. Then genetic algorithm is used for obtaining the optimum path. Results of simulation show that this path planning method is simple and realized easily.

Published in:

Communications and Mobile Computing (CMC), 2010 International Conference on  (Volume:3 )

Date of Conference:

12-14 April 2010