Path planning and simulation of transplanting machine replenishment based on two-way Dijkstra algorithm

In order to improve the automation level of transplanting machine replanting operation,the path planning of transplanting machine replanting was studied.Firstly,the replanting of transplanting machine was analyzed and the path planning simulation map was established.Then,a bidirectional Dijkstra algorithm was proposed,and the secondary optimization was carried out to realize the node sorting,and the obstacle avoidance function was realized with the A*algorithm.Finally,based on C+ + programming and OpenCV,the algorithm function was realized and the algorithm simulation was realized by image rendering.The simulation results show that using the improved two-way Dijkstra algorithm to plan the path,the path moving distance decreases by 14.74% on average,the number of turns decreases by 8% on average,and the moving time decreases by 13.41% on average.Bidirectional Dijkstra algorithm is better than Dijkstra algorithm in planning target node order.Therefore,the improved algorithm can realize better path planning of transplanting machine replanting,improve the efficiency of transplanting machine replanting,and provide an important reference for the research of replanting path planning.