Dynamic Path Planning of AGV Based on Kinematical Constraint A* Algorithm and Following DWA Fusion Algorithms

Abstract

In the field of AGV, a path planning algorithm is always a heated area. However, traditional path planning algorithms have many disadvantages. To solve these problems, this paper proposes a fusion algorithm that combines the kinematical constraint A* algorithm and the following dynamic window approach algorithm. The kinematical constraint A* algorithm can plan the global path. Firstly, the node optimization can reduce the number of child nodes. Secondly, improving the heuristic function can increase efficiency of path planning. Thirdly, the secondary redundancy can reduce the number of redundant nodes. Finally, the B spline curve can make the global path conform to the dynamic characteristics of AGV. The following DWA algorithm can be dynamic path planning and allow the AGV to avoidance moving obstacle. The optimization heuristic function of the local path is closer to the global optimal path. The simulation results show that, compared with the fusion algorithm of traditional A* algorithm and traditional DWA algorithm, the fusion algorithm reduces the length of path by 3.6%, time of path by 6.7% and the number of turns of final path by 25%.

Applications of Autonomous Navigation Technologies for Unmanned Agricultural Tractors: A Review

“…Khan and Mahmood [68] combined two heuristic search algorithms, i.e., simulated annealing and ant colony algorithms, to improve the global search performance and time efficiency, demonstrating good practicality and robustness. Yin et al [69] proposed a dynamic path planning method that integrated improved A* and dynamic window approach (DWA) algorithms. This achieved highly intricate and challenging robot path planning by avoiding obstacles, calculating optimal paths in real time, and maintaining high real-time performance and robustness.…”

Localized Path Planning for Mobile Robots Based on a Subarea-Artificial Potential Field Model

“…Meanwhile, to reduce the risk of collision, an Obstacle Expansion Area (OEA) with a radius of ROEA was set in the area around the APO [23,32] (Obstacle Expansion Area, OEA), as shown in Figure 2. The calculation of ROEA is shown in Equation (1) [22,28,29]. To simplify the schematic diagram, the AMR is treated as a particle in this article.…”

“…In recent years, with the rapid development of intelligent control and artificial intelligence, AMRs have been applied in fields such as mineral exploration, military reconnaissance, cargo handling, and industrial production [ 1 ]. During the execution of tasks, AMRs encounter various obstacles, and the question of how to plan a reasonable path to enable them to efficiently avoid obstacles and reach their destination safely has become one of the hot topics in AMR path-planning technology [ 2 ].…”