A Hierarchical Graph Search Method for Path Planning of Unmanned Ground Vehicle for Freight Transportation

For the problem of collision volume change when forklift unmanned vehicles work in complex storage environments, a multi-level graph search path planning method is proposed. The first level is the path planning of the Unmanned Ground Vehicle (UGV) body, which uses the grid map and the A * algorithm to plan the path of the UGV transferring in the scene; the second level is the joint path planning of the UGV and the object being carried, to avoid overcomplicating this issue, the unmanned vehicle will be limited to pushing the cargo only forwards. The third level is the path planning when the unmanned vehicle carries multiple objects, which decomposes the whole scene into multiple sub-scenes, plans the paths of the unmanned vehicle in the sub-scenes separately, and searches for the optimal combination of sub-scenes. Higher level searches will invoke lower level algorithms and provide a virtual scene and target as input. The experimental results show that this multilevel path planning method is optimal and complete in solving the forklift unmanned vehicle for handling a single object, and can give a feasible solution for handling multiple objects.