基于改进RRT算法的狭长空间无人车辆路径规划

Path planning of unmanned vehicles in narrow and long space based on improved RRT algorithm

  • 摘要: 针对狭长空间无人车辆路径规划系统,提出一种基于改进的快速搜索随机树(rapidly-exploring random trees,RRT)路径规划算法,以解决传统RRT算法随机性较大、路径缺乏安全性的问题. 该算法通过加入自适应目标概率采样策略、动态步长策略对传统的RRT算法进行改进,同时考虑到实际情况中无人驾驶车辆的动力学约束,该算法加入车辆碰撞约束和路径转角约束,并针对转角约束会导致迭代次数激增的问题提出了一种限制区域内随机转向的策略,最终得到一条安全性较高的路径. 采用计算机仿真对所提算法和现有算法的性能进行对比验证. 所提算法在狭长空间相较于传统人工势场引导下的RRT算法迭代次数降低了33.09%,规划时间减少了6.44%,路径长度减少了0.06%,并且在简单环境和复杂障碍物环境下规划能力均有提升. 所提算法规划效率更高、迭代次数更少.

     

    Abstract: A path planning algorithm based on improved rapidly-exploring random trees (RRT) is proposed for the path planning system of unmanned vehicles in narrow and long space, which solves the problems of large randomness and lack of safety of the traditional RRT algorithm. The algorithm improves the traditional RRT algorithm by adding adaptive target probability sampling strategy and dynamic step size strategy. At the same time, considering the dynamics constraints of driverless vehicles in the actual situation, the algorithm adds vehicle collision constraints and path angle constraints, and proposes a random turning strategy within the restricted area to solve the problem that the angle constraints will lead to the multiplication of iterations, and a path with higher safety is finally obtained. The performance of the proposed algorithm is compared with existing algorithms by computer simulation. Compared with the traditional RRT algorithm guided by artificial potential field in narrow and long space, the iteration times, planning time and path length of the proposed algorithm are reduced by 33.09%, 6.44% and 0.06%, and the planning ability of the proposed algorithm is improved in both simple environment and dense obstacle environment. The proposed algorithm has higher planning efficiency and fewer iteration .

     

/

返回文章
返回