左国玉, 陈国栋, 刘月雷, 龚道雄, 李剑锋. 基于均匀概率的目标启发式RRT机械臂路径规划方法[J]. 北京工业大学学报, 2022, 48(8): 812-821. DOI: 10.11936/bjutxb2021040019
    引用本文: 左国玉, 陈国栋, 刘月雷, 龚道雄, 李剑锋. 基于均匀概率的目标启发式RRT机械臂路径规划方法[J]. 北京工业大学学报, 2022, 48(8): 812-821. DOI: 10.11936/bjutxb2021040019
    ZUO Guoyu, CHEN Guodong, LIU Yuelei, GONG Daoxiong, LI Jianfeng. Target Heuristic RRT Based on Uniform Probability for Manipulator Path Planning[J]. Journal of Beijing University of Technology, 2022, 48(8): 812-821. DOI: 10.11936/bjutxb2021040019
    Citation: ZUO Guoyu, CHEN Guodong, LIU Yuelei, GONG Daoxiong, LI Jianfeng. Target Heuristic RRT Based on Uniform Probability for Manipulator Path Planning[J]. Journal of Beijing University of Technology, 2022, 48(8): 812-821. DOI: 10.11936/bjutxb2021040019

    基于均匀概率的目标启发式RRT机械臂路径规划方法

    Target Heuristic RRT Based on Uniform Probability for Manipulator Path Planning

    • 摘要: 针对多自由度机械臂在三维空间中轨迹规划的高复杂性、安全性和可靠性等问题,基于快速扩展随机树(rapidly-exploring random trees, RRT)算法在高维空间中的概率完备性和计算轻量性等优势,提出了一种基于均匀概率的目标启发式RRT(target heuristic RRT based on uniform probability, PH-RRT)方法. 首先,该方法基于均匀概率的分配机制选取概率采样阈值作为节点标准,并与随机采样值进行比较. 当随机采样值在设定的阈值范围内时,确定目标点为随机点进行节点扩展. 当随机采样值在设定的阈值范围外时,随机生成随机点,在目标重力和随机点重力的目标启发式作用下进行节点扩展. 然后,在已规划出的路径的基础上,进一步引入广度优先搜索思想,针对规划出的路径进行优化处理,提高了路径平滑度并减少了路径长度. 实验结果表明,该方法能较好地解决传统RRT方法固有的盲目搜索问题,减少路径规划时间和路径长度,提高机械臂的路径规划效率.

       

      Abstract: To solve the problem of high complexity, safety and reliability of multi-DOF manipulator trajectory planning in three-dimensioned space, based on the advantages of probability completeness and lightweight of rapidly-exploring random trees (RRT) algorithm in high-dimensioned space, a target heuristic RRT based on uniform probability (PH-RRT) was proposed. First, the threshold of probabilistic sampling was selected as the node standard based on the distribution mechanism of uniform probability, and it was compared with the random sampling value. When the random sampling value was within the set threshold value range, the target point was determined as a random point for node expansion. When the random sampling value was outside the set threshold range, random point was randomly generated, and the new node expanded under the target heuristic of the target gravity and the random point gravity. Then, based on the planned path, the breadth-first search idea was introduced to optimize the planned path to improve the smoothness of the path and reduce the length of the path. Experimental results show that the proposed method can well solve the problem of traditional method of RRT inherent blind search, and reduce the time of path planning and path length to improve the efficiency of path planning of manipulator.

       

    /

    返回文章
    返回