变概率双向RRT改进路径规划算法

An Improved Path Planning Algorithm With Variable Probability Bidirectional RRT

针对RRT算法收敛速度慢、路径不规则的问题,基于双向RRT算法和概率搜索策略,提出了一种变概率策略下的双向RRT搜索优化算法。该算法根据搜索节点的不同周边状态,采用不同的概率策略扩展目标点,使搜索算法能够在空旷场景下向目标点快速生成,同时避免了路径陷入局部最小值的问题。在完成初次路径搜索后,根据路径节点位置优化不规则路线,减少小车行驶过程中的拐弯次数和总路径长度。在仿真中进行了多场景重复试验测试,仿真结果表明,改进后的算法在搜索速度和路径长度上有明显改善。

To deal with the problems of slow convergence speed and the irregular searching path of the RRT algorithm, a variable probability search strategy optimization algorithm based on the bidirectional RRT was proposed. This bidirectional RRT algorithm searched different surrounding states of nodes, then extended the target point with different probability strategies. Therefore, this algorithm could rapidly converge to the target in the open environment as well as avoid falling into local minimum. After the initial path search was completed, the irregular route was optimized according to the location of the path node, and the number of turning times during the car driving and the length of the total path were effectively reduced.The multi scene repeated test was carried out in the simulation, and the simulation results showed that this algorithm had a significant improvement in the search speed and path length.