Development of an modified Ant Colony Optimization algorithm for solving path planning problems of a robot system

Abstract

In the modern world of high-speed technologies, where every operation needs to be performed instantaneously and more efficiently, scientists and engineers have created a Bioinspired algorithm to solve the problems encountered in realworld activities. The Ant Colony optimisation (ACO) algorithm is one such solution that assists in solving the problems of robot path planning. In this work-in-progress article, we propose a new way of using the ACO algorithm which ensures solving the problems encountered in traditional ACO algorithms. This algorithm was tested on two environments to examine output efficiency and computational output time. The results show that the proposed ACO algorithm is completely efficient in small-scale environments and remarkably better results were observed on testing it in the bigger-scale environment. The evaluations prove that the ACO algorithm for path planning can provide rapid path planning with acceptable results and for future development can be integrated with the robot system to test it in any real-world scenarios by increasing the number of ants.