Future of Information and Communication Conference (FICC) 2025
28-29 April 2025
Publication Links
IJACSA
Special Issues
Future of Information and Communication Conference (FICC)
Computing Conference
Intelligent Systems Conference (IntelliSys)
Future Technologies Conference (FTC)
International Journal of Advanced Research in Artificial Intelligence(IJARAI), Volume 2 Issue 3, 2013.
Abstract: Path planning problem, is a challenging topic in robotics. Indeed, a significant amount of research has been devoted to this problem in recent years. The ant colony optimization algorithm is another approach to solve this problem. Each ant drops a quantity of artificial pheromone on every point that the ant passes through. This pheromone simply changes the probability that the next ant becomes attracted to a particular grid point. The techniques described in the paper adapt a global attraction term which guides ants to head toward the destination point. The paper describes the various techniques for the robot path planning using the Ant colony Algorithm. The paper also provides the brief comparison of the three techniques described in the paper.
Alpa Reshamwala and Deepika P Vinchurkar, “Robot Path Planning using An Ant Colony Optimization Approach:A Survey” International Journal of Advanced Research in Artificial Intelligence(IJARAI), 2(3), 2013. http://dx.doi.org/10.14569/IJARAI.2013.020310
@article{Reshamwala2013,
title = {Robot Path Planning using An Ant Colony Optimization Approach:A Survey},
journal = {International Journal of Advanced Research in Artificial Intelligence},
doi = {10.14569/IJARAI.2013.020310},
url = {http://dx.doi.org/10.14569/IJARAI.2013.020310},
year = {2013},
publisher = {The Science and Information Organization},
volume = {2},
number = {3},
author = {Alpa Reshamwala and Deepika P Vinchurkar}
}
Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.