多梯度风险约束下基于改进A*算法的矿用无人车路径规划

Path planning for unmanned mining vehicles based on improved A* algorithm under multi-gradient risk constraints

  • 摘要: 针对现有矿用无人车路径规划算法在面对井下非结构化环境时路径平滑性差和潜在碰撞风险等问题,将多梯度风险约束与路径搜索深度融合,提出了一种面向矿用无人车路径规划的改进A*算法——RA−A*算法。基于风险势场将环境划分为障碍核心区、风险缓冲区与绝对安全区,构建多梯度风险地图,实现对巷道安全裕度的精细化表达。对传统A*算法的综合代价函数进行重构:在实际累积代价函数中融合风险值与转弯惩罚,使路径主动远离高风险区域并减少非必要转弯;在启发函数中引入风险预估项,实现对前方潜在危险的规避。引入多梯度风险地图动态更新与重规划机制,在检测到动态障碍物时实时更新多梯度风险地图并重新规划路径,以规避动态障碍物。采用三次B样条曲线并结合迭代碰撞检测机制对规划路径进行平滑处理。多场景仿真与井下实验结果表明:RA−A*算法规划的路径能够主动向低风险区域偏移;在面对静态障碍物时能够保持安全的避障距离,面对动态障碍物时能够重新规划并生成安全的绕行轨迹,且没有出现贴近巷道壁与障碍物的情况,同时在转角处的路径也较为平滑;RA−A*算法不仅降低了路径风险值、转角和及转弯次数,还提升了平均避障距离,保证了车辆在极端狭窄工况下仍能保持较大的最小避障距离。

     

    Abstract: To address the problems of poor path smoothness and potential collision risks in existing path planning algorithms for unmanned mining vehicles in unstructured underground environments, this paper proposed an improved A* algorithm for path planning of unmanned mining vehicles, namely the RA-A* algorithm, which integrated multi-gradient risk constraints with path search. Based on a risk potential field, the environment was divided into obstacle core zones, risk buffer zones, and absolute safety zones, and a multi-gradient risk map was constructed to provide a fine-grained representation of roadway safety margins. The comprehensive cost function of the traditional A* algorithm was reconstructed. Risk values and turning penalties were incorporated into the actual cumulative cost function, enabling paths to actively stay away from high-risk areas and reducing unnecessary turns. A risk prediction term was introduced into the heuristic function to avoid potential hazards ahead. A dynamic update and re-planning mechanism for the multi-gradient risk map was introduced. When dynamic obstacles were detected, the multi-gradient risk map was updated in real time, and the path was replanned to avoid the dynamic obstacles. Cubic B-spline curves combined with an iterative collision detection mechanism were used to smooth the planned paths. Multi-scenario simulations and underground experiments showed that the paths planned by the RA-A* algorithm could actively shift toward low-risk areas. The algorithm maintained a safe obstacle clearance distance when encountering static obstacles, replanned paths and generated safe detour trajectories when encountering dynamic obstacles, avoided approaching roadway walls and obstacles, and produced relatively smooth paths at corners. The RA-A* algorithm reduced path risk value, the sum of turning angles, and number of turns, while improving average obstacle clearance distance. It ensured that vehicles maintained a relatively large minimum obstacle clearance distance even under extremely narrow working conditions.

     

/

返回文章
返回