Research on path planning algorithm of takeaway robots for terminal delivery
Yuhang Wan · IET conference proceedings. · 2025
Takeaway delivery has become an important part of urban life. However, terminal deliveries are often blocked by security measures that often prevent them from arriving on time. Designing a takeaway delivery robot can solve this problem to a large extent. In this paper, path planning algorithm level of designing a takeaway robot is researched. In this paper, the research is carried out by closely focusing on the current stage of the path planning algorithm related difficulties. Three typical algorithms are selected for simulation testing within the scope of graph search algorithms. These three algorithms are Dijkstra algorithm, A* algorithm and rapidly-exploring random tree (RRT) algorithm. The final comparison is made with the simulation test results. And to find the optimal path planning algorithm for takeaway delivery robots within the range of graph search algorithms. This paper provides a reference for the path planning algorithm level of takeaway delivery robot design. At the same time, it helps to improve the delivery service of takeaway terminal.