Skip to content
naulon

Not checkedNot checked for notices yet.

Multi-Strategy Fusion RRT-Based Algorithm for Optimizing Path Planning in Continuous Cherry Picking

Yi Zhang, Xinying Miao, Yifei Sun and 4 more

Agriculture · 2025

doi:10.3390/agriculture15151699 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Automated cherry harvesting presents a significant opportunity to overcome the high costs and inefficiencies of manual labor in modern agriculture. However, robotic harvesting in dense canopies requires sophisticated path planning to navigate cluttered branches and selectively pick target fruits. This paper introduces a complete robotic harvesting solution centered on a novel path-planning algorithm: the Multi-Strategy Integrated RRT for Continuous Harvesting Path (MSI-RRTCHP) algorithm. Our system first employs a machine vision system to identify and locate mature cherries, distinguishing them from unripe fruits, leaves, and branches, which are treated as obstacles. Based on this visual data, the MSI-RRTCHP algorithm generates an optimal picking trajectory. Its core innovation is a synergistic strategy that enables intelligent navigation by combining probability-guided exploration, goal-oriented sampling, and adaptive step size adjustments based on the obstacle’s density. To optimize the picking sequence for multiple targets, we introduce an enhanced traversal algorithm (σ-TSP) that accounts for obstacle interference. Field experiments demonstrate that our integrated system achieved a 90% picking success rate. Compared with established algorithms, the MSI-RRTCHP algorithm reduced the path length by up to 25.47% and the planning time by up to 39.06%. This work provides a practical and efficient framework for robotic cherry harvesting, showcasing a significant step toward intelligent agricultural automation.

Abstract licence: CC BY

References39

    39 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.