Path Planning for Mobile Robot Based on Improved Ant Colony Algorithm

Article Preview

Abstract:

This paper presents a dynamic path planning method based on improved ant colony algorithm. In order to increasing the algorithm’s convergence speed and avoiding to fall into local optimum, we propose adaptive migratory probability function and updating the pheromone. We apply the improved algorithm to path planning for mobile robot and the simulation experiment proved that improved algorithm is viable and efficient.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

717-720

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] ZHANG Xue-min, ZHANG Hang. Research An Improved Ant Colony Algorithm of the Optimal Routing Problem[J]. Techniques of Automation & Applications(2009).

Google Scholar

[2] Dorigo M, Colorni A, Maniezzo V. Distributed optimization by ant colonies [C]/Proc of the 1st European Conf of Artificial Life. Paris: Elsevier, (1991).

Google Scholar

[3] ZHANG Meiyu, HUANG Han, HAO Zhifeng, et al. Motion planning of autonomous mobile robot based on ant colony algorithm[J]. Computer Engineering and Applications, (2005).

Google Scholar