In order to further improve the operational efficiency and the flexibility of automated warehouse, a path planning algorithm for a warehouse handling robot was evaluated. Under the background of determining the operation scene and environment of multihandling robot, a path planning algorithm with time window is proposed for multihandling robot, and a two-stage path planning method is also analyzed. The results show that the route planning using the improved Dijkstra algorithm saves 7.16 meters compared with the traditional algorithm, and the task is completed 3.17 seconds earlier. Comprehensively considering the heat of the various paths to turn to the required time, using the improved Dijkstra algorithm path, handling the robot’s total running distance than the traditional algorithm saves 14.45 meters, the total run time saves 8.45 seconds, and whether in time or in the distance, crane robot handling efficiency compared with the traditional algorithm has an obvious increase, closer to reality.