Optimal Coverage Path Planning for Agricultural Vehicles with Curvature Constraints
-
Published:2023-11-07
Issue:11
Volume:13
Page:2112
-
ISSN:2077-0472
-
Container-title:Agriculture
-
language:en
-
Short-container-title:Agriculture
Author:
Höffmann Maria1ORCID, Patel Shruti1, Büskens Christof1
Affiliation:
1. Optimization and Optimal Control, Center for Industrial Mathematics, University of Bremen, 28359 Bremen, Germany
Abstract
Complete coverage path planning (CCPP) is vital in mobile robot applications. Optimizing CCPP is particularly significant in precision agriculture, where it enhances resource utilization, reduces soil compaction, and boosts crop yields. This work offers a comprehensive approach to CCPP for agricultural vehicles with curvature constraints. Our methodology comprises four key stages. First, it decomposes complex agricultural areas into simpler cells, each equipped with guidance tracks, forming a fixed track system. The subsequent route planning and smooth path planning stages compute a path that adheres to path constraints, optimally traverses the cells, and aligns with the track system. We use the generalized traveling salesman problem (GTSP) to determine the optimal traversing sequence. Additionally, we introduce an algorithm for calculating paths that are both smooth and curvature-constrained within individual cells, as well as paths that enable seamless transitions between cells, resulting in a smooth, curvature-constraint coverage path. Our modular approach allows method flexibility at each step. We evaluate our method on real agricultural fields, demonstrating its effectiveness in minimizing path length, ensuring efficient coverage, and adhering to curvature constraints. This work establishes a strong foundation for precise and efficient agricultural coverage path planning, with potential for further real-world applications and enhancements.
Funder
German Government’s Special Purpose Fund held at Landwirtschaftliche Rentenbank
Subject
Plant Science,Agronomy and Crop Science,Food Science
Reference54 articles.
1. Ntawumenyikizaba, A., Viet, H.H., and Chung, T. (2012, January 26–28). An online complete coverage algorithm for cleaning robots based on boustrophedon motions and A* search. Proceedings of the 8th International Conference on Information Science and Digital Content Technology (ICIDT), Jeju Island, Republic of Korea. 2. Höffmann, M., Clemens, J., Stronzek-Pfeifer, D., Simonelli, R., Serov, A., Schettino, S., Runge, M., Schill, K., and Büskens, C. (2022, January 5–7). Coverage Path Planning and Precise Localization for Autonomous Lawn Mowers. Proceedings of the 6th IEEE International Conference on Robotic Computing (IRC), Naples, Italy. 3. Coverage Path Planning with Real-time Replanning and Surface Reconstruction for Inspection of Three-dimensional Underwater Structures using Autonomous Underwater Vehicles;Galceran;J. Field Robot.,2015 4. Basilico, N., and Carpin, S. (October, January 28). Deploying teams of heterogeneous UAVs in cooperative two-level surveillance missions. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Hamburg, Germany. 5. Kalburgi, S., G Nair, V., and Guruprasad, K. (2020). Application of Coverage Path Planning Algorithm for Milling Operations, Springer.
|
|