Robots play a crucial role in experimental smart cities and are ubiquitous in daily life, especially in complex environments where multiple robots are often needed to solve problems collaboratively. Researchers have found that the swarm intelligence optimization algorithm has a better performance in planning robot paths, but the traditional swarm intelligence algorithm cannot be targeted to solve the robot path planning problem in difficult problem. Therefore, this paper aims to introduce a fuzzy controller, mutation factor, exponential noise, and other strategies on the basis of particle swarm optimization to solve this problem. By judging the moving speed of different particles at different periods of the algorithm, the individual learning factor and social learning factor of the particles are obtained by fuzzy controller, and using the leader particle and random particle, designing a new dynamic balance of mutation factor, with the iterative process of the adaptation value of continuous non-updating counter and continuous updating counter to control the proportion of the elite individuals and random individuals. Finally, using exponential noise to update the matrix of the population every 50 iterations is a way to balance the local search ability and global exploration ability of the algorithm. In order to test the proposed algorithm, the main method of this paper is simulated on simple scenarios, complex scenarios, and random maps consisting of different numbers of static obstacles and dynamic obstacles, and the algorithm proposed in this paper is compared with eight other algorithms. The average path deviation error of the planned paths is smaller; the average distance of untraveled target is shorter; the number of steps of the robot movements is smaller, and the path is shorter, which is superior to the other eight algorithms. This superiority in solving multi-robot cooperative path planning has good practicality in many fields such as logistics and distribution, industrial automation operation, and so on.
Hu et al. (Tue,) studied this question.