基于RRT改进的智能车辆路径规划算法

来源:用户上传      作者:

　　摘   要：針对RRT算法随机性大、收敛速度慢和偏差性的问题，采用双向随机树和多棵局部随机树的探索与合并。增加引力分量，使双向随机树朝着各自目标方向生长，减少了算法的随机性。基于障碍物周围均匀生成若干根节点，对根节点增加斥力分量，生成多棵局部随机树。快速寻找可通行的路径，减少扩展过程中对障碍物的检测时间，加快算法的收敛速度，改善了算法的偏差性。用MATLAB进行虚拟仿真，验证了该算法的正确性。
　　关键词：智能车辆;快速搜索随机树;路径规划;障碍物斥力函数
　　中图分类号：TP242                                            文献标识码：A
　　Improved Intelligent Vehicle Pathing Planning Algorithm Based on RRT
　　SHI Yang-yang，YANG Jia-fu？覮，BU Sheng-qiang，ZHU Lin-feng
　　（College of Mechanical and Electronic Engineering，Nanjing Forestry University，Nanjing，Jiangsu 210037，China）
　　Abstract：Aimed at the problems of large randomness，slow convergence rate and deviation of RRT algorithm，the exploration and merging of bidirectional random tree and multiple local random tree are proposed，which increases the gravitational component and makes bidirectional random tree grow in the direction of the respective target，reducing the randomness. Several root nodes are evenly generated around obstacles，and the repulsion component is added to the root node to generate multiple local random trees. Through this method，the accessible path can be quickly searched，the detection time of obstacles in the expansion process can be reduced，the convergence speed of the algorithm can be accelerated，and the deviation of the algorithm can be improved. The improved algorithm is simulated by MATLAB software，which verifies its correctness.
　　Key words：intelligent vehicle;RRT（Rapidly-Exploring Random Tree）;path planning;obstacle repulsion function
转载注明来源:https://www.xzbu.com/8/view-15295907.htm