Journal of Northeastern University Natural Science ›› 2015, Vol. 36 ›› Issue (7): 923-928.DOI: 10.12068/j.issn.1005-3026.2015.07.003

• Information & Control • Previous Articles     Next Articles

Global Path Planning Based on Improved Ant Colony Optimization Algorithm for Geometry

LIU Jie1, YAN Qing-dong1, MA Yue1, TANG Zheng-hua2   

  1. 1.School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China; 2.Simulation Training Center, Academy of Armored Forces, Bengbu 233050, China.
  • Received:2014-06-27 Revised:2014-06-27 Online:2015-07-15 Published:2015-07-15
  • Contact: LIU Jie
  • About author:-
  • Supported by:
    -

Abstract: The improved ant colony algorithm and path geometry optimization were applied to solve the global path planning problem of mobile robot. The obstacle performance was combined in the proposed algorithm to establish the workspace model of the robot. By setting the initial pheromone, the ant searching speed was accelerated, and through the adaptive pheromone mechanism, the interference problem of initial pheromone to the specific map was solved. In addition, the pros and cons of the path planning were screened by setting the adaptive path length. It was also proposed that the pheromone spreading strategy was decided by the path length. Meanwhile, according to the principle of geometry, the planning path was optimized to accelerate the convergence speed of the optimal solution. The effectiveness and universal application of the proposed algorithm was demonstrated by the simulation results. In the random environment map, the optimal path could be rapidly obtained with the proposed algorithm.

Key words: grid method, path planning, ant colony algorithm, geometry optimization, mobile robot

CLC Number: