融合碰撞脱困机制与动态高斯采样的机械臂路径规划算法
DOI:
CSTR:
作者:
作者单位:

哈尔滨理工大学自动化学院哈尔滨150080

作者简介:

通讯作者:

中图分类号:

TP242TH862

基金项目:

黑龙江省自然科学基金项目(YQ2024E047)、黑龙江省优秀青年教师基础研究支持计划项目(YQJH2024067)资助


Robotic arm path planning based on dynamic Gaussian sampling and collision recovery
Author:
Affiliation:

School of Automation, Harbin University of Science and Technology, Harbin 150080, China

Fund Project:

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

    针对传统路径规划算法存在采样效率低、环境适应性差、收敛速度慢的问题,提出了一种融合碰撞脱困机制与动态高斯采样的机械臂路径规划算法。首先,通过引入动态调节的混合高斯采样策略,融合碰撞脱困、障碍物规避、目标导向及均匀探索4种高斯采样分量,通过实时评估连续碰撞次数、与目标的距离等状态,自适应地调整各分量权重,将采样点集中于合适的区域,从而在全局探索与局部脱困之间取得动态平衡,显著提升复杂环境下的采样效率。其中,碰撞脱困分量根据碰撞次数和位置,缩小采样范围至可行空间,提高脱困效率。其次,针对不同的局部环境,提出多级自适应步长扩展机制,该机制综合考虑连续碰撞反馈、局部障碍物密度及全局规划进程,有效减少狭窄空间中的反复碰撞与在开阔区域的低效探索。最后,通过融合K维树(KD-Tree)索引机制、去冗余机制与早停机制的联合优化策略,显著提升算法的计算效率与收敛速度。仿真实验表明,与动态变采样区域RRT路径规划算法(DVSA-RRT)相比,本算法在狭窄通道地图中规划时间减少了87.41%,采样点数减少了91.01%,路径长度缩短了7.46%,能够高效地规划出安全、平滑且渐近最优的路径。此外,基于机械臂实物平台的实验验证了该算法在实际场景中的有效性,所规划的路径能够满足机械臂表面粗糙度测量的任务需求。

    Abstract:

    To address the low efficiency, poor adaptability, and slow convergence of traditional path planning algorithms, this paper proposes a robotic arm path planning method integrating collision recovery with dynamic Gaussian sampling. The method employs a mixed Gaussian sampling strategy that dynamically adjusts weights for four components: Collision recovery, obstacle avoidance, goal-biasing, and uniform exploration. By evaluating real-time states such as consecutive collisions and goal proximity, it strikes a dynamic balance between global exploration and local recovery, significantly enhancing sampling efficiency in complex environments. The collision recovery component further enhands performance by narrowing the sampling range to the feasible space based on collision frequency and position. Furthermore, a multi-level adaptive step-size extension mechanism is introduced, which adjusts to local environments by considering collision feedback, obstacle density, and global planning progress. This reduces repeated collisions in narrow passages and inefficient exploration in open areas. Finally, a joint optimization strategy combining a K-dimensional tree (KD-Tree), redundancy removal, and an early-stopping mechanism boosts computational speed and convergence. Simulation results indicate that compared with dynamic variable sampling area RRT (DVSA-RRT), the proposed method reduces planning time by 87.41%, sampling nodes by 91.01%, and path length by 7.46% in narrow passages, while generating safe, smooth, and asymptotically optimal paths. Moreover, physical experiments verify its effectiveness in actual scenarios, ensuring the planned paths meet surface roughness measurement requirements.

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

孙明晓,李强,栾添添,贲放,张秋雨.融合碰撞脱困机制与动态高斯采样的机械臂路径规划算法[J].仪器仪表学报,2026,47(3):314-322

复制
分享
相关视频

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