A Fast Path-Planning Method for Continuous Harvesting of Table-Top Grown Strawberries
Zhonghua Miao, Yang Chen, Lichao Yang, Shimin Hu, Ya Xiong

TL;DR
This paper introduces ILMSA, a fast and efficient path-planning algorithm for continuous strawberry harvesting that significantly reduces planning time and path length compared to existing methods, suitable for complex agricultural environments.
Contribution
The paper presents ILMSA, a novel 3D path-planning algorithm that improves efficiency and reduces redundancy in robotic fruit harvesting tasks.
Findings
ILMSA reduces path length by 21.5% compared to 3D-RRT.
ILMSA decreases planning time by 97.1% relative to 3D-RRT.
ILMSA achieves shorter paths and faster planning in 2D and 3D environments.
Abstract
Continuous harvesting and storage of multiple fruits in a single operation allow robots to significantly reduce the travel distance required for repetitive back-and-forth movements. Traditional collision-free path planning algorithms, such as Rapidly-Exploring Random Tree (RRT) and A-star (A), often fail to meet the demands of efficient continuous fruit harvesting due to their low search efficiency and the generation of excessive redundant points. This paper presents the Interactive Local Minima Search Algorithm (ILMSA), a fast path-planning method designed for the continuous harvesting of table-top grown strawberries. The algorithm featured an interactive node expansion strategy that iteratively extended and refined collision-free path segments based on local minima points. To enable the algorithm to function in 3D, the 3D environment was projected onto multiple 2D planes, generating…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
