Robot path planning method based on improved fireworks explosion algorithm

Abstract

The invention discloses a robot path planning method based on an improved fireworks explosion algorithm. The method comprises the steps of initializing a fireworks population, and generating multiplepaths of a robot from an origin to a destination; performing mutation operation on the fireworks population; moving each fireworks path to the position of a first optimal fireworks path according to acrossover probability; mapping the fireworks paths covering infeasible regions; selecting a second optical fireworks path; judging whether a current iteration number reaches the maximum, and if yes,outputting the second optical fireworks path; and otherwise, further selecting the N-1 fireworks paths from the mapped fireworks population for explosion, generating the new path of the robot from theorigin to the destination, and thus acquiring the next generation fireworks population. Through defining the crossover probability, each fireworks path has a certain probability of being crossed withthe optimal fireworks path, and moves to the position of the optimal fireworks path, the convergence speed is improved, the robot path planning speed is improved, and the path planning efficiency isimproved.

Description

technical field [0001] The invention relates to the technical field of automatic control, in particular to a robot path planning method based on an improved fireworks explosion algorithm. Background technique [0002] At present, there are two types of methods for path planning of mobile robots: traditional algorithms and intelligent algorithms. Traditional algorithms include free space method, visualization method, grid method and so on. With the deepening of the research, it is found that the traditional algorithms have certain limitations. For example, the grid method is to divide the robot's motion space into grids of the same size, and then plan the path. However, the division of the grid is directly related to the accuracy of the actual environment, which is a difficult decision. [0003] In recent years, with the gradual development and application of intelligent algorithms, new solutions have been provided for path planning. Commonly used intelligent algorithms in...

AI Technical Summary

Problems solved by technology

Commonly used intelligent algorithms include genetic algorithm, particle swarm algorithm, ant colony algorithm, neural network algorithm, etc. Although these algorithms can solve the robot path planning problem, they are still in an immature development period, and there is a problem of low robot path planning efficiency.

Images