By Topic

Novel path planning of robots based on bidirectional ant colony algorithm

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
$31 $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)
Yongfen Wu ; Inst. of Command Autom., PLA Univ.of Sci. & Technol., Nanjing, China ; Lei Shi ; Qing Li ; Yao Chen

For solving the shortcomings of converging slowly and falling into partial delay easily, a new approach for robot path planning is introduced based on bidirectional ant colony searching the optimal solution at the same time. First of all, the two ant colonies at the original and the terminal run with different strategies. Searching on the two paths at the same time makes it more global. Secondly, the descending strategy is taken to adjust the scale of ant colony, so that the positive ants search paths mainly, the positive feedback is enhanced and the speed of the convergence is faster at the latter of the algorithm. Finally, each path can be optimized locally. According to the observations, redundant paths will be found possibly in a 3*3 grid, and it can be pulled into a straight-line distance. Experimental results show that the algorithm actualizes simply, effects stably, and the global optimal path can be found in short time after numerous running.

Published in:

Natural Computation (ICNC), 2010 Sixth International Conference on  (Volume:5 )

Date of Conference:

10-12 Aug. 2010