首页 /研究 /An Improved Simulated Annealing Particle Swarm Optimization Algorithm for Path Planning of Mobile Robots Using Mutation Particles
SWARM

An Improved Simulated Annealing Particle Swarm Optimization Algorithm for Path Planning of Mobile Robots Using Mutation Particles

Jianzhang Lu, Zhihao Zhang

发表年份
2021
引用次数
14
访问权限
开放获取

摘要

Artificial intelligence technology has brought tremendous changes to human life and production methods. Mobile robots, UAVs, and autonomous driving technology have gradually entered people’s daily life. As a typical issue for a mobile robot, the planning of an optimal mobile path is very important, especially in the military and emergency rescue. In order to ensure the efficiency of operation and the accuracy of the path, it is crucial for the robot to find the optimal path quickly and accurately. This paper discusses a new method and MP‐SAPSO algorithm for addressing the issue of path planning based on the PSO algorithm by combining particle swarm optimization (PSO) algorithm with the simulated annealing (SA) algorithm and mutation particle and adjusting the parameters. The MP‐SAPSO algorithm improves the accuracy of path planning and the efficiency of robot operation. The experiment also demonstrates that the MP‐SAPSO algorithm can be used to effectively address path planning issue of mobile robots.

关键词

Simulated annealingComputer scienceParticle swarm optimizationMutationAlgorithmMobile robotMotion planningMathematical optimizationPath (computing)Swarm behaviour

相关论文

查看 SWARM 分类全部论文