...
首页> 外文期刊>Proceedings of the Institution of Mechanical Engineers, Part C. Journal of mechanical engineering science >Adaptive rapidly-exploring random tree for efficient path planning of high-degree-of-freedom articulated robots
【24h】

Adaptive rapidly-exploring random tree for efficient path planning of high-degree-of-freedom articulated robots

机译:自适应快速探索随机树,用于高自由度多关节机器人的有效路径规划

获取原文
获取原文并翻译 | 示例
           

摘要

This article proposes a method for the path planning of high-degree-of-freedom articulated robots with adaptive dimensionality. For efficient path planning in a high-dimensional configuration space, we first describe an adaptive body selection that selects the robot bodies depending on the complexity of the path planning. Then, the involved joints of the selected body are included in the planning process. That is, it builds the C-space (configuration space) with adaptive dimensionality for sampling-based path planner. Next, by using adaptive body selection, the adaptive rapidly-exploring random tree (RRT) algorithm is introduced, which incrementally grows RRTs in the adaptive dimensional C-space. We show through several simulation results that the proposed method is more efficient than the basic RRT-based path planner, which requires full-dimensional planning.
机译:本文提出了一种具有自适应维数的高自由度多关节机器人的路径规划方法。为了在高维配置空间中进行有效的路径规划,我们首先描述一种自适应体选择,该选择根据路径规划的复杂性来选择机器人体。然后,所选实体的相关关节将包括在计划过程中。即,它为基于采样的路径规划器构建具有自适应维数的C空间(配置空间)。接下来,通过使用自适应主体选择,引入了自适应快速探索随机树(RRT)算法,该算法在自适应维C空间中增量增长RRT。我们通过几个仿真结果表明,所提出的方法比基于RRT的基本路径规划器更有效,后者需要进行全方位规划。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号