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

Global path planning for mobile robot based on A∗ algorithm and genetic algorithm

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

4 Author(s)
Liang Zhang ; Eng. Res. Center of Metall. Autom. & Meas. Technol. of Minist. of Educ., Wuhan Univ. of Sci. & Technol., Wuhan, China ; Huasong Min ; Hongxing Wei ; Haojun Huang

In this paper, a hybrid method based on A* algorithm and genetic algorithm in grid map is proposed to solve the optimum path planning for mobile robots. In our scheme, A* algorithm is utilized for searching a constrained shortest path quickly, and the global optimal path is obtained by using genetic algorithm to optimize the path. The method makes the path node is not limited to the center of the grid, and does not need to judge whether the path intersects with the obstacle. Simulation results show that the proposed method not only can improve the search speed and search quality, but also can be applied to different environments.

Published in:

Robotics and Biomimetics (ROBIO), 2012 IEEE International Conference on

Date of Conference:

11-14 Dec. 2012

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.