By Topic

Dynamic path planning for mobile robot based on genetic algorithm in unknown 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
$33 $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

2 Author(s)
Pu Shi ; Department of Automation Engineering, Northeastern University, Qinhuangdao, 066004, China ; Yujie Cui

In this paper, a dynamic path planning scheme based on genetic algorithm (GA) is presented for navigation and obstacle avoidance of mobile robot under unknown environment. The real coding, fitness function and specific genetic operators are devised in the algorithm. The unique coding technique decreases the conventional computational complexity of genetic algorithm. It also speeds up the execution of searching by projecting two dimensional data to one dimensional data, which reduce the size of search space. The fitness function of genetic algorithm takes full consideration of three factors: the collision avoidance path, the shortest distance and smoothness of the path. The specific genetic operators are also selected to make the genetic algorithm more effective. The simulation experiments are made under the VC++ 6.0 environment. The simulation results verify that the genetic algorithm is high effective under various complex dynamic environments.

Published in:

2010 Chinese Control and Decision Conference

Date of Conference:

26-28 May 2010