Improved dynamic double mutation particle swarm optimization for mobile robot path planning

摘要

This paper presents a new path planning approach, in which the MAKLINK graph is constructed to describe the complex environment of the mobile robot, the enumeration method ideas into Dijkstra algorithm is used to obtain the shortest path, and the dynamic double mutation particle swarm optimization algorithm is adopted to get the optimal path. Finally, simulation results are used to illustrate the validity of the proposed method.