Research on Logistics Path Planning Based on Improved Local Path Planning Algorithm

Logistics path planning technology is one of the key technologies of logistics logistics system, which has important research value. Scholars at home and abroad have carried out extensive research on logistics path planning, and proposed intelligent optimization algorithms, heuristic algorithms, sampling algorithms and other path planning methods. However, there are still many problems in the existing research results, for example, the existing methods are mostly based on the path planning problem of logistics as the research object, without considering the cooperative operation of the path in the actual operation scenario. Moreover, the existing logistics path planning algorithms are less efficient and have the risk of falling into local optimization. Aiming at the above problems, this paper proposes an efficient logistics path planning method for multi-logistics operation scenarios, which realizes the planning path close to the optimum and avoids the logistics conflict problem at the same time. In this paper, we optimize the redundant turning points of the local path planning algorithm due to the limitation of the expansion direction, and at the same time extend its evaluation function to realize the integration of the algorithm. The length of the planning path of the improved algorithm is shortened by <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{3 5. 4 \%}$</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{2 5. 8 \%}$</tex> respectively, and the completion time of the task is reduced by 10.2 % and 6.4 % respectively, which verifies that the improved algorithm has certain optimization effect.