Research on Path Planning Method of Mobile Robot Based on Improved Spider Swarm Algorithm

Abstract

Path planning is one of the important fields of mobile robot research. Its advantages and disadvantages directly affect the interaction ability between the robot and the surrounding environment. The commonly used global path planning methods are prone to problems such as decision-making speed decline and deadlock when expanding space. During iterative optimization, we simulate the motion law of spider population, that is, according to female Male spiders cooperate, attract each other and interact with each other in the process of marriage, and finally get the optimal solution. Experiments show that the improved spider colony algorithm can realize the path planning of mobile robot, improve its search ability, and avoid falling into local optimization in the process of path planning. Compared with spider colony algorithm and particle swarm optimization algorithm, the optimized shortest path and actual path are better.