Route planning for agricultural tasks: A general approach for fleets of autonomous vehicles in site-specific herbicide applications

The proposed route planner addresses a broad range of agricultural problems.The planner considers vehicles with different features and the field variability.The planner optimizes for different criteria, even simultaneously.The planner is validated solving several illustrative problems.The planner outperforms other approaches by up to 17% and 21% in headland distance. Route planning in agricultural fields is a major challenge closely related to the amount of inputs consumed and the associated soil compaction. Current approaches primarily focus on reducing the travelled distances (i.e., the trajectories that vehicles have to cover to carry out the task) and generally do not consider other optimization criteria such as input costs (e.g., fuel, herbicides, labor). Furthermore, although few approaches consider more than one vehicle, none of them takes into consideration vehicles with different characteristics, such as different speeds or different turning radii, and some variabilities of the field such as the weed distribution have not been studied yet. All these factors affect the cost of routes to be followed to accomplish agricultural tasks such as site-specific treatments. In this context, this study proposes a very general approach to optimize the routes that considers: (1) different criteria such as the travelled distance, the time required to perform the task and the input costs, even simultaneously, (2) vehicles with different features (e.g., working speeds, both intra and inter-crop, turning radii, fuel consumptions, tank capacities and spraying costs), (3) the variability of the field and (4) the possibility of tank refilling.The proposed approach has special relevance for route planning in site-specific herbicide applications. This case requires a tank on board the vehicle to store an agrochemical product, and its capacity must be considered because it affects the routes to be followed, specifically in those cases in which the tank capacity may not be sufficient to treat the entire field even when working in cooperation with other vehicles. In such cases, refilling (i.e., a round trip to the refilling depot) may be essential despite the extra cost involved in this operation.The proposed approach was validated by solving several illustrative problems. The results showed that the proposed route planner covers a broad range of agricultural situations and that the optimal routes may vary considerably depending on the features of the fleet vehicles, the variability of the field and the optimization criteria selected. Finally, a comparative study against other well-known agricultural planners was carried out, yielding routes that improved those produced by the reference approaches.

[1]  Yu-Chu Tian,et al.  Dynamic robot path planning using an enhanced simulated annealing approach , 2013, Appl. Math. Comput..

[2]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[3]  Dionysis Bochtis,et al.  Effect of controlled traffic on field efficiency , 2010 .

[4]  D. Mulla Twenty five years of remote sensing in precision agriculture: Key advances and remaining knowledge gaps , 2013 .

[5]  S. Fountas,et al.  Agricultural robots—system analysis and economic feasibility , 2006, Precision Agriculture.

[6]  Dionysis Bochtis,et al.  Coverage planning for capacitated field operations, part II: Optimisation , 2015 .

[7]  Dionysis Bochtis,et al.  Minimising the non-working distance travelled by machines operating in a headland field pattern , 2008 .

[8]  Pablo González de Santos,et al.  Reducing fuel consumption in weed and pest control using robotic tractors , 2015, Comput. Electron. Agric..

[9]  Hossein Mousazadeh,et al.  A technical review on navigation systems of agricultural autonomous off-road vehicles , 2013 .

[10]  Philippe Souères,et al.  Path Planning for Complete Coverage with Agricultural Machines , 2003, FSR.

[11]  P. Berny Pesticides and the intoxication of wild animals. , 2007, Journal of veterinary pharmacology and therapeutics.

[12]  Dionysis Bochtis,et al.  Coverage planning for capacitated field operations under spatial variability , 2015 .

[13]  Ibrahim A. Hameed,et al.  Driving Angle and Track Sequence Optimization for Operational Path Planning Using Genetic Algorithms , 2011 .

[14]  Stephan M. Winkler,et al.  Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications , 2009 .

[15]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Arto Visala,et al.  Coverage path planning algorithms for agricultural field machines , 2009 .

[18]  Vladimir J. Lumelsky,et al.  Classification of the Dubins set , 2001, Robotics Auton. Syst..

[19]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[20]  Renato Seiji Tavares,et al.  Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning , 2011, Expert Syst. Appl..

[21]  L. Ingber Very fast simulated re-annealing , 1989 .

[22]  Gonzalo Pajares,et al.  Mix-opt: A new route operator for optimal coverage path planning for a fleet in an agricultural environment , 2016, Expert Syst. Appl..

[23]  Angela Ribeiro,et al.  Distributed Multi-Level Supervision to Effectively Monitor the Operations of a Fleet of Autonomous Vehicles in Agricultural Tasks , 2015, Sensors.

[24]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[25]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[26]  J. Stafford,et al.  Automatic operation planning for GPS-guided machinery. , 2003 .

[27]  Claus G. Sørensen,et al.  Operational Analyses and Model Comparison of Machinery Systems for Reduced Tillage , 2005 .