Global Path Planning for Mobile Robot Based on Improved Particle Swarm Optimization

Abstract

In this article,chaos initialization,mutation and cross operation were added to the standard particle swarm optimization.While maintaining the simple structure and fast convergence of the standard particle swarm optimization,the improved algorithms increase the diversity of group,enlarge the search space,avoid the premature convergence problem effectively and obtain the optimal path from starting point to target point.Thus,the effectiveness and practicability of this method were proved.