By Topic

The Ant Algorithm for Solving Robot Path Planning Problem

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

4 Author(s)
Gengqian Liu ; Hebei Univ. of Technol., Tianjin ; Tiejun Li ; Yuqing Peng ; Xiangdan Hou

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

Published in:

Information Technology and Applications, 2005. ICITA 2005. Third International Conference on  (Volume:2 )

Date of Conference:

4-7 July 2005