Path Planning for Complete Coverage with Agricultural Machines

The problem of planning reference trajectories for agricultural machines is considered. A path planning algorithm to perform various kinds of farm-works is described. The case of convex fields is first considered. A direction of work being given, the algorithm determines the turning areas and selects a trajectory which guarantees the complete field coverage while minimizing overlapping. The method is extended to the case of fields with more complex shape including possibly obstacles. Simulations are proposed to illustrate the reasoning.

[1]  Günther Schmidt,et al.  Path planning and guidance techniques for an autonomous mobile cleaning robot , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[2]  Philippe Souères,et al.  Farmwork path planning for field coverage with minimum overlapping , 2001, ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597).

[3]  Howie Choset,et al.  Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods , 2003, Int. J. Robotics Res..

[4]  Chaomin Luo,et al.  A solution to vicinity problem of obstacles in complete coverage path planning , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[5]  Bradford W. Parkinson,et al.  Carrier-Phase Differential GPS for Control of a Tractor Towed Implement , 2000 .

[6]  M. I. Ribeiro,et al.  Complete coverage path planning and guidance for cleaning robots , 1997, ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics.

[7]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .

[8]  Michael Happold,et al.  The Demeter System for Automated Harvesting , 2002, Auton. Robots.

[9]  Esther M. Arkin,et al.  Optimal covering tours with turn costs , 2001, SODA '01.

[10]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[11]  Philippe Martinet,et al.  Curved Path Following of a Farm Tractor Using a CP-DGPS , 2000 .

[12]  Elon Rimon,et al.  Spiral-STC: an on-line coverage algorithm of grid environments by a mobile robot , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[13]  Wesley H. Huang.  Optimal line-sweep-based decompositions for coverage algorithms , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).