Loading [MathJax]/extensions/TeX/ietmacros.js
Route Optimization in Precision Agriculture Settings: A Multi-Steiner TSP Formulation | IEEE Journals & Magazine | IEEE Xplore

Route Optimization in Precision Agriculture Settings: A Multi-Steiner TSP Formulation


Abstract:

In this work, we propose a route planning strategy for heterogeneous mobile robots in Precision Agriculture (PA) settings. Given a set of agricultural tasks to be perform...Show More

Abstract:

In this work, we propose a route planning strategy for heterogeneous mobile robots in Precision Agriculture (PA) settings. Given a set of agricultural tasks to be performed at specific locations, we formulate a multi-Steiner Traveling Salesman Problem (TSP) to define the optimal assignment of these tasks to the robots as well as the respective optimal paths to be followed. The optimality criterion aims to minimize the total time required to execute all the tasks, as well as the cumulative execution times of the robots. Costs for travelling from one location to another, for maneuvering and for executing the task as well as limited energy capacity of the robots are considered. In addition, we propose a sub-optimal formulation to mitigate the computational complexity by leveraging the fact that generally in PA settings only a few locations require agricultural tasks in a certain period of interest compared to all possible locations in the field. A formal analysis of the optimality gap between the optimal and the sub-optimal formulations is provided. The effectiveness of the approach is validated in a simulated orchard where three heterogeneous aerial vehicles perform inspection tasks. Note to Practitioners—This paper aims at providing an efficient solution to PA needs by deploying a team of robots able to perform agricultural tasks at given locations in large-scale orchards. In particular, a novel general optimization problem is proposed that, given a set of mobile and possibly heterogeneous robots and a set of agricultural tasks to carry out, defines the assignment of these tasks to the robots as well as the routes to follow, while minimizing the total and the cumulative execution times of the robots. Existing approaches for route optimization in PA generally involves complete coverage of the field by one or multiple robots and do not account for maneuvering costs with general layouts of the field. We consider costs for travelling from one location to another, for exe...
Published in: IEEE Transactions on Automation Science and Engineering ( Volume: 20, Issue: 4, October 2023)
Page(s): 2551 - 2568
Date of Publication: 20 September 2022

ISSN Information:

Funding Agency:


References

References is not available for this document.