Route planning algorithm based on D* in iron and steel logistics
Logistics enterprises realize vehicle route patrol through route planning,so as to complete the real-time planning of convenient and reliable vehicle route in the work scene.The aim of this study is to design a path planning algorithm based on improved D*for steel logistics distribution scenario.Constraints are imposed on candidate child nodes by the algorithm to prevent the vehicle from oblique through the slit between the two obstacles,and a penalty factor for turning points is introduced to avoid planning paths that deviate significantly from the ideal path,minimizing turning behavior as much as possible.This algorithm is designed to avoid unnecessary turning of vehicles to improve the efficiency and safety of large-scale loading and unloading vehicles.Simulation tests are conducted using the method of random obstacles,and the results show that the path security designed by the proposed path planning algorithm is better than that of the existing algorithms.Finally,this algorithm will be applied to steel logistics distribution to improve the efficiency of steel enterprise logistics distribution.
NETL
NSTL
万方数据
维普
