Development of an Ant Colony Optimization Technique for Solving Robot Routing Problem

Volume: 8    Issue: 1

Year of Publication: 2021

Pages: (44-48)

Authors: Obe O. Olumide

Download Full Text (PDF)

Abstract

Path planning has been one of the major research challenges in a Mobile Robot navigation system. Researchers in this area have recorded significant success. However, there are still research issues. Ant Colony Algorithm (ACO), an intelligent optimization Algorithm has recorded successes in many domains including robot control. In this work, ACO was used to find solutions to the robot routing problem. Simulation results established that the proposed algorithm outperformed the min-max ant system technique.

References

1. M. Abdulkadar., S. Mohammad., F. Faisal. and H. Iqbal. Solving the Vehicle Routing Problem using Genetic Algorithm. International Journal of Advanced Computer Science and Applications, Vol. 2, No. 7. 2011

2. A. Amin. and F. Ahmad. Ant Colony System Method To Vehicle Routing Problems. International Journal of Engineering and Applied Sciences, Vol. 6. No. 3, 2015

3. O. O. Obe , E. A. Ajayi, and O. O. Odewale. Genetic Algorithm Based Optimal Trajectories Planning for Robot Manipulators on Assigned Paths. International Journal of Emerging Trends in Engineering Research (IJETER). Vol.8(7):4888-4893, 2020.

4. E. John, and R. Patrick. Ant Colony Optimization Techniques for The Vehicle Routing Problem. Advanced Engineering Informatics, Vol. 18. No. 41–48, 2004

Keywords

Mobile Robot, Routing, optimization, Ant Colony, Simulation.