Stochastic Fractal Search Algorithm and its Application in Path Planning

The UAV path planning problem is essentially a complex optimization problem with constraints. The stochastic fractal search algorithm shows good performance in solving complex continuous function optimization problems. It has certain advantages in terms of search accuracy and convergence speed. In this paper, the stochastic fractal search algorithm is applied to the UAV path planning, and the efficiency of the algorithm in searching the path in the planning space with different complexity is compared. Experimental results show that the algorithm can search for a feasible track between the starting point and the ending point, and has good real-time and robustness.