The RRT algorithm is widely used in path planning due to its high efficiency in searching high-dimensional space. However, RRT will sample the entire workspace when sampling, resulting in many invalid sampling points, thus greatly increasing the planning time. To overcome these problems, we proposed OGRRT-Connect, an improved RRT algorithm based on opposite guided sampling, which has higher sampling efficiency and planning speed. Referred to the RRT-Connect algorithm, the algorithm expands two trees simultaneously. When the tree grows, the idea of triangular shrinkage guided sampling is introduced to limit the sampling area, improve sampling efficiency, and reduce planning time. Finally, we conducted robotic simulation experiments to prove the superiority of the algorithm in time planning and path nodes. Furthermore, we applied the algorithm to a real robot to demonstrate our proposed method.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

OGRRT-Connect: An Improved RRT Algorithm Based on Opposite Guided Sampling

  • Yilong Wu,
  • Shuxin Xie,
  • Zhenhua Wang,
  • Chao Liu,
  • Guodong Chen,
  • Lining Sun

摘要

The RRT algorithm is widely used in path planning due to its high efficiency in searching high-dimensional space. However, RRT will sample the entire workspace when sampling, resulting in many invalid sampling points, thus greatly increasing the planning time. To overcome these problems, we proposed OGRRT-Connect, an improved RRT algorithm based on opposite guided sampling, which has higher sampling efficiency and planning speed. Referred to the RRT-Connect algorithm, the algorithm expands two trees simultaneously. When the tree grows, the idea of triangular shrinkage guided sampling is introduced to limit the sampling area, improve sampling efficiency, and reduce planning time. Finally, we conducted robotic simulation experiments to prove the superiority of the algorithm in time planning and path nodes. Furthermore, we applied the algorithm to a real robot to demonstrate our proposed method.