A probability adaptive random sampling algorithm based on RRT for collision-free motion planning
Mi, Kai1,2; Zheng, Jun2; Wang, Yunkuan2
2019-07
会议日期2019.7.27-2019.7.30
会议地点中国广东省广州市
英文摘要

In recent years, with the increasingly complex robot application environments, the research of robotic autonomous obstacle avoidance motion planning is one of the key technologies to improve its intelligence. In this paper, we present an improved algorithm based on Rapidly-exploring Random Tree (RRT) algorithm, which is called Probability Adaptive RRT (PARRT). We analyze the defects of the original algorithm in detail from the perspective of Voronoi diagram. For some complicated occasions, especially when the robot is surrounded by obstacles, the efficiency of the original algorithm will be greatly reduced. For this problem, we proposed an expansion probability adaptive method. By dynamically adjusting the extending probability of nodes near obstacles, the invalid node expansion is reduced effectively and the planning speed is greatly improved. Finally, we experiment in both two-dimensional space and the joint space of manipulators. The planning results show the improved effect of the proposed algorithm.

内容类型会议论文
源URL[http://ir.ia.ac.cn/handle/173211/39197]  
专题自动化研究所_智能制造技术与系统研究中心_智能机器人团队
通讯作者Zheng, Jun
作者单位1.中国科学院大学
2.中国科学院自动化研究所
推荐引用方式
GB/T 7714
Mi, Kai,Zheng, Jun,Wang, Yunkuan. A probability adaptive random sampling algorithm based on RRT for collision-free motion planning[C]. 见:. 中国广东省广州市. 2019.7.27-2019.7.30.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace