MP-STSP: A Multi-Platform Steiner Traveling Salesman Problem Formulation for Precision Agriculture in Orchards
Authors:
- 30 May 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2345-2351
Abstract
In this work, we propose a global planning strategy specifically designed for precision agriculture settings, where field activities may have different requirements ranging from a full orchard inspection to sparse targeted per-plant interventions. This global planning strategy is formulated as a novel Multi-Platform Steiner Traveling Salesman Problem (MP-STSP) where, in order to guarantee the exploitation of multiple moving platforms and the minimization of the overall operational time, the proposed formulation explicitly takes into account the time required to perform each task. By doing so, the computed itineraries attempt to balance the workload among the deployed platforms. Comparative simulations, inspired by the needs of the EU H2020 Project PANTHEON 1 , are provided to numerically demonstrate the effectiveness of the proposed planning strategy for an orchard precision agriculture setting.Keywords
Funding Information
- European Commission
This publication has 18 references indexed in Scilit:
- The traveling salesman problem on grids with forbidden neighborhoodsJournal of Combinatorial Optimization, 2017
- Route planning for agricultural tasks: A general approach for fleets of autonomous vehicles in site-specific herbicide applicationsComputers and Electronics in Agriculture, 2016
- Route planning for orchard operationsComputers and Electronics in Agriculture, 2015
- Agricultural operations planning in fields with multiple obstacle areasComputers and Electronics in Agriculture, 2014
- Sensing technologies for precision specialty crop productionComputers and Electronics in Agriculture, 2010
- The vehicle routing problem in field logistics part IBiosystems Engineering, 2009
- Coverage path planning algorithms for agricultural field machinesJournal of Field Robotics, 2009
- Integer linear programming formulations of multiple salesman problems and its variationsEuropean Journal of Operational Research, 2006
- Robot Motion Planning and Control1998
- A cutting plane procedure for the travelling salesman problem on road networksEuropean Journal of Operational Research, 1985