高级检索+

基于采摘点聚类和TR-RRT*的红花采摘路径规划

Safflower harvesting path planning based on harvest-point clustering and TR-RRT*

  • 摘要: 针对红花采摘机械臂在非结构化环境中采摘效率低、路径规划速度慢及路径平滑性差等问题,该研究提出了一种基于采摘区域聚类划分方法和目标重定向快速探索随机树(TR-RRT*:target redirecting rapidly-exploring random tree star)路径规划算法。首先,基于红花果球在自然状态下的空间分布特征,设计了有效采摘面积为5 cm×20 cm的对辊式末端执行器,并通过采摘点聚类将作业区域划分为多个子区域,确保每个聚类可覆盖1~3朵红花。在此基础上,在双向RRT*(Bidirectional-RRT*)框架中引入目标重定向策略、目标直达与偏转扩展策略以及人工势场切向逃逸力策略,以提升路径搜索效率与避障性能;进一步采用贪婪跳点策略、插值曲率优化与B样条曲线拟合,保障机械臂运动路径的连续与平滑。仿真结果表明,TR-RRT*算法在复杂障碍环境下具有明显优势:路径长度(3892.05mm)较对比算法IBI-P-RRT*(4284.44mm)(改进人工势场法引导的双向扩展随机树)与BI-RRT*(4240.45mm)分别缩短9.16%与8.22%;平均规划时间(0.3s)仅为RRT*(3.78s)的7.94%与BI-RRT*(0.43s)的69.77%,BI-RRT*与BI-APF-RRT*(人工势场法引导的双向扩展随机树)算法的转向角度(37.51°、39.61°)分别为本算法(30.63°)的1.22与1.29倍,表明路径平滑性得到明显改善。实际采摘试验进一步验证了所提红花采摘区域聚类方法与TR-RRT*算法的有效性,机械臂从初始位置至首个目标点耗时3.64 s,任务间平均转移时间为3.12 s,能够实现红花的稳定、高效采摘。

     

    Abstract: To address the challenges of low picking efficiency, slow path planning, and poor path smoothness of robotic arms for safflower harvesting in unstructured environments, this study introduced a picking area clustering method and a Target redirecting rapidly-exploring random tree (TR-RRT*) path planning algorithm. First, based on the spatial distribution characteristics of safflower seed balls under natural conditions and a spatial analysis of roller-based picking operations, a roller-based end-effector with an effective picking area of 5 cm × 20 cm was designed. A picking point clustering algorithm was also developed to divide the working range of the robotic arm into multiple sub-areas. Each cluster was designed to cover 1~3 picking points, enabling the end-effector to harvest 1~3 safflowers in a single operation. Building on this, a goal redirecting strategy, a goal-direct and deflection expansion strategy, and an artificial potential field tangential escape force strategy were integrated into the bidirectional RRT* framework to improve path search efficiency and obstacle avoidance. The goal redirecting strategy continuously updated target points during expansion to quickly connect paths within opportunity windows. The goal-direct and deflection expansion strategy allowed both search trees to extend from the nodes closest to the goal, maximizing progress toward the target while deflecting to avoid obstacles. The tangential escape force strategy introduced a tangential component into the traditional artificial potential field, enabling smooth sliding along obstacle boundaries when approaching them, effectively avoiding the issues of path oscillation and target unreachability inherent in traditional APF. For path optimization, a combined approach using a greedy jump-point strategy, interpolated curvature optimization, and B-spline curve fitting was applied to smoothly adjust the curvature of path nodes and generate high-order continuous trajectories. An obstacle avoidance reconstruction mechanism was also introduced to prevent trajectory penetration through obstacles, ensuring continuous, collision-free, and smooth motion of the robotic arm. Simulation experiments compared the TR-RRT* algorithm with seven other algorithms in dense, small-obstacle environments. The results demonstrated its superior performance in complex obstacle environments: path lengths(3 892.05 mm) were shortened by 9.16% and 8.22% compared to IBI-P-RRT*(4 284.44 mm) and BI-RRT*(4 240.45 mm), respectively; average planning time(0.3 s) was only 7.94% of that of RRT*(3.78 s) and 69.77% of BI-RRT*(0.43 s). Additionally, the steering angles of BI-RRT*(37.51°) and BI-APF-RRT*(39.61°) were 1.22 and 1.29 times larger than those of the proposed algorithm(30.63°), indicating significantly improved path smoothness. Additionally, statistical quantitative experiments were conducted for the algorithm in different obstacle environments. The proposed algorithm achieved optimal performance in both path length and time consumption across various environments. Moreover, in narrow passage obstacle environments, the TR-RRT* algorithm successfully planned paths, overcoming the tendency of traditional artificial potential field (APF) methods to fall into local oscillations and fail to plan paths in such scenarios. Physical harvesting tests further validated the effectiveness of the proposed clustering method and TR-RRT* algorithm. The robotic arm took an average of 3.64 s to move from the initial position to the first target point, with an average transfer time of 3.12 s between tasks. The average positional error relative to the robotic arm's workspace was less than 0.9%, confirming stable and efficient safflower harvesting performance.

     

/

返回文章
返回