Enhanced ant colony algorithm with communication mechanism for mobile robot path planning

2021 ◽  
pp. 103949
Author(s):  
Wenbin Hou ◽  
Zhihua Xiong ◽  
Changsheng Wang ◽  
Howard Chen
2011 ◽  
Vol 467-469 ◽  
pp. 222-225 ◽  
Author(s):  
Xiao Guang Zhu ◽  
Qing Yao Han ◽  
Zhang Qi Wang

This paper presents an improved ant colony algorithm to plan an optimal collision-free path for mobile robot in complicated static environment. Based on the work space model with grid method, simulated foraging behavior of ants and to serve the mobile robot path planning, update the conventional ant colony algorithm with some special functions. To avoid mobile robot path deadlock, a dead-corner table is established and the penalty function is used to update the trail intensity when an ant explores a dead—corner in the path searching. The simulation results show that the algorithm can improve performance of path planning obviously, and the algorithm is simple and effective.


2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110192
Author(s):  
Songcan Zhang ◽  
Jiexin Pu ◽  
Yanna Si ◽  
Lifan Sun

Path planning of mobile robots in complex environments is the most challenging research. A hybrid approach combining the enhanced ant colony system with the local optimization algorithm based on path geometric features, called EACSPGO, has been presented in this study for mobile robot path planning. Firstly, the simplified model of pheromone diffusion, the pheromone initialization strategy of unequal allocation, and the adaptive pheromone update mechanism have been simultaneously introduced to enhance the classical ant colony algorithm, thus providing a significant improvement in the computation efficiency and the quality of the solutions. A local optimization method based on path geometric features has been designed to further optimize the initial path and achieve a good convergence rate. Finally, the performance and advantages of the proposed approach have been verified by a series of tests in the mobile robot path planning. The simulation results demonstrate that the presented EACSPGO approach provides better solutions, adaptability, stability, and faster convergence rate compared to the other tested optimization algorithms.


Sign in / Sign up

Export Citation Format

Share Document