By figure 5-7, the two algorithms a

By figure 5-7, the two algorithms are able to realize the path planning of AGV from start to finish, but in figure 5-7 (a), 8 search neighborhood a * algorithm in path planning process, vulnerable to the movement direction on the limitation of some obstacles, lead to complex search node, planning out the path of the turning point, turning the problem such as too many times, the path is not smooth, Meanwhile, the planned path length is not optimal. According to the path planning results of searching neighborhood A* algorithm in Figure 5-7(b)32, the improved algorithm has some changes in the path selection. The path is obviously better than the path planned by searching neighborhood A* algorithm in terms of the number of turning points and the smoothness of the path.