loading...
The Ant Algorithm for Solving Robot Path Planning Problem
Sydney, Australia July 04-July 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICITA.2005.268Third International Conference on Inf ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Gengqian Liu, Hebei University of Technology
Tiejun Li, Hebei University of Technology
Yuqing Peng, Hebei University of Technology
Xiangdan Hou, Hebei University of Technology
Using ant algorithm, robot path planning in two-dimension environment is studied. It introduces the intelligent finding optimum mechanism of ant colony. It solves the drawback of local optimization and expedites searching speed. The mathematical model is established and the algorithm is achieved with VB language, the result shows it is valid with the capability of robust and extensibility.
Citation:
Gengqian Liu, Tiejun Li, Yuqing Peng, Xiangdan Hou, "The Ant Algorithm for Solving Robot Path Planning Problem," icita, vol. 2, pp.25-27, Third International Conference on Information Technology and Applications (ICITA'05) Volume 2, 2005
Usage of this product signifies your acceptance of the Terms of Use.