Open AccessPath Planning Algorithm for Mobile Robot Based on Improved Ant Colony Algorithm
Author(s) -
Yanyun Li,
Fenggang Liu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2083/4/042033
Subject(s) - tree traversal , motion planning , ant colony optimization algorithms , mobile robot , computer science , algorithm , any angle path planning , path (computing) , robot , omnidirectional antenna , graph traversal , shortest path problem , mathematical optimization , artificial intelligence , mathematics , graph , theoretical computer science , telecommunications , antenna (radio) , programming language
Due to the influence of full traversal environment, the path length obtained by existing methods is too long. In order to improve the performance of path planning and obtain the optimal path, a full traversal path planning method for omnidirectional mobile robots based on ant colony algorithm is proposed. On the basis of the topology modeling schematic diagram, according to the position information of the mobile robot in the original coordinate system, a new environment model is established by using the Angle transformation. Considering the existing problems of ant colony algorithm, the decline coefficient is introduced into the heuristic function to update the local pheromone, and the volatility coefficient of the pheromone is adjusted by setting the iteration threshold. Finally, through the design of path planning process, the planning of omnidirectional mobile robot’s full traversal path is realized. Experimental results show that the proposed method can not only shorten the full traversal path length, but also shorten the time of path planning to obtain the optimal path, thus improving the performance of full traversal path planning of omnidirectional mobile robot.