基于分层采样搜索的轮式移动机械臂全身规划方法
DOI:
CSTR:
作者:
作者单位:

1.哈尔滨理工大学自动化学院哈尔滨150080; 2.哈尔滨理工大学黑龙江省复杂智能系统与集成重点实验室 哈尔滨150080; 3.哈尔滨工业大学机电工程学院哈尔滨150001

作者简介:

通讯作者:

中图分类号:

TP24TH39

基金项目:

黑龙江省自然科学基金(PL2025E050)、黑龙江省省属本科高校优秀青年教师基础研究支持计划(YQJH2025073)项目资助


Whole-body planning method for wheeled mobile manipulators based on hierarchical sampling search
Author:
Affiliation:

1.School of Automation, Harbin University of Science and Technology, Harbin 150080, China; 2.Heilongjiang Provincial Key Laboratory of Complex Intelligent System and Integration, Harbin University of Science and Technology, Harbin 150080, China; 3.School of Mechatronics Engineering, Harbin Institute of Technology, Harbin 150001, China

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对室内非结构化环境中存在最小转弯半径限制且无法侧向瞬时平移的非完整约束轮式移动机械臂,其全身运动规划的解决方案则面临着诸多挑战:现有分离方法常因基座与机械臂运动规划脱节而导致最终路径的割裂问题;而高维采样方法又因配置空间维度过高,则存在计算效率低与实时性差等问题,为此提出一种创新性的分层路径规划方法。该方法首先采用一种改进的快速探索随机树(RRT)算法,该算法直接嵌入非完整约束模型,并通过同步搜索前向与后向解空间来避免冗余计算,从而生成携带时空信息的无碰撞基座路径。其次,基于此路径上各时序节点对应的、满足关节极限与静态无碰撞等条件的机械臂可行解集合,采用时序节点集约束RRT算法生成与基座运动严格同步的机械臂路径。最后,通过索引对齐路径点将两者合成完整的机器人全身运动路径。通过ROS仿真与实物实验表明,所提算法通过解耦高维规划问题,能够在复杂受限环境下协调移动基座与机械臂的运动,实时生成全程无碰撞的全身运动轨迹。实验结果显示,该算法在规划时间、路径长度与平滑度等方面均表现出显著优势,与RRT*-Connect算法相比,在复杂场景中,规划时间平均缩短29.16%,路径长度减少16.68%,路径平滑度提升56.13%。

    Abstract:

    Wheeled mobile manipulators operating in indoor unstructured environments, which are subject to nonholonomic constraints such as a minimum turning radius and the inability to perform instantaneous lateral translation, face significant challenges in whole-body motion planning. Existing decoupled approaches often result in fragmented final paths due to the disconnected planning between the base and the manipulator. Meanwhile, high-dimensional sampling methods suffer from low computational efficiency and poor realtime performance. To address these problems, an innovative hierarchical path planning method is proposed. The method first employs an improved bidirectional dual-tree rapidly-exploring random tree (RRT) algorithm. This algorithm directly incorporates a nonholonomic constraint model and simultaneously explores both forward and backward solution spaces to eliminate redundant computation, thereby generating a collision-free base path embedded with spatiotemporal information. Subsequently, for each temporal node along this base path, a set of feasible manipulator configurations is defined, all satisfying conditions including joint limits and static collision avoidance. Using these sets, a temporal-node-constrained RRT algorithm generates a manipulator path that is strictly synchronized with the base motion. Finally, the complete whole-body motion path is synthesized by aligning the base and manipulator waypoints through index matching. Both ROS simulations and physical experiments show that the algorithm proposed decouples the high-dimensional planning problem, enabling coordinated motion of the mobile base and manipulator in complex constrained environments while generating collision-free trajectories throughout the entire motion in real time. The experimental results indicate that the algorithm has significant advantages in planning time, path length, and smoothness. Compared with the RRT*-Connect algorithm, in complex scenarios, the proposed approach reduces planning time by 29.16% on average, decreases path length by 16.68%, and improves path smoothness by 56.13%.

    参考文献
    相似文献
    引证文献
引用本文

李佳钰,胡迎庆,杨怀广,周如意,尤波.基于分层采样搜索的轮式移动机械臂全身规划方法[J].仪器仪表学报,2026,47(5):59-70

复制
分享
相关视频

文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2026-07-24
  • 出版日期:
文章二维码