Home /Research /Optimal Path Planning for Robot Based on Ant Colony Algorithm
OTHER

Optimal Path Planning for Robot Based on Ant Colony Algorithm

Hong Zhao

Year
2020
Citations
12

Abstract

With the development of computer technology and intelligent computing, robot technology also gets more and more attention, in view of this, the robot path planning problem is also particularly important. In this paper, the optimal path planning for robot based on ant colony algorithm is proposed by studying the related literature and important techniques about robot path planning in China and abroad. This paper mainly considers that under the condition of sensing the current environment, the robot dynamically avoids the obstacles and meets the requirements of the least time and the minimum walking path. On the basis of introducing the robot path planning problem, the mathematical model is established for the ant colony algorithm, and the experiment is conducted through the analogue simulation. The experimental results show that the model can intelligently choose a path for the robot with dynamic obstacle avoidance, having the shortest time and shorter distance, and has a certain contribution to the intelligent development for the robot.

Keywords

Ant colony optimization algorithmsRobotMotion planningObstacleComputer sciencePath (computing)Obstacle avoidanceShortest path problemMobile robotArtificial intelligence

Related papers

Browse all OTHER papers