Mobile Robot Path Planning Based on Time Taboo Ant Colony Optimization in Dynamic Environment

This article aims to improve the problem of slow convergence speed, poor global search ability, and unknown time-varying dynamic obstacles in the path planning of ant colony optimization in dynamic environment. An improved ant colony optimization algorithm using time taboo strategy is proposed, namely, time taboo ant colony optimization (TTACO), which uses adaptive initial pheromone distribution, rollback strategy, and pheromone preferential limited update to improve the algorithm's convergence speed and global search ability. For the poor global search ability of the algorithm and the unknown time-varying problem of dynamic obstacles in a dynamic environment, a time taboo strategy is first proposed, based on which a three-step arbitration method is put forward to improve its weakness in global search. For the unknown time-varying dynamic obstacles, an occupancy grid prediction model is proposed based on the time taboo strategy to solve the problem of dynamic obstacle avoidance. In order to improve the algorithm's calculation speed when avoiding obstacles, an ant colony information inheritance mechanism is established. Finally, the algorithm is used to conduct dynamic simulation experiments in a simulated factory environment and is compared with other similar algorithms. The experimental results show that the TTACO can obtain a better path and accelerate the convergence speed of the algorithm in a static environment and can successfully avoid dynamic obstacles in a dynamic environment.