Path planning of mobile robot based on IFWA-CS algorithm fusion
In order to solve the problem of the basic fireworks algorithm(FWA),the convergence speed is slow in the path planning of mobile robots,and it is easy to fall into the shortcomings of local optimization.In this paper,the RRT algorithm and FWA algorithm are combined to improve the initial speed of the algorithm.Secondly,in view of the slow convergence speed of FWA algorithm,the selection mechanism combining elite selection and roulette method is adopted in its selection operation to enhance the local search ability of the algorithm.Finally,the adaptive Levy flight strategy is used to improve its vulnerability to local prob-lems.Simulation results show that the path length and convergence speed of the fusion algorithm in this paper are improved,which has good practicability in the path planning of mobile robots.
path planningmobile robotsfireworks algorithmadaptive Levy flight
NETL
NSTL
万方数据
