DocumentCode
3006840
Title
Mobile Robot Global Path Planning Based on Improved Augment Ant Colony Algorithm
Author
Gao, Meijuan ; Xu, Jin ; Tian, Jingwen
Author_Institution
Beijing Union Univ., Beijing
fYear
2008
fDate
25-26 Sept. 2008
Firstpage
273
Lastpage
276
Abstract
To overcome the defects of precocity and the time for initial population building is too long in traditional augment ant colony algorithm for mobile robot global path planning, an improved augment ant colony algorithm is presented in this paper. The operations of crossover and mutation of genetic algorithm (GA) are used in augment ant colony optimization, and the heuristic probability function is added to the process of the initial population building. The process flow of improved ant colony algorithm is given and the simulation experiment is done under the VC++ 6.0 environment. Experimental results show that the algorithm has much higher capacity of global optimization than traditional augment ant colony algorithm.
Keywords
C++ language; genetic algorithms; mobile robots; path planning; probability; GA; VC++ 6.0; genetic algorithm; global optimization; heuristic probability function; improved augment ant colony algorithm; mobile robot global path planning; Ant colony optimization; Chemical technology; Feedback; Genetic algorithms; Genetic mutations; Mobile robots; Navigation; Neural networks; Path planning; Space technology; Ant colony algorithm; Mobile robot; Path planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Genetic and Evolutionary Computing, 2008. WGEC '08. Second International Conference on
Conference_Location
Hubei
Print_ISBN
978-0-7695-3334-6
Type
conf
DOI
10.1109/WGEC.2008.39
Filename
4637443
Link To Document