Comparison of Standard Ant Colony Optimization, Dijkstra and A* Algorithms for Path Planning of Robot in an Indoor Environment

The research topic of Path planning is extremely challenging area of concentration within the field of mobile robots. However, path planning algorithms for mobile robot tasks are contingent upon the environment and its level of complexity. This paper analyzes four distinct path planning methods for simulated indoor environment. The proposed algorithms include conventional Ant Colony methods, Ant System (AS), Ant Colony System (ACS), as well as standard methods Dijkstra and AStar (A*). We analyzed and examined these algorithms by employing various metrics/maps with complexity. The results indicate that the traditional path planning algorithm Dijkstra and A* approaches surpass the other ant colony techniques in terms of both computation time and path distance.