高级检索

基于改进RRT算法的六自由度机械臂路径规划

Path Planning of 6-DOF Manipulator Based on Improved RRT Algorithm

  • 摘要: 针对快速扩展随机树(RRT)算法路径代价大、采样过程慢的问题,提出1种改进的RRT算法对六自由度机械臂进行路径规划。结合RRT*和RRT-connect算法的优点,应用目标采样的思想加强算法向目标点搜索的趋向性,引入贪婪思想提高算法效率,结合五次B样条插值对路径进行平滑优化,缩短规划路径的时间及长度;利用Python中的matplotlib功能包统计RRT与改进的RRT算法规划所需时长、采样点数与路径长度,且在ROS平台中利用动态规划库进行算法配置,验证改进算法的路径规划效果。结果表明:相比传统RRT算法,采用所提改进算法对六自由度机械臂进行路径规划,在平均路径长度上缩短了29.5%、在规划路径时间上缩短了8.5%,路径规划成功率提高至96.7%,验证了该算法在实际应用中的可行性。

     

    Abstract: An improved rapidly-expanding random tree (RRT) algorithm was proposed to plan the path of a six degree of freedom (DOF) robotic arm in response to the problem of high path cost and slow sampling process in the RRT algorithm. Combining the advantages of RRT * and RRT-connect algorithms, the target sampling was applied to enhance the tendency of the algorithm to search for target points, the greedy thinking was introduced to improve the efficiency of the algorithm, and the quintic B-spline interpolation was combined to optimize the path smoothness, shorten the path planning time and length. The matplotlib function pack in Python was used to calculate the time, number of sampling points, and path length required for RRT and improved algorithm planning, as well as the dynamic planning library for algorithm configuration on the ROS platform was used to verify the path planning effect of the improved algorithm. The results show that compared with the traditional RRT algorithm, the path planning of the six DOF robotic arm by the proposed improved algorithm shortens the average path length by 29.5%, the planning path time is shortened by 8.5%, and the success rate of path planning is increased to 96.7%,which verifies the feasibility of the algorithm in practice.

     

/

返回文章
返回