Path planning for intelligent robot based on switching local evolutionary PSO algorithm

摘要

Purpose This paper aims to present a novel particle swarm optimization (PSO) based on a non-homogeneous Markov chain and differential evolution (DE) for path planning of intelligent robot when having obstacles in the environment. Design/methodology/approach The three-dimensional path surface of the intelligent robot is decomposed into a two-dimensional plane and the height information in z axis. Then, the grid method is exploited for the environment modeling problem. After that, a recently proposed switching local evolutionary PSO (SLEPSO) based on non-homogeneous Markov chain and DE is analyzed for the path planning problem. The velocity updating equation of the presented SLEPSO algorithm jumps from one mode to another based on the non-homogeneous Markov chain, which can overcome the contradiction between local and global search. In addition, DE mutation and crossover operations can enhance the capability of finding a better global best particle in the PSO method. Findings Finally, the SLEPSO algorithm is successfully applied to the path planning in two different environments. Comparing with some well-known PSO algorithms, the experiment results show the feasibility and effectiveness of the presented method. Originality/value Therefore, this can provide a new method for the area of path planning of intelligent robot.