改进双向A∗算法的碰撞规避路径规划研究OA

Indoor service robots often require long path planning time and exhibit dangerous behaviors such as approaching or diagonally traversing obstacles during navigation.To address these issues,this paper proposes a path planning method integrating bidirectional search with collision avoidance.First,the bidirectional search method is employed to reduce the search time of A∗ algorithm.Then,the heuristic function is improved by introducing an environmental obstacle rate,defined as the obstacle occupancy ratio in the workspace,to adaptively adjust weight coefficients.Next,a safety distance constraint is introduced for collision avoidance to prevent robots from diagonally traversing obstacles.The path is further optimized via polyline simplification,reducing both the number of nodes and the total length of polyline segments.Moreover,Bezier curves smoothing is applied to optimize path turns,thereby enhancing motion stability.Finally,experiments are conducted in Matlab to compare the proposed algorithm with the conventional A∗algorithm.Results show the path length is reduced by 5.2％and 3.9％,the search time by 56.4％and 55.9％,turning angles by 39.4％and 28.8％,and the number of traversed nodes by 71.8％and 68.3％.