Aiming at the problems of long path and slow convergence speed when ant colony algorithm is used in path planning of mobile robot
an improved variable-step ant colony algorithm is proposed.The algorithm improves the smoothness mechanism
smoothes the multiple corners generated by the mobile robot
introduces the smoothness guidance function
induces the mobile robot to crawl the node toward the optimal path
improves the ant colony system
compares different paths
and strengthens pheromone concentration of the optimal path introduces pheromone penalty function to prevent the mobile robot from falling into a deadlock or local optimum.Simulation experiment results show that the improved variable-step ant colony algorithm greatly improves the search efficiency of mobile robots compared with other algorithms