Path planning for autonomous mobile robots using multi-objective evolutionary particle swarm optimization

In this article, a new path planning algorithm is proposed. The algorithm is developed on the basis of the algorithm for finding the best value using multi-objective evolutionary particle swarm optimization, known as the MOEPSO. The proposed algorithm is used for the path planning of autonomous mobile robots in both static and dynamic environments. The paths must follow the determined criteria, namely, the shortest path, the smoothest path, and the safest path. In addition, the algorithm considers the degree of mutation, crossover, and selection to improve the efficiency of each particle. Furthermore, a weight adjustment method is proposed for the movement of particles in each iteration to increase the chance of finding the best fit solution. In addition, a method to manage feasible waypoints within the radius of obstacles or blocked by obstacles is proposed using a simple random method. The main contribution of this article is the development of a new path planning algorithm for autonomous mobile robots. This algorithm can build the shortest, smoothest, and safest paths for robots. It also offers an evolutionary operator to prevent falling into a local optimum. The proposed algorithm uses path finding simulation in a static environment and dynamic environment in conjunction with comparing performance to path planning algorithms in previous studies. In the static environment (4 obstacles), the shortest path obtained from the proposed algorithm is 14.3222 m. In the static environment (5 obstacles), the shortest path obtained from the proposed algorithm is 14.5989 m. In the static environment (6 obstacles), the shortest path obtained from the proposed algorithm is 14.4743 m. In the dynamic environment the shortest path is 12.2381 m. The results show that the proposed algorithm can determine the paths from the starting point to the destination with the shortest distances that require the shortest processing time.