Mobile Robot Path Planning Based on Improved Ant Colony Optimization Algorithm

Abstract

Listen

Translate article

ACO (ant colony algorithm) is a kind of bionic optimization algorithm developed in recent decades, which has shown its excellent performance and great development potential in solving many complex problems. Q-learning, a type of reinforcement learning, has gained increasing popularity in autonomous mobile robot path recently. In order to effectively solve mobile robot path planning problem in obstacle avoidance environment, a path planning model and search algorithm based on improved ant colony optimization algorithm are proposed. The incentive model of reinforcement learning mechanism is introduced with the volatilization of pheromone concentration, establishing dynamic volatile function table.The group intelligent search iterative process of global position selection and local position selection is exploited to combine the volatilization of pheromone concentration with ant colony algorithm, dynamically adjusting the empirical parameter of the reward function by strengthening the data training experiment of Q-learning. To determine the constant parameters for simulation experiment, once the distance between the robot and the obstacle is less than a certain thresholds value, the 0-1 random number is used to randomly adjust the moving direction, avoiding the occurrence of mobile robot path matching deadlock. The study case shows that the proposed algorithm is proved to be better efficient and effective, thereby improving the search intensity and accuracy of the mobile robot path planning problem. And the experimental simulation shows that the proposed model and algorithm effectively solve mobile robot path planning problem that the parameter selection and the actual scene cannot be adapted in real time in traditional path planning problem.