障碍物
运动规划
工厂(面向对象编程)
路径(计算)
农业
计算机科学
机械手
控制工程
机器人
工程类
人工智能
地理
操作系统
考古
程序设计语言
作者
Huiliang Shang,Xueyi Chi,Ruijiao Li,Xuan Zhao,Huosheng Hu
标识
DOI:10.1109/tii.2025.3574434
摘要
This article presents a novel path planning approach for robotic manipulators operating in complex factory farming environments, where traditional methods struggle with strict obstacle avoidance constraints. The proposed method strikes a balance between minor permissible collisions and efficient obstacle avoidance. First, scene point clouds are downsampled using voxelization to generate a cost map. A greedy search is then employed to determine an initial obstacle-aware Cartesian path from this map. After postprocessing, the Cartesian path is converted into joint configuration trajectories using Ranged-IK, ensuring smooth, singularity-free transitions with controlled flexibility. The resulting validated trajectories are executed by the manipulator. Experiments were conducted on two robotic manipulators for pollination and harvesting tasks. The results indicate that the proposed method outperforms common alternatives, achieving higher operational efficiency, success rates, and adaptability, while permitting minor collisions.
科研通智能强力驱动
Strongly Powered by AbleSci AI