粒子群优化的移动机器人路径规划算法

针对移动机器人在复杂环境下采用传统方法路径规划收敛速度慢和局部最优问题，提出了斥力场下粒子群优化（PSO）的移动机器人路径规划算法。首先采用栅格法对机器人的移动路径进行初步规划，并将栅格法得到的初步路径作为粒子的初始种群，根据障碍物的不同形状和尺寸以及障碍物所占的地图总面积确定栅格粒度的大小，进而对规划路径进行数学建模；然后根据粒子之间的相互协作实现对粒子位置和速度的不断更新；最后采用障碍物斥力势场构造高安全性适应度函数，从而得到一条机器人从初始位置到目标的最优路径。利用Matlab平台对所提算法进行仿真，结果表明，该算法可以实现复杂环境下路径寻优和安全避障；同时还通过对比实验验证了算法收敛速度快，能解决局部最优问题。

Path planning algorithm of mobile robot based on particle swarm optimization

Concerning the slow convergence and local optimum of the traditional robot path planning algorithms in complicated enviroment, a new path planning algorithm for mobile robots based on Particle Swarm Optimization (PSO)algorithm in repulsion potential field was proposed. Firstly, the grid method was used to give a preliminary path planning of robot, which was regarded as the initial particle population. The size of grids was determined by the obstacles of different shapes and sizes and the total area of obstacles in the map, then mathematical modeling of the planning path was completed. Secondly, the particle position and speed were constantly updated through the cooperation between particles. Finally, the high-security fitness function was constructed using the repulsion potential field of obstacles to obtain an optimal path from starting point to target of robot. Simulation experiment was carried out with Matlab. The experimental results show that the proposed algorithm can implement path optimization and safely avoid obstacles in a complex environment; the contrast experimental results indicat that the proposed algorithm converges fast and can solve the local optimum problem.