矩形边界条件下农机作业的方向平行路径排序优化

omputer technology is increasingly used in the path planning and optimization for agricultural machineries' field operations. In this paper, for the direction parallel paths in fields of regular quadrilateral boundary, considering a variety of possible strategies of headland turning, agronomic requirements of different operating modes and the turning characteristics of machineries, we tried to find the optimal path sequence strategies to minimize the total operating length and time of headland turning. First two kinds of new turning strategies were put forward after the analysis of the generation principle of the existing turning strategies. Then the scheduling problem was formulated into the Traveling Salesman Problem (TSP), and then the greedy search algorithm was utilized to address it. Simulation experimental results showed that the algorithm is efficient and robust, and the turning efficiency is significantly improved compared to the commonly-used scheduling and sorting strategies.