“…Xu et al (2015) designed a UAV planning algorithm with minimal energy consumption by dividing the plant protection area through the grid method and reasonably allocating the spraying volume and return points of each sortie, which minimizes the total energy consumption of the UAV's work, reduces the invalid consumption of energy by the UAV in non-operating situations, and improves the UAV's operating efficiency. Although all of the aforementioned algorithms can achieve the shortest flight range for their related problems (Xu et al, 2015;Li K. et al, 2020;Wang et al, 2020;Liu et al, 2021;Shafiq et al, 2021;Tang et al, 2021;Yan et al, 2021), they differ from the multi-tea field planting route scheduling planning problem in the following three aspects: (i) the types of problems solved by each study are different, such as the vehicle routing problem, the quadratic assignment problem, the traveling salesman problem, etc. ; (ii) the applied UAV sorties and models are different, in particular, this paper focuses on the scheduling route planning problem for the single sortie of plant protection UAVs; and (iii) the environment and work content of the application are different to those of the current literature.…”