Path planning for spot spraying with UAVs combining TSP and area coverages

This paper addresses the following task: given a set of patches or areas of varying sizes that are to be serviced within a bounding closed contour, calculate a minimal length path plan for an unmanned aerial vehicle (UAV) such that all patches are serviced, the path additionally avoids any obstacles areas within the bounding contour and the path never leaves the bounding contour. The application in mind is agricultural spot spraying, where the bounding contour represents the field contour and multiple patches represent multiple weed areas meant to be sprayed. Obstacle areas are ponds or tree islands. The proposed method combines a heuristic solution to a traveling salesman problem (TSP) with optimised area coverage path planning. Two TSP-initialisation and 4 TSP-refinement heuristics as well as two area coverage path planning methods are evaluated on three real-world experiments with three obstacle areas and 15, 19 and 197 patches, respectively. The unsuitability of a Boustrophedon-path for area coverage gap avoidance is discussed and inclusion of a headland path for area coverage is motivated. Two main findings are (i) the particular suitability of one TSP-refinement heuristic, and (ii) the unexpected high contribution of patches areas coverage pathlengths on total pathlength, highlighting the importance of optimised area coverage path planning for spot spraying. • This paper addresses path planning for spot spraying with unmanned aerial vehicles. • The method combines solving a traveling salesman problem with area coverage planning. • The method is evaluated on three real-world examples with up to 197 weed areas.