Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fast Heuristic Scheduling and Trajectory Planning for Robotic Fruit Harvesters with Multiple Cartesian Arms

Published 15 May 2025 in cs.RO, cs.SY, and eess.SY | (2505.10028v1)

Abstract: This work proposes a fast heuristic algorithm for the coupled scheduling and trajectory planning of multiple Cartesian robotic arms harvesting fruits. Our method partitions the workspace, assigns fruit-picking sequences to arms, determines tight and feasible fruit-picking schedules and vehicle travel speed, and generates smooth, collision-free arm trajectories. The fruit-picking throughput achieved by the algorithm was assessed using synthetically generated fruit coordinates and a harvester design featuring up to 12 arms. The throughput increased monotonically as more arms were added. Adding more arms when fruit densities were low resulted in diminishing gains because it took longer to travel from one fruit to another. However, when there were enough fruits, the proposed algorithm achieved a linear speedup as the number of arms increased.

Summary

Fast Heuristic Scheduling and Trajectory Planning for Robotic Fruit Harvesters with Multiple Cartesian Arms

In the pursuit of advancing agricultural automation, particularly in the context of fresh fruit harvesting, the study presented addresses the complexity of optimizing scheduling and trajectory planning for multi-arm robotic harvesters. Aiming at enhancing the throughput of such systems, the paper introduces a heuristic algorithm capable of tackling the intricacies associated with the concurrent scheduling and trajectory planning tasks of multiple Cartesian robotic arms.

Research Contribution

The proposed methodology is structured around three principal components: partitioning the workspace, assigning fruit-picking sequences to the arms, and determining the corresponding schedules and trajectories that maximize fruit-picking throughout (FPT). A distinctive feature of this approach is its focus on achieving feasible schedules while avoiding deadlocks and collisions among the robotic arms. The research provides an insightful analysis of throughput variations as the number of arms increases, demonstrating a potential for linear scalability in dense fruit configurations.

Methodology Overview

Workspace Partitioning and Scheduling

The problem is originally defined as a multi-arm robotic harvesting problem (MARHP) formulated as a minimum-makespan VRP. Unlike traditional VRP, where travel costs can be pre-computed based on fixed nodes, MARHP considers dynamic costs that vary with the current schedule, sequence, and vehicle velocity. The authors propose segmenting the viewport into distinct fruit zones and generating candidate sequences for arms by selecting vertical and horizontal approaches. This is achieved by balancing the distribution of fruit assignments among arm cells.

Vehicle Speed Optimization and Scheduling

The approach employs a binary search to intelligently determine the vehicle's optimal travel speed so that it aligns with the fruit-picking schedule, ensuring minimal idle times and maximum efficiency. This component features an iterative procedure to reconcile horizontal and vertical arm motions with potential yield scenarios – conditions under which an arm has to yield to others to avoid collisions.

Collision-Free Trajectory Planning

Once the sequences and scheduling are determined, the paper integrates this into a Mixed-Integer Linear Programming (MILP) problem aimed at generating smooth, collision-free trajectories. By minimizing the combined accelerations required across all arms throughout the fruit-picking process, the generated solution respects kinematic constraints while ensuring arms operate within defined vertical frames.

Results and Implications

The effectiveness of the proposed algorithm is validated using synthetically generated data sets that simulate uniform fruit distributions. The results illustrate that an increase in the number of arms correlates with a monotonic rise in throughput, demonstrating that the algorithm achieves near-linear speedup in high-density scenarios. In particular, with a density of 100 fruits/m², the deployment of 12 arms resulted in a throughput that was more than 12 times faster compared to a single-arm configuration.

Future Directions

The authors suggest that future work will involve extending their framework to operate dynamically over longer orchard rows. Real-time perception systems could enable adaptive planning based on actively monitored fruit distributions. Furthermore, practical implementation of this algorithm in a prototype setting will provide empirical insights into its performance, offering potential enhancements for commercial application in farm labor-intensive operations.

Conclusion

Overall, this research contributes a robust framework for improving the efficiency of robotic fruit harvesters through heuristic scheduling and trajectory planning for multiple robotic arms. The demonstrated improvements in fruit-picking throughput underline the significant potential for scalable and efficient robotic solutions in agriculture, particularly in response to declining availability of farm labor. The extrapolation of this work into dynamic environments and real-world trials promises continued advancement in the realm of agricultural robotics.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.