Field Operations Planning for Agricultural Vehicles:A Hierarchical Modeling Framework

The execution of field operations by a fleet of cooperating machines needs to be carefully planned, in order to achieve maximum efficiency. Hence, it is necessary to describe these operations with mathematical models that can be used for optimal planning. The complexity of agricultural operations makes such modeling difficult. Important variables for planning, such as logistics for crop yield, cannot be accurately known in advance. Furthermore, unexpected events may happen during operations, such as harvester blockages and restarting operations. In this paper the overall planning problem is decomposed into a hierarchy of simpler problems that can be solved independently and efficiently. Each lower-level problem is modeled in a way that optimization algorithms from the operations research area can be adopted for their solution. The dynamic nature of the problem and the inherent uncertainties of many parameters suggest the adoption of a closed loop control system, which results in a sequence of planning, execution and re-planning. The resulting optimal operation plans can be complex and their execution requires an advanced degree of machine, or field robot autonomy. Overall, the adoption and modification of existing methods from other research areas such as logistics, routing, factory scheduling, and robotics offer a very promising approach for the efficient planning of operations executed by agricultural vehicles.

[1]  Hermann Auernhammer.  The Role of Mechatronics in Crop Product Traceability , 2000 .

[2]  D. Bertsimas,et al.  STOCHASTIC AND DYNAMIC VEHICLE ROUTING PROBLEM IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES. , 1993 .

[3]  Yingkuan Wang.  Agricultural Engineering International : the CIGR Ejournal , 1999 .

[4]  Vitaly A. Strusevich,et al.  Approximation Algorithms for Three-Machine Open Shop Scheduling , 1993, INFORMS J. Comput..

[5]  Dionysis Bochtis,et al.  Optimal Dynamic Motion Sequence Generation for Multiple Harvesters , 2007 .

[6]  George M. Giaglis,et al.  Minimizing logistics risk through real‐time vehicle routing and mobile technologies: Research to date and future trends , 2004 .

[7]  Spyros Fountas,et al.  Systems Requirements for a Small Autonomous Tractor , 2004 .

[8]  Günther Schmidt,et al.  Path planning and guidance techniques for an autonomous mobile cleaning robot Robotics and Autonomous Systems 14 (1995) 199-212 , 1995, Robotics Auton. Syst..

[9]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[10]  Emilio Frazzoli,et al.  A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience , 2009, Mob. Networks Appl..

[11]  Jacques Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

[12]  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).

[13]  Stavros Vougioukas,et al.  A Vehicle Routing Problem Formulation of Agricultural Field Operations Planning for Self-Propelled Machines , 2006 .

[14]  C G Sørensen.  MISSION PLANNER FOR AGRICULTURAL ROBOTICS , 2004 .

[15]  Noboru Noguchi,et al.  Agricultural automatic guidance research in North America , 2000 .

[16]  Alexander Zelinsky,et al.  Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot , 2007 .

[17]  John F. Reid.  Sensors and Data collection , 2002 .

[18]  Wim Nuijten,et al.  Solving Scheduling Problems with Setup Times and Alternative Resources , 2000, AIPS.

[19]  J. Christopher Beck,et al.  On the Reformulation of Vehicle Routing Problems and Scheduling Problems , 2002, SARA.

[20]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..