On a Hybrid Genetic Algorithm Solving a Global Path Planning for a Ground Mobile Robot

Author(s):  
Piotr Bigaj ◽  
Jakub Bartoszek
2011 ◽  
Vol 135-136 ◽  
pp. 673-677
Author(s):  
Li Xun Zhang ◽  
Yin Xue Wang ◽  
Bing Bing Wang ◽  
Qian Deng ◽  
Hao Chen

Path planning for mobile robot is a kernel problem in the robot technology area, with the characteristics of complexity, binding and nonlinearity. On account of global path planning for mobile robot in static environment, this paper discussed a method of combining ant colony algorithm and genetic algorithm. After completing a cycle of ant colony algorithm, two paths ants walked were randomly selected, and these two paths were further optimized genetically on the basis of certain crossover rate, if more optimal paths were obtained, the pheromone would be released in the more optimal paths, by this method the diversity of solution could be increased and solution speed be improved. The simulation result has verified the effectiveness of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document