Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The free step length ant colony algorithm in mobile robot path planning

The free step length ant colony algorithm in mobile robot path planning AbstractAn improved ant colony algorithm was proposed with the unlimited step length of finding optimal path. It aims at the shortcomings of the traditional ant colony algorithms such as the single step length of finding the optimal path, tendency to fall into local optima and poor convergence. The diversity of choosing a path of ant was increased, further optimizing results, the heuristic information adopting a long step priority was improved at the same time, and a different update mode of local information through choose/pass grid was adopted. Simulation results showed that, the free step length ant colony algorithm could find a shorter path and its convergence was better compared with the traditional ant colony algorithms. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Advanced Robotics Taylor & Francis

The free step length ant colony algorithm in mobile robot path planning

Advanced Robotics , Volume 30 (23): 6 – Dec 1, 2016

The free step length ant colony algorithm in mobile robot path planning

Advanced Robotics , Volume 30 (23): 6 – Dec 1, 2016

Abstract

AbstractAn improved ant colony algorithm was proposed with the unlimited step length of finding optimal path. It aims at the shortcomings of the traditional ant colony algorithms such as the single step length of finding the optimal path, tendency to fall into local optima and poor convergence. The diversity of choosing a path of ant was increased, further optimizing results, the heuristic information adopting a long step priority was improved at the same time, and a different update mode of local information through choose/pass grid was adopted. Simulation results showed that, the free step length ant colony algorithm could find a shorter path and its convergence was better compared with the traditional ant colony algorithms.

Loading next page...
 
/lp/taylor-francis/the-free-step-length-ant-colony-algorithm-in-mobile-robot-path-0e7FlTduuC

References (16)

Publisher
Taylor & Francis
Copyright
© 2016 Taylor & Francis and The Robotics Society of Japan
ISSN
1568-5535
eISSN
0169-1864
DOI
10.1080/01691864.2016.1240627
Publisher site
See Article on Publisher Site

Abstract

AbstractAn improved ant colony algorithm was proposed with the unlimited step length of finding optimal path. It aims at the shortcomings of the traditional ant colony algorithms such as the single step length of finding the optimal path, tendency to fall into local optima and poor convergence. The diversity of choosing a path of ant was increased, further optimizing results, the heuristic information adopting a long step priority was improved at the same time, and a different update mode of local information through choose/pass grid was adopted. Simulation results showed that, the free step length ant colony algorithm could find a shorter path and its convergence was better compared with the traditional ant colony algorithms.

Journal

Advanced RoboticsTaylor & Francis

Published: Dec 1, 2016

Keywords: Unlimited step size; ant colony algorithms; mobile robot; path planning; the optimal path

There are no references for this article.