Abstract
With the decreasing and aging agricultural workforce, fruit harvesting robots equipped with higher degrees of freedom (DoF) manipulators are seen as a promising solution for performing harvesting operations in unstructured and complex orchard environments. In such a complex environment, guiding the end-effector from its starting position to the target fruit while avoiding obstacles poses a significant challenge for path planning in automatic harvesting. However, existing studies often rely on manually constructed environmental map models and face limitations in planning efficiency and computational cost. Therefore, in this study, we introduced a collision-free path planning method for a 6-DoF orchard harvesting manipulator using an RGB-D camera and the Bi-RRT algorithm. First, by transforming the RGB-D camera's point cloud data into collision geometries, we achieved 3D obstacle map reconstruction, allowing the harvesting robot to detect obstacles within its workspace. Second, by adopting the URDF format, we built the manipulator's simulation model to be inserted with the reconstructed 3D obstacle map environment. Third, the Bi-RRT algorithm was introduced for path planning, which performs bidirectional expansion simultaneously from the start and targets configurations based on the principles of the RRT algorithm, thereby effectively shortening the time required to reach the target. Subsequently, a validation and comparison experiment were conducted in an artificial orchard. The experimental results validated our method, with the Bi-RRT algorithm achieving reliable collision-free path planning across all experimental sets. On average, it required just 0.806 s and generated 12.9 nodes per path, showing greater efficiency in path generation compared to the Sparse Bayesian Learning (SBL) algorithm, which required 0.870 s and generated 15.1 nodes per path. This method proved to be both effective and fast, providing meaningful guidance for implementing path planning for a 6-DoF manipulator in orchard harvesting tasks.