Multi-machine cooperative scheduling planning method and system based on harvesting-transportation

The multi-machine collaborative scheduling planning method optimizes the scheduling of heterogeneous agricultural machinery by integrating GNSS, topological mapping, and heuristic algorithms to reduce waiting times and enhance efficiency in agricultural production.

CN119090097APending Publication Date: 2024-12-06CHINA AGRI UNIV

Patent Information

Application Number
CN202411578212.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-11-07
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

Current scheduling and planning methods for agricultural machinery fleets primarily focus on homogeneous units, lacking efficient scheduling and planning for heterogeneous machinery, leading to inefficiencies such as harvesters waiting for grain trucks, thereby reducing overall operational efficiency.

Method used

A multi-machine collaborative scheduling planning method and system that utilizes GNSS to obtain farm location information, plans harvester paths, determines operation sequences and times, and employs algorithms to optimize the scheduling of harvesters and grain transport vehicles, integrating topological mapping, greedy minimum-maximum load balancing, and hybrid genetic and heuristic iterations to minimize waiting times and total distances.

Benefits of technology

The method enhances agricultural production efficiency by optimizing the scheduling of heterogeneous machinery, reducing waiting times, and improving management levels through intelligent and flexible scheduling, supporting smart agriculture.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090097A_ABST
    Figure CN119090097A_ABST
Patent Text Reader

Abstract

The invention discloses a multi-machine cooperative scheduling planning method and system based on harvesting-transportation, and relates to the technical field of agricultural vehicle optimization scheduling, and the method comprises the steps: obtaining the basic position information of a to-be-planned farm; according to the basic position information, performing harvester operation path planning on the field piece task set of the to-be-planned farm to obtain an in-harvester field piece full coverage path and an inter-field piece transfer path of the to-be-operated field piece; respectively determining an operation task sequence and operation time of each harvester and an operation position sequence and operation time of each grain transport vehicle according to the in-field full coverage path and the inter-field transfer path of the harvesters and the operation parameters of the harvesters and the grain transport vehicles; and updating the operation time of all the harvesters according to the operation position sequence and the operation time of all the grain transporting vehicles to obtain the optimal operation time of each harvester. According to the invention, scheduling planning between multiple harvesters and grain transporting vehicles can be realized, and the agricultural production efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of agricultural vehicle optimization and scheduling, and in particular to a multi-machine collaborative scheduling planning method and system based on harvesting and transportation. Background Art

[0002] With the development of next-generation information technologies such as artificial intelligence, big data, and the Internet of Things, the deep integration of agriculture with these technologies is driving the continuous development of digital agriculture and smart agriculture. Unmanned farms, a key approach to promoting smart agriculture, enable unmanned production and management tasks around the clock, throughout the entire process, and across all spaces through remote control of farm facilities, equipment, and machinery, or the intelligent decision-making and autonomous operation of intelligent equipment and agricultural robots.

[0003] In this process, the collaborative operation of multiple agricultural machines, either homogeneous or heterogeneous, in the field has become a research focus for regional operations involving agricultural machinery fleets. Unmanned operation and dispatch management of agricultural machinery are particularly crucial. Automatic navigation technology for agricultural machinery and multi-machine dispatch planning methods are key technologies for unmanned multi-machine operation. These technologies enable collaborative operation and management of multiple machines, improving agricultural production efficiency and reducing production costs.

[0004] Currently, scheduling and planning methods for machine fleets in regional farmlands primarily focus on the scheduling of multiple units of the same type of agricultural machinery, lacking efficient scheduling and planning methods for multiple units of heterogeneous agricultural machinery. Furthermore, there is asymmetric information between supply and demand during agricultural machinery operations, a lack of scientific and rational scheduling and management solutions for heterogeneous agricultural machinery collaboration, and high scheduling costs and low efficiency. These issues have hindered the production scheduling of heterogeneous machine fleets in agricultural production. Taking the harvester-grain truck collaborative harvesting scenario as an example, as a typical heterogeneous machine fleet operation scenario in agricultural production, research on this scenario is of great significance. In this scenario, harvesters are responsible for harvesting crops, while grain trucks are responsible for transporting the harvested grain to designated locations. Without effective scheduling planning, harvesters may be forced to stop while waiting for grain trucks, thus affecting overall operational efficiency. Therefore, optimizing the scheduling of harvester-grain truck collaborative operations is a key approach to improving agricultural production efficiency. Managing and scheduling multi-machine collaborative operations can help agricultural machinery managers complete their work more efficiently, significantly reduce labor intensity, and facilitate large-scale farmland production management.

[0005] Based on this, how to realize the scheduling planning between multiple harvesters and grain transport vehicles to improve agricultural production efficiency has become a technical problem that needs to be solved urgently in this field. Summary of the Invention

[0006] The purpose of this application is to provide a multi-machine collaborative scheduling planning method and system based on harvesting-transportation, which can effectively realize the scheduling planning between multiple harvesters and grain transport vehicles and improve agricultural production efficiency.

[0007] To achieve the above objectives, this application provides the following solutions.

[0008] In a first aspect, the present application provides a multi-machine collaborative scheduling planning method based on harvesting-transportation, and the multi-machine collaborative scheduling planning method based on harvesting-transportation includes the following steps.

[0009] Obtain basic location information of the farm to be planned; the basic location information includes longitude and latitude coordinate information of road nodes and longitude and latitude coordinate information of field boundary points.

[0010] According to the basic position information, the harvester operation path is planned for the field task set of the farm to be planned, and the harvester field full coverage path and the inter-field transfer path of the field to be operated are obtained.

[0011] The operation task sequence and operation time of each harvester are determined according to the full coverage path within the field and the transfer path between the fields of the harvester.

[0012] The operation position sequence and operation time of each grain transport vehicle are determined based on the full coverage path of the harvester in the field, the operation parameters of the harvester and the grain transport vehicle.

[0013] According to the operation position sequence and operation time of all grain transport vehicles, the operation time of all harvesters is updated to obtain the optimal operation time of each harvester.

[0014] In the second aspect, the present application provides a multi-machine collaborative scheduling planning system based on harvesting and transportation, including: a memory, a processor, and a computer program stored in the memory and runnable on the processor, wherein the processor executes the computer program to implement any of the above-mentioned multi-machine collaborative scheduling planning methods based on harvesting and transportation.

[0015] According to the specific embodiments provided in this application, this application discloses the following technical effects.

[0016] The present application provides a multi-machine collaborative scheduling planning method and system based on harvesting-transportation, which obtains the longitude and latitude coordinate information of the road nodes and the longitude and latitude coordinate information of the field boundary points of the farm to be planned, and uses this as a basis to plan the harvester operation path of the field task set of the planned farm, and obtains the full coverage path of the harvester within the field and the transfer path between the fields, so as to determine the operation task sequence and operation time of each harvester, as well as the operation position sequence and operation time of each grain transport vehicle; finally, the operation time of all harvesters is updated according to the operation position sequence and operation time of all grain transport vehicles to obtain the optimal operation time of each harvester, realizing the simultaneous scheduling planning of the harvesting operations of multiple harvesters and the grain transfer operations of multiple grain transport vehicles, and combining with the longitude and latitude coordinate information of the actual farm to facilitate the navigation operation of agricultural machinery, and can provide a more intelligent and efficient solution for the scheduling of multiple agricultural machinery in the harvesting operation scenario, with better adaptability and flexibility, can realize more scientific multi-agricultural machinery collaborative operation, can effectively reduce the waiting time of agricultural machinery, improve the efficiency and management level of agricultural production, and contribute to the development of smart agriculture. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0018] Figure 1 A flowchart of a multi-machine collaborative scheduling planning method based on harvesting and transportation provided in one embodiment of the present application.

[0019] Figure 2 A technical schematic diagram of multi-machine collaborative scheduling planning based on harvesting and transportation provided in one embodiment of the present application.

[0020] Figure 3 A schematic diagram of an electronic farm map provided in accordance with an embodiment of the present application.

[0021] Figure 4 A schematic diagram of the full coverage path planning results for farmland No. 4 provided in an embodiment of the present application.

[0022] Figure 5 A flowchart of a greedy min-max load balancing algorithm based on nearest neighbor heuristics provided in one embodiment of the present application.

[0023] Figure 6 The farm electronic map provided by one embodiment of the present application Figure 4 Schematic diagram of the location of grain unloading point on farmland No.

[0024] Figure 7 A flow chart of an algorithm for generating and adjusting harvester unloading points based on field unloading is provided in accordance with an embodiment of the present application.

[0025] Figure 8 A flowchart of a multi-grain truck scheduling and planning algorithm based on hybrid genetic and heuristic iteration provided in one embodiment of the present application. DETAILED DESCRIPTION

[0026] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0027] like Figure 1 As shown, this embodiment provides a multi-machine collaborative scheduling planning method based on harvesting-transportation, and the multi-machine collaborative scheduling planning method based on harvesting-transportation includes the following steps.

[0028] Step S1: Obtain basic location information of the farm to be planned. In this embodiment, basic location information of the farm to be planned is collected using the Global Navigation Satellite System (GNSS). This basic location information includes the longitude and latitude coordinates of road nodes and field boundary points.

[0029] Step S2: Based on the basic location information, the harvester operation path is planned for the field task set of the farm to be planned, and the harvester field full coverage path and inter-field transfer path of the field to be operated are obtained.

[0030] Step S3: Determine the operation task sequence and operation time of each harvester based on the harvester's full coverage path within the field and the inter-field transfer path. In this embodiment, the harvester's operation task sequence can be in the form of a table, i.e., a harvester operation task sequence table; the harvester's operation time can be in the form of a graph, i.e., a harvester scheduling Gantt chart.

[0031] Step S4: Determine the operating position sequence and operating time of each grain transport vehicle based on the harvester's full coverage path within the field plot, the harvester's and grain transport vehicle's operating parameters. In this embodiment, the operating position sequence of the grain transport vehicle can be in the form of a table, i.e., a grain transport vehicle operating position sequence table; the operating time of the grain transport vehicle can be in the form of a graph, i.e., a grain transport vehicle scheduling Gantt chart.

[0032] Step S5: Update the operating time of all harvesters according to the operating position sequence and operating time of all grain transport vehicles to obtain the optimal operating time of each harvester.

[0033] In this embodiment, step S2 specifically includes the following steps.

[0034] Step S21: constructing an electronic farm map of the farm to be planned based on the basic location information using a topological mapping method.

[0035] Step S22: Determine, based on the farm electronic map, the harvester's intra-field full coverage path and inter-field transfer path for the field to be operated.

[0036] In this embodiment, step S3 specifically includes the following steps.

[0037] Step S31: According to the harvester's intra-field full coverage path and inter-field transfer path of the field to be operated, a greedy minimum-maximum load balancing algorithm based on nearest neighbor heuristic is used to determine the operation task sequence and operation time of each harvester.

[0038] In this embodiment, step S31 specifically includes the following steps.

[0039] Step S311: Determine the field task sequence to be assigned in the field task set based on the full coverage path within the harvester field and the transfer path between fields; the field task sequence is a sequence composed of all fields to be assigned that are sequentially assigned to each harvester.

[0040] Step S312: construct a multi-harvester task allocation model based on the field task sequence, the field task set and the basic parameters of the harvester; the basic parameters of the harvester include the number of harvesters, the harvesting operation speed of the harvester and the harvester driving speed. The multi-harvester task allocation model is a model that allocates tasks with the goal of minimizing the overall operation time of the harvester.

[0041] Step S313: constructing a task correlation matrix based on the multi-harvester task allocation model; the task correlation matrix includes a task quantity matrix, a distance matrix between tasks, a distance matrix from the garage to each task, and a distance matrix from each task back to the garage.

[0042] Step S314: According to the task correlation matrix, a greedy minimum-maximum load balancing algorithm based on nearest neighbor heuristic is used to solve the multi-harvester task allocation model to obtain the task sequence and operation time of each harvester.

[0043] In this embodiment, step S4 specifically includes the following steps.

[0044] Step S41: Based on the full coverage path of the harvester field, the operating parameters of the harvester and the grain transport vehicle, the harvester farmland unloading point generation and adjustment algorithm based on field unloading is adopted to determine the location of each unloading point in the farm to be planned.

[0045] Step S42: Determine the unloading time of each unloading point in the farmland task according to the harvesting speed parameter of the harvester.

[0046] Step S43: According to the location and unloading time of each grain unloading point, a multi-grain transport vehicle scheduling planning algorithm based on hybrid genetic and heuristic iteration is used to determine the operation position sequence and operation time of each grain transport vehicle.

[0047] In this embodiment, step S41 specifically includes the following steps.

[0048] Step S411: Calculate the path length of each harvester's harvest when the harvester's bin is full, based on the harvester's full coverage path within the field.

[0049] Step S412: Determine the grain unloading points for all the full granaries in the entire farmland in the planned farm based on the length of the harvesting path of each harvester when the granary is full.

[0050] Step S413: For all grain unloading points, the field area closest to the starting point is used as the grain unloading area for grain unloading point screening, and the position of each grain unloading point in the grain unloading area is determined.

[0051] Step S414: For the grain unloading points outside the grain unloading area, adjust the grain unloading points according to the grain unloading point adjustment principle and generate new grain unloading points, and determine the positions of each adjusted new grain unloading point.

[0052] Among them, the principles for adjusting the grain unloading point include the following contents.

[0053] (1) For the unloading point on the external spiral path, the unloading point on the external spiral path will be adjusted to the entire field area as the new unloading point for unloading.

[0054] (2) For the unloading point on the internal reciprocating path, the unloading point on the internal reciprocating path will be adjusted to the front of the working row in the field area as the new unloading point for unloading.

[0055] (3) Add a last new unloading point at the exit point of the fully covered path within the harvester field to ensure that the harvester's grain bin is empty when the harvester transfers to the next task field.

[0056] Step S415: Calculate the grain unloading time when the harvester arrives at each grain unloading point according to the harvesting speed of the harvester.

[0057] In this embodiment, step S43 specifically includes the following steps.

[0058] Step S431: Construct a multi-grain truck system scheduling model based on the location of each grain unloading point, the unloading time and the basic parameters of the grain truck; the basic parameters of the grain truck include the number of grain trucks, the driving speed of the grain truck and the grain truck bucket capacity. The multi-grain truck system scheduling model is a model for scheduling planning with the goal of minimizing the sum of the total driving distances of all grain trucks and minimizing the sum of the waiting times of all harvesters.

[0059] Step S432: constructing a grain unloading task correlation matrix based on the multi-grain transport vehicle system scheduling model; the grain unloading task correlation matrix includes a grain unloading point location matrix, an unloading grain quantity matrix and an unloading time matrix.

[0060] Step S433: Based on the grain unloading task correlation matrix, a multi-grain truck scheduling planning algorithm based on hybrid genetic and heuristic iteration is used to solve the multi-grain truck system scheduling model to obtain the operation position sequence and operation time of each grain truck.

[0061] In this embodiment, after step S5, the following steps may be further included.

[0062] Draw a Gantt chart of grain truck scheduling based on the operating time of all grain trucks.

[0063] Draw a Gantt chart for harvester scheduling based on the optimal operating time of all harvesters.

[0064] In this embodiment, after step S5, the following steps may be further included.

[0065] The operation position sequence of all grain transport vehicles is tabulated to obtain a grain transport vehicle operation position sequence table.

[0066] Tabulate the operation task sequences of all harvesters to obtain a harvester operation task sequence table.

[0067] In order to make the above technical solution of the present application clearer, the specific implementation process of the technical solution is described in detail below in the form of examples, which specifically includes the following steps.

[0068] Step 1: Construct an electronic map of the farm based on the topological map method. Accurate electronic map information is a prerequisite for operation path planning and agricultural machinery navigation. When performing full-field coverage operations, clear field boundary information is required. When transferring between operation plots, accurate farm road information is required. Therefore, the construction of the electronic map is very important. First, use GNSS to collect the longitude and latitude coordinate information of the road nodes and field boundary points of the planned farm, and number all nodes; then use the distance value calculation formula in the celestial coordinate system (Formula 1) to calculate the distance value between nodes; define the topological structure, establish the relationship between different map features, and define nodes (points), roads (lines), fields (areas) and their connections based on the one-way and two-way traffic characteristics of the roads, and establish an adjacency matrix.

[0069] (1).

[0070] In formula (1), is the radius of the Earth, in this embodiment The value is 6378137, in meters; 、 is the latitude of the two points in degrees; 、 is the longitude of the two points in degrees; The distance between two latitude coordinate points, in meters; The distance between two longitude coordinate points, in meters; represents the central angle, It is used to calculate the central angle The median value of The distance between two longitude and latitude coordinates, in meters.

[0071] Step 2: Path Planning. This primarily involves planning the harvester's full-coverage path within the field and the transfer path between fields. Path planning is the basis for calculating unloading point locations and allocating tasks. Generating and adjusting harvester unloading points requires information about the harvester's full-coverage path within the field. Accurate paths within the field and between-field transfer paths are also required for task allocation. Therefore, path planning forms the foundation for subsequent task allocation and vehicle scheduling.

[0072] First, based on the farm electronic map constructed in step 1, a hybrid method of inner spiral and reciprocating method is used to plan the full coverage path within the field. The reciprocating method selects the direction of the longest side of the plot boundary for traversal. The Dijkstra algorithm is used to obtain the shortest distance value and path node sequence between two points. The boundary point of each plot and the starting point of the longest side of the traversal are screened, and the boundary point with the smallest distance value is used as the plot entry point; then the plot exit point is determined, and the position point of each plot boundary point and the end of the full coverage path are screened. The boundary point with the smallest distance value is used as the plot exit point, and the entry and exit points of each plot to be operated are recorded.

[0073] Step 3: Task allocation for multiple harvesters based on a greedy minimum-maximum load balancing algorithm with a nearest neighbor heuristic. First, obtain the task sequence of all plots to be planned, the number of harvesters, the harvesting speed of the harvesters, and the driving speed of the harvesters. The driving speed of the harvesters refers to the general driving speed of the harvesters, that is, the uniform driving speed of the harvesters during harvesting. Then, a multi-harvester task allocation model is constructed, and tasks are allocated with the goal of minimizing the overall operating time of the harvesters. Task-related matrices such as the task quantity matrix, the distance matrix between task tasks, the distance matrix from the garage to each task, and the distance matrix from each task back to the garage are constructed. The greedy minimum-maximum load balancing algorithm based on the nearest neighbor heuristic is used to solve the problem and obtain the task sequence and operating time of each harvester.

[0074] 1) Variable description.

[0075] Task field collection M ={1, 2, 3, ..., i ,…, m}, a total of m A task field, i Number the task plots; Bi This is the entrance to the mission field. Di is the exit location; L i is the workload of the task field, in meters; A i For task plots i Start harvesting time; E i For task plots i Harvest end time; collection of all boundary points of the task field F ={ F1 ,…, Fi ,…, Fm}.

[0076] Harvester collection for S ={1, 2, 3, ..., k ,…, s}, a total of s harvester, k Number the harvester; S c is the grain tank capacity of the harvester, in tons; S d The cutting width of the harvester is in meters; S h is the harvesting speed of the harvester, in meters per hour; S t is the harvester transfer speed in meters per hour; S u The unloading rate of the harvester is in meters per hour.

[0077] The set of task sequences assigned by the harvester is task ={1, 2, 3, ..., b ,…, p}, a total of p tasks, b Number the task; task k For harvesters k Assigned task sequence.

[0078] In this embodiment, is a binary variable representing the harvester k Whether assigned to a task plot i If the harvester k Assigned to task plots i ,but =1, otherwise =0. is a binary variable representing the harvester k Whether to start from the granary Po to the mission field i If the harvester k From the granary Po to the mission field i ,but =1, otherwise =0. is a binary variable representing the harvester k Whether to start from the task field i Return to Granary Po; if the harvester k From the mission field i Return to the granary Po, then =1, otherwise =0.

[0079] 2) Objective function.

[0080] The optimization target of this model is the overall operation time of the harvester. TShortest (i.e. the longest running time of all harvesters is minimized), including harvesters k Total harvesting time within the task plot T 1k , the transfer time of the harvester from the granary to the first task field T 2k , the total transfer time of the harvester from the task field to the next task field T 3k , The transfer time of the harvester from the last task field back to the granary T 4k .

[0081] (2).

[0082] In formula (2), For harvesters k The operation time is in hours; Po represents a granary. In this embodiment, the granary is not only used to store grain, but also serves as a hangar for harvesters to park the harvesters. The harvesters start from the granary and arrive at each task plot in turn to perform the harvesting task. D PoBi is the transportation distance from the granary to the first mission field entry point, in meters; D DiPo The transport distance from the last mission field exit point to the granary, in meters; D DbBb+1 The transfer distance from the task plot exit point to the next task plot entry point, in meters; T 1k Represents a harvester k The total harvesting time within the task plot, in hours; T 2k It represents the transfer time of the harvester from the granary to the first task field, in hours; T 3k It represents the total transfer time of the harvester from one task field to the next task field, in hours; T 4k Indicates the transfer time of the harvester from the last task field back to the granary, in hours; S t is the harvester transfer speed in meters per hour; S h is the harvesting speed of the harvester, in meters per hour.

[0083] The mathematical model constructed for this problem and the objective function are expressed as formula (3).

[0084] (3).

[0085] In formula (3), It means minimizing the operation time of the harvester with the longest operation time among all harvesters. For harvesters k of working time.

[0086] 3) Constraints.

[0087] This embodiment has the following constraints.

[0088] (4).

[0089] In formula (4), Represents a harvester k Whether assigned to a task plot i , This means that each task field must and can only be served by one harvester group once, and multiple harvester groups are not allowed to serve the same task field.

[0090] (5).

[0091] In formula (5), Represents a harvester k Whether to start from the granary Po to the mission field i , This means that each harvester only leaves the granary once during operation, that is, when it heads to the first task field.

[0092] (6).

[0093] In formula (6), Represents a harvester k Whether to start from the task field i Return to the granary Po, This means that each harvester will only return to the granary once during its operation, that is, when the first task field is completed.

[0094] (7).

[0095] In formula (7), L i is the workload of the task field, in meters; A i For task plots i The time to start harvesting, in hours; E i For task plots i The harvesting end time, in hours; S h is the harvesting speed of the harvester, in meters per hour.

[0096] (8).

[0097] In formula (8), A i+1 Plot for the next task i+ 1. Harvest start time, in hours; E i+1 Plot for the next task i+ 1. Harvest end time, in hours; L i+1 Plot for the next task i+ 1 task workload; D DiBi+1 The transfer distance from the task plot exit point to the next task plot entry point, in meters; S h is the harvesting speed of the harvester, in meters per hour; S t is the transfer speed of the harvester in meters per hour.

[0098] Step 4: Based on the algorithm for generating and adjusting harvester unloading points at the headland, determine the location of the unloading points. First, obtain the full coverage path information of the harvester within the field obtained in step 2, the harvester's harvesting speed, operating width, grain tank volume, and the field unit area conversion yield coefficient. Then, calculate the path length of the harvester when the bin is full according to formula (9) to determine all the full unloading points in the entire field. Select the headland area closest to the starting point as the unloading area, filter all unloading points, and generate and adjust new unloading points for unloading points that are not in the selected headland area. Unloading point adjustment principle: For unloading points on the external spiral path, the unloading point can be selected to unload at the entire headland area; for unloading points on the internal reciprocating path, the unloading point can be selected to unload at the front of the working row in the headland area. Add the last unloading point at the exit point to ensure that the harvester bin is empty when transferring to the next task field. Calculate the grain capacity and unloading time of the harvester bin at each unloading point location.

[0099] (9).

[0100] In formula (9), L is the length of the harvesting path when the harvester is full, in meters; CH is the volume of the harvester's grain tank, in tons; D The harvesting width of the harvester, in meters; lamda The unit is the area conversion yield coefficient, and the unit is tons / square meter.

[0101] Step 5: Grain truck scheduling and planning is performed using a hybrid genetic and heuristic iteration-based multi-grain truck scheduling and planning algorithm. First, the parameters for all the field tasks to be planned, including the unloading point location information, unloading time, granary location information, unloading grain quantity at the unloading point location, number of grain trucks, driving speed of grain trucks, and grain truck bucket capacity, are obtained. The driving speed of grain trucks refers to the general driving speed of grain trucks, that is, the uniform speed of grain trucks when transporting grain. Then, a multi-grain truck system scheduling model is constructed. The scheduling and planning objectives are to minimize the sum of the total driving distances of all grain trucks and the sum of the waiting times of all harvesters. Unloading task-related matrices such as the unloading point location matrix, unloading grain quantity matrix, and unloading time matrix are constructed. The hybrid genetic and heuristic iteration algorithm is used to solve the problem and obtain the operation position sequence and operation time of each grain truck.

[0102] 1) Variable description.

[0103] Grain transport truck collection N ={1, 2, 3, ..., j ,…, n}, a total of n A grain truck, j numbering grain trucks; N c is the capacity of the grain truck bed, in tons; Nq The real-time amount of grain loaded in the grain truck bed, in tons; N t is the speed of the grain truck, in meters per hour; N u is the grain truck unloading rate, in tons / hour; j The process of loading grain from the granary to unloading grain after the truck is full is completed. A j , and the end time is E j .

[0104] The set of operation position sequences currently assigned to the grain transport vehicle is upoint ={1, 2, 3, ..., g ,…, x}, a total of x The operation location points assigned to each grain transport vehicle include the starting point from the grain warehouse during the operation and the return point to the grain warehouse when unloading grain. g The operating position number assigned to the grain truck, upoint j For grain transport vehicles j The sequence of assigned job positions.

[0105] The set of all unloading point operation locations is U ={1, 2, 3, ...,t ,…, u}, a total of u An operating point for unloading grain, t is the operation position number of the grain unloading point, and the grain unloading amount of each operation position is Uc t , in tons; the waiting time of the harvester at each operating position is Uw t , in hours; the waiting time of the grain truck at each operation location is Ug t , in hours.

[0106] In this embodiment, is a binary variable representing the grain truck j Whether assigned to a job location t If the grain truck j Assigned to a work location t ,but =1, otherwise =0. is a binary variable representing the grain truck j Whether to start from the granary Po to the operation location t If the grain truck j From the granary Po to the working position t ,but =1, otherwise =0. is a binary variable representing the grain truck j Whether from the working position t Return to the granary Po; if the grain truck j From the working position t Return to the granary Po, then =1, otherwise =0.

[0107] 2) Objective function.

[0108] In this embodiment, the objective function To minimize the total driving distance, that is, the sum of the total driving distances of all grain trucks is minimized, which is expressed as follows.

[0109] (10).

[0110] In formula (10), is the distance between adjacent working positions, in meters; For grain transport vehicles j The total driving distance value in meters.

[0111] In this embodiment, the objective function To minimize the waiting time, that is, the sum of the waiting times of all harvesters is minimized, it is expressed as follows.

[0112] (11).

[0113] In formula (11), a Represents task fields i shared within a Working location points, The waiting time of the harvester in the current task field, in hours; Represents a harvester k Whether assigned to a task plot i ; For harvesters k The waiting time in hours.

[0114] In this embodiment, the overall objective function It is to minimize the combination of the above two objectives, that is, the sum of the grain truck driving time and the harvester waiting time is minimized, which is expressed as follows.

[0115] (12).

[0116] In formula (12), For grain transport vehicles j The total driving distance value in meters; N t is the speed of the grain truck, in meters per hour; For harvesters k The waiting time in hours.

[0117] 3) Constraints.

[0118] This embodiment has the following constraints.

[0119] (13).

[0120] In formula (13), Grain transport truck j Whether assigned to a job location t , This means that each work location must and can only be served by one grain transport vehicle at a time, and multiple grain transport vehicles are not allowed to serve the same work location.

[0121] (14).

[0122] In formula (14), Uc t represents the grain unloading amount at each operating location, S cIndicates the grain tank capacity of the harvester.

[0123] (15).

[0124] In formula (15), Grain transport truck j The amount of grain unloaded at each operating location, Grain transport truck j In the assigned work location q The sum of the grain unloading amounts at consecutive operating positions, Indicates the capacity of the grain truck bed. For grain transport vehicles j Real-time amount of grain loaded in the truck bed.

[0125] (16).

[0126] In formula (16), N c Indicates the capacity of the grain truck bed. Grain transport truck j In the assigned work location, q The grain unloading amount of the continuous operation position plus the grain unloading amount of the next operation position is called the maximum loading of the continuous grain truck. q Working location points, q is the maximum number of loading times for a grain truck, q It varies with the amount of food at each operating location. Grain transport truck j Whether from the working position t Return to the granary Po, =1 means grain truck j From the working position t Return to Granary Po. Grain Truck j Need to q After loading grain at each operation location, the grain truck goes to the granary Po to unload the grain. Nq becomes 0.

[0127] (17).

[0128] (18).

[0129] (19).

[0130] (20).

[0131] Formula (20) is the harvester operation time constraint update, which means the harvester is in the task field. iThe operation time window should meet the conditions, that is, the harvester is in the task field i The operation time of the harvester is i Harvest time and task plots i The sum of the unloading time and waiting time at the middle position, Grain transport truck j Whether to start from the granary Po to the operation location t , =1 means grain truck j From the granary Po to the working position t ; Represents task fields i of grain unloading; L i is the workload of the task field, in meters; A i For task plots i The time to start harvesting, in hours; E i For task plots i The harvesting end time, in hours; S h is the harvesting speed of the harvester, in meters per hour; S u The unloading rate of the harvester is in meters per hour.

[0132] (twenty one).

[0133] At the same time, update the harvester from the mission field i To the mission field i+ The time window of 1 should satisfy the constraints.

[0134] In this embodiment, the time window for the grain truck to return to the granary Po to unload grain should satisfy formula (22).

[0135] (twenty two).

[0136] Formula (22) represents the grain transport vehicle j The time window from loading grain from granary Po to returning to the granary with a full truck to unload grain should meet the conditions, that is, the grain truck j During this period, continuous loading q Operation location point, operation time is the loading time of the grain truck loading location point ( ) and waiting time ( )、Granary unloading time( ) and transfer time ( ). Among them, N t is the speed of the grain truck, in meters per hour;N u is the grain truck unloading rate, in tons / hour; A j and E j Grain transport trucks j The start and end time from loading grain from the granary to returning to the granary with a full truck bed to unload grain. Represents the grain truck at each operating location j The waiting time, in hours; Indicates the distance traveled by the grain truck from the current operating position to the next operating position, in meters; Indicates the distance traveled by the grain truck from the granary Po to the first operating location, in meters; Indicates that the grain truck is from q The driving distance from the work location to the granary Po, in meters.

[0137] Step 6: Update harvester operating time. First, obtain the harvester's round-trip time, inter-plot transfer time, and intra-plot harvesting time from Step 3. Obtain the grain capacity of the harvester's grain tank at each unloading point from Step 4 and calculate the unloading time. Obtain the harvester's waiting time at each unloading point from Step 5. Update the harvester operating time. Then, based on the harvester operating time and the grain truck operating time, create a Gantt chart for harvester scheduling and a Gantt chart for grain truck scheduling. The harvester scheduling Gantt chart and the grain truck scheduling Gantt chart provide a clearer and more intuitive view of the specific operating time of each harvester and grain truck.

[0138] In this embodiment, the total operation time of the harvester is the sum of the time it takes for the harvester to go back and forth to the garage, the time it takes to transfer between task plots, the harvesting time, the unloading time, and the waiting time.

[0139] This embodiment is based on the principle of multi-machine collaborative scheduling planning technology for harvesting and transporting. Figure 2As shown. First, the longitude and latitude coordinates of the road nodes and field boundary points of the planned farm based on the GNSS system are obtained, and the farm electronic map is constructed using the topological map method; then, the field boundary information and agricultural machinery operation information of the farm electronic map are used to identify the field boundary and complete the harvester field internal coverage path planning. The farm electronic map road information is used to complete the harvester field transfer path planning; then, based on the nearest neighbor heuristic greedy minimum-maximum load balancing algorithm, the harvester field full coverage path and the inter-field transfer path are combined to obtain the harvester operation task sequence and realize the task allocation of multiple harvesters; then, based on the nearest neighbor heuristic greedy minimum-maximum load balancing algorithm, the harvester field full coverage path and the inter-field transfer path are combined to obtain the harvester operation task sequence and realize the task allocation of multiple harvesters; The method combines full-coverage path planning within the harvester field with a harvester unloading point generation and adjustment algorithm for unloading grain at the headland to determine the harvester unloading point location. A multi-vehicle system scheduling model and unloading task correlation matrix are then constructed using the harvester task sequence, harvester unloading point location, harvester operating parameters, and grain truck operating parameters. A multi-vehicle scheduling and planning algorithm based on a hybrid genetic and heuristic iteration algorithm is used to determine the optimal operating time for the grain trucks. Finally, the grain truck scheduling and planning results are used to update the harvester operating time, ultimately helping to determine the optimal operating time and operating path for the harvester and grain truck. The operating time can be visualized in a table format, i.e., an operating timetable, making information such as operating time more intuitive and clear.

[0140] In this embodiment, GNSS is first used to collect the longitude and latitude coordinates of the road nodes and field boundary points of the planned farm, and all nodes are numbered; then the distance value calculation formula (Formula 1) in the celestial coordinate system is used to calculate the distance value between the nodes; the topological structure is defined, and the relationship between different map features is established. Based on the one-way and two-way traffic characteristics of the road, nodes (points), roads (lines) and fields (areas) and their connections are defined, and an adjacency matrix is ​​established to construct an electronic map of the farm, such as Figure 3 As shown. Specifically, the farm electronic map constructed by the topological map method is divided into 21 plots, of which there are 16 plots of farmland that can be operated and 1 granary. The longitude and latitude coordinates of all the nodes of the farm are extracted and marked with numbers to define the topological structure, establish the adjacency matrix, and construct the farm electronic map. Then, using the farm electronic map, the Dijkstra algorithm is used to obtain the shortest distance value and path node sequence between two points, and the boundary point of each plot and the starting point of the longest side traversed by the reciprocating method are screened. The boundary point with the smallest distance value is used as the plot entry point; with the plot entry point as the starting point, the full coverage path planning algorithm (inner spiral + reciprocating method) is used to plan the full coverage path inside the harvester plot to obtain the full coverage path of the plot to be operated; then the plot exit point is determined, and the position point where each plot boundary point and the end of the full coverage path are screened. The boundary point with the smallest distance value is used as the plot exit point, and the entry and exit points of each plot to be operated are recorded. Specifically, as Figure 4As shown in the figure, a hybrid internal spiral and reciprocating method was used to plan a full-coverage path within the harvester plot, selecting Field 4 from the farm's electronic map. The internal spiral coverage layer was three, and the machine's operating width was set to 3 meters. The path planning results show that the point on the lower left is the starting point for the full-coverage path planning, which is the entrance to Field 4 and corresponds to point 32 on the farm's electronic map. The point on the upper left is the ending point for the full-coverage path planning, which is the exit from Field 4 and corresponds to point 30 on the farm's electronic map.

[0141] In this embodiment, all parameters such as the set of farmland tasks, the number of harvesters, the harvesting speed of the harvesters, and the driving speed of the harvesters of the farm to be planned are obtained. Task allocation is performed with the goal of minimizing the overall operating time of the harvesters, a multi-harvester task allocation model is constructed, and the greedy minimum-maximum load balancing algorithm based on the nearest neighbor heuristic is used to solve the problem, so as to obtain the operating task sequence and operating time of each harvester. The greedy minimum-maximum load balancing algorithm based on the nearest neighbor heuristic gives priority to minimizing the maximum load on any resource in each iteration, with the aim of evenly distributing the workload among the resources. At the same time, the nearest neighbor heuristic algorithm is used to further optimize the results of the initial allocation to improve resource utilization or minimize the overall workload. In the task allocation scenario, this method can minimize the maximum load between resources while taking into account simplicity, efficiency, and adaptability.

[0142] like Figure 5 As shown, the greedy minimum-maximum load balancing algorithm based on nearest neighbor heuristic used in this embodiment includes the following steps.

[0143] (1) Construct a multi-harvester task allocation model, including the task quantity matrix, the distance matrix between tasks, the distance matrix from the garage to each task, and the distance matrix from each task back to the garage.

[0144] (2) Initialization: Initialize all task sets, task assignment sets, harvester time, harvester tasks, etc.

[0145] (3) Task allocation (greedy min-max load balancing): Assign each task, and if the task is assigned to a harvester, find the harvester that minimizes the maximum potential running time.

[0146] (4) Task allocation (greedy min-max load balancing): Assign tasks to selected harvesters, delete assigned tasks, and update the task set; update the harvester time and sequence accordingly.

[0147] (5) Sequence optimization (nearest neighbor heuristic): For each harvester, the order of tasks in the harvester task sequence is optimized using the nearest neighbor heuristic.

[0148] (6) Update: Recalculate the harvester time based on the optimized harvester task sequence and construct the harvester operation time.

[0149] (7) Output: The harvester’s task sequence and operation time as well as the overall operation time of each harvester.

[0150] In this embodiment, based on the full coverage path information within the harvester field, the harvesting speed, operating width, grain box volume of the harvester, and the farmland unit as the area conversion yield coefficient and other parameters; calculate the path length of the harvest when the harvester is full, and determine all the full grain unloading points of the entire farmland; screen all the grain unloading points, and generate and adjust new grain unloading points for the grain unloading points that are not in the selected field area, and add the last grain unloading point at the exit point to ensure that the harvester grain bin is empty when transferring to the next task field. Calculate and output the latitude and longitude coordinates of each grain unloading point location and the grain capacity of the harvester grain box. Specifically, select farmland No. 4 in the farm electronic map to adjust the grain unloading points. The adjusted grain unloading point position of farmland No. 4 is as follows Figure 6 As shown, all unloading points were located in the headland area closest to the starting point. Key parameters included a harvester tank capacity of 1.6 tons, a harvester operating width of 3 meters, and a harvester unloading rate of 38 tons per hour. A total of 10 unloading points were obtained: two located on the outer spiral path of the headland area, seven located in front of the working rows in the headland area, and one located at the plot exit. Table 1 shows all unloading point parameters for Farmland No. 4.

[0151] Table 1 Parameters of all unloading points in farmland No. 4

[0152] like Figure 7 As shown, the harvester farmland unloading point generation and adjustment algorithm based on field unloading used in this embodiment includes the following steps.

[0153] (1) Obtain parameters such as the harvester's grain tank capacity, harvesting speed, and operating width, call the full coverage path planning algorithm, and obtain full coverage path information.

[0154] (2) Calculate the changes in longitude and latitude within a specified distance to convert geographic coordinates; calculate parameters such as the length of the spiral and reciprocating paths, the cumulative distance, and the grain harvest of the path segment.

[0155] (3) Based on the volume of the harvester's grain tank, calculate the length of the full bin path and determine the longitude and latitude coordinates of all full bin unloading points in the farmland.

[0156] (4) Traverse all full-warehouse unloading points, filter out the unloading points that are not in the selected field area, make adjustments and generate new unloading point locations, and update the set of unloading points.

[0157] (5) Add a final unloading point at the exit point to ensure that the harvester's granary is empty when transferring to the next task field.

[0158] (6) Calculate the grain capacity of the harvester's grain tank at each unloading point and generate a set of grain quantities at each unloading point.

[0159] (7) Output the latitude and longitude coordinates of each unloading point and the grain capacity of the harvester's grain tank.

[0160] In this example, parameters such as the unloading point locations, unloading times, granary locations, grain volume unloaded at the unloading points, number of grain trucks, typical speeds, and bucket capacities are obtained for all planned farmland tasks. A multi-grain truck scheduling model is constructed, with the goal of minimizing the sum of all trucks' travel distances and the sum of all harvester waiting times. A hybrid genetic and heuristic iterative algorithm is employed to determine the sequence of operating positions and operating times for each truck. A multi-grain truck scheduling and planning algorithm based on a hybrid genetic and heuristic iteration approach is employed, using a genetic algorithm to explore a vast solution space and employing a heuristic method to refine the optimal solution found. This combination leverages the global search capabilities of the genetic algorithm and the local optimization advantages of the heuristic method to effectively solve the complex grain truck scheduling problem, ensuring a robust and effective solution to the optimization challenge.

[0161] like Figure 8 As shown, the multi-grain truck scheduling planning algorithm based on hybrid genetic and heuristic iteration used in this embodiment includes the following steps.

[0162] (1) Construct a multi-grain transport system scheduling model, and construct the grain unloading point location matrix, unloading grain quantity matrix, and unloading time matrix.

[0163] (2) Initialization: Set and initialize the genetic algorithm parameters and use heuristic methods to generate an initial population of potential solutions (schedules).

[0164] (3) Evaluation: The fitness of each individual in the population is evaluated using a heuristic-based fitness measure, which is calculated based on criteria such as the total distance traveled by grain trucks and the waiting time of harvesters.

[0165] (4) Selection: The league selection method is used to select the most suitable individuals from the population as parents of the next generation.

[0166] (5) Crossover: Using the single-point crossover method, part of the contents of the two parent schedules are exchanged to generate a new offspring schedule.

[0167] (6) Mutation: The exchange mutation method is used, that is, two elements in the planned table are randomly exchanged in the offspring to maintain genetic diversity.

[0168] (7) The old population is replaced by the new population (offspring), the number of iterations is increased by 1, and the evaluation, selection, crossover and mutation steps are repeated within a predetermined number of generations.

[0169] (8) Optimization: After the last generation, a heuristic method is used to optimize the best solution found by the GA (Genetic Algorithm) to further shorten the distance and waiting time.

[0170] (9) Based on the optimization results, the total path of the grain transport vehicle, the waiting time of the harvester and other parameters are calculated to construct the operation time of the grain transport vehicle.

[0171] (10) Output: The operation position sequence and operation schedule of the grain transport vehicle. The operation schedule is the operation time information in a tabular form, including data such as the total driving distance of the grain transport vehicle, the waiting time of the harvester, and the waiting time of the grain transport vehicle.

[0172] This embodiment also considers updating harvester operating times. First, the harvester's travel time to and from the garage, the transfer time between task plots, and the harvesting time within a plot are obtained. The grain capacity of the harvester's grain tank at each unloading point is obtained and the unloading time is calculated. The harvester's waiting time at each unloading point is obtained, and the harvester's operating time is updated. Based on the harvester operating time and the grain truck operating time, Gantt charts for harvester scheduling and grain truck scheduling are drawn, respectively. The harvester scheduling Gantt chart includes information such as each harvester's waiting time, unloading time, transfer time, and harvesting time. The grain truck scheduling Gantt chart includes information such as each grain truck's waiting time, transfer time, field loading time, and grain silo unloading time. Specifically, farmlands 1, 2, 4, 5, 6, 7, 8, 10, 12, 13, 15, and 16 on the farm's electronic map are selected for multi-machine collaborative scheduling planning. The main parameters set include: three harvesters, a 2.0-ton harvester tank capacity, a 3-meter harvester operating width, a 3000-meter-per-hour harvesting speed, a 6000-meter-per-hour average travel speed, a 38-ton-per-hour unloading rate, three grain trucks, a 60-ton grain truck bucket capacity, a 60-ton unloading rate, and a 10,000-meter-per-hour travel speed. A total of 68 unloading points were planned. The harvester task sequence and overall operation time are shown in Table 2.

[0173] Table 2 Harvester task sequence and overall operation time results

[0174] In this embodiment, the operation position sequences and overall operation time results of all grain transport vehicles are shown in Table 3.

[0175] Table 3 Operation position sequence and overall operation time results of all grain transport vehicles

[0176] The present embodiment proposes a multi-machine collaborative scheduling and planning method and system based on harvesting and transporting, which is a scheduling and planning method for the operations of multiple heterogeneous agricultural machinery. The system simultaneously schedules and plans the harvesting operations of multiple harvesters and the grain transport operations of multiple grain trucks. Combined with the latitude and longitude coordinate information of the actual farm, it facilitates the navigation operations of agricultural machinery and provides a more intelligent and efficient solution for the scheduling of multiple agricultural machinery in harvesting operation scenarios, with better adaptability and flexibility. A multi-harvester task allocation algorithm based on the greedy minimum-maximum load balancing algorithm based on the nearest neighbor heuristic is adopted. The algorithm prioritizes minimizing the maximum load on any resource in each iteration, with the aim of evenly distributing the workload among resources. At the same time, the nearest neighbor heuristic algorithm is used to further optimize the initial allocation results to improve resource utilization or minimize the overall workload. In the task allocation scenario, this method can minimize the maximum load between resources while taking into account simplicity, efficiency and adaptability. The system also employs an algorithm for generating and adjusting harvester unloading points based on headland unloading. This algorithm can adjust all unloading points to the designated headland area, reducing the complexity of grain truck transfer scheduling and better meeting the needs of actual agricultural production. A multi-grain truck scheduling and planning algorithm based on a hybrid genetic and heuristic iterative algorithm was also applied. This hybrid optimization method fully leverages the global search capabilities of the genetic algorithm and the local optimization advantages of the heuristic method to effectively solve the complex grain truck routing problem, ensuring a robust and effective solution to the optimization challenge.

[0177] In an exemplary embodiment, a multi-machine collaborative scheduling planning system based on harvesting and transportation is also provided, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the above-mentioned multi-machine collaborative scheduling planning method based on harvesting and transportation.

[0178] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0179] This document uses specific examples to illustrate the principles and implementation methods of this application. The description of the above examples is only intended to help understand the method and core concept of this application. At the same time, for those skilled in the art, based on the concept of this application, there may be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting this application.

Claims

1. A multi-machine collaborative scheduling planning method based on harvesting-transportation, characterized in that: The multi-machine collaborative scheduling planning method based on harvesting-transportation includes: Obtaining basic location information of the farm to be planned; the basic location information includes longitude and latitude coordinate information of road nodes and longitude and latitude coordinate information of field boundary points; According to the basic location information, a harvester operation path is planned for the field task set of the farm to be planned, and a harvester field full coverage path and an inter-field transfer path of the field to be operated are obtained; Determine the operation task sequence and operation time of each harvester according to the full coverage path within the field and the transfer path between the fields of the harvester; Determine the operation position sequence and operation time of each grain transport vehicle according to the full coverage path of the harvester in the field plot, the operation parameters of the harvester and the grain transport vehicle; According to the operation position sequence and operation time of all grain transport vehicles, the operation time of all harvesters is updated to obtain the optimal operation time of each harvester.

2. The multi-machine collaborative scheduling planning method based on harvesting and transportation according to claim 1 is characterized in that: According to the basic location information, the harvester operation path is planned for the field task set of the farm to be planned, and the harvester field full coverage path and inter-field transfer path of the field to be operated are obtained, which specifically includes: Based on the basic location information, a farm electronic map of the farm to be planned is constructed using a topological map method; According to the farm electronic map, the harvester full coverage path within the field and the inter-field transfer path of the field to be operated are determined respectively.

3. The multi-machine collaborative scheduling planning method based on harvesting and transportation according to claim 1 is characterized in that: According to the full coverage path within the field and the transfer path between the fields of the harvester, the operation task sequence and operation time of each harvester are determined, specifically including: According to the full coverage path of the harvester within the field to be operated and the transfer path between the fields, a greedy minimum-maximum load balancing algorithm based on nearest neighbor heuristic is adopted to determine the operation task sequence and operation time of each harvester.

4. The multi-machine collaborative scheduling planning method based on harvesting and transportation according to claim 3 is characterized in that: According to the harvester full coverage path within the field to be operated and the inter-field transfer path, a greedy minimum-maximum load balancing algorithm based on nearest neighbor heuristic is used to determine the operation task sequence and operation time of each harvester, specifically including: According to the full coverage path within the field plot and the transfer path between the field plots of the harvester, a field plot task sequence to be assigned in the field plot task set is determined; the field plot task sequence is a sequence composed of all the fields to be assigned to each harvester in sequence; A multi-harvester task allocation model is constructed according to the field task sequence, the field task set and the basic parameters of the harvester; the basic parameters of the harvester include the number of harvesters, the harvesting operation speed of the harvester and the driving speed of the harvester, and the multi-harvester task allocation model is a model for allocating tasks with the goal of minimizing the overall operation time of the harvester; Based on the multi-harvester task allocation model, a task correlation matrix is ​​constructed; the task correlation matrix includes a task quantity matrix, a distance matrix between task, a distance matrix from the garage to each task, and a distance matrix from each task back to the garage; According to the operation task correlation matrix, a greedy minimum-maximum load balancing algorithm based on nearest neighbor heuristic is adopted to solve the multi-harvester task allocation model to obtain the operation task sequence and operation time of each harvester.

5. The multi-machine collaborative scheduling planning method based on harvesting and transportation according to claim 1 is characterized in that: According to the full coverage path of the harvester in the field, the operation parameters of the harvester and the grain transport vehicle, the operation position sequence and operation time of each grain transport vehicle are determined, specifically including: According to the full coverage path of the harvester in the field, the location of each unloading point in the farm to be planned is determined by using a harvester farmland unloading point generation and adjustment algorithm based on field unloading; According to the harvesting speed parameters of the harvester, determine the unloading time of each unloading point in the farmland task; According to the location and time of each grain unloading point, a multi-grain truck scheduling and planning algorithm based on hybrid genetic and heuristic iteration is used to determine the operation position sequence and operation time of each grain truck.

6. The multi-machine collaborative scheduling planning method based on harvesting and transportation according to claim 5 is characterized in that: According to the full coverage path of the harvester in the field, the harvester farmland unloading point generation and adjustment algorithm based on field unloading is adopted to determine the positions of each unloading point in the farm to be planned, and according to the harvesting operation speed parameters of the harvester, the unloading time of each unloading point in the farmland task is determined, specifically including: According to the full coverage path of the harvester in the field, the length of the harvesting path of each harvester when the bin is full is calculated; Determine the grain unloading points of all the farmland in the planned farm when the warehouse is full according to the length of the harvesting path of each harvester when the warehouse is full; For all grain unloading points, the field area closest to the starting point is selected as the grain unloading area to screen the grain unloading points, and the positions of the grain unloading points in the grain unloading area are determined; For the grain unloading points outside the grain unloading area, the grain unloading points are adjusted according to the grain unloading point adjustment principle and new grain unloading points are generated, and the positions of the adjusted new grain unloading points are determined; The principles for adjusting the grain unloading point include: For the unloading point on the external spiral path, the unloading point on the external spiral path will be adjusted to the entire field area as the new unloading point for unloading; For the unloading point on the internal reciprocating path, adjust the unloading point on the internal reciprocating path to the front of the working row in the field head area as the new unloading point for unloading; Adding a last new grain unloading point at the exit point of the fully covered path in the harvester field to ensure that the harvester grain bin is empty when the harvester transfers to the next task field; According to the harvesting speed of the harvester, the unloading time when the harvester arrives at each unloading point is calculated.

7. The multi-machine collaborative scheduling planning method based on harvesting and transportation according to claim 5 is characterized in that: According to the location and time of each grain unloading point, a multi-grain transport vehicle scheduling and planning algorithm based on hybrid genetic and heuristic iteration is used to determine the operation position sequence and operation time of each grain transport vehicle, including: According to the location of each grain unloading point, the grain unloading time and the basic parameters of the grain transport vehicle, a multi-grain transport vehicle system scheduling model is constructed; the basic parameters of the grain transport vehicle include the number of grain transport vehicles, the driving speed of the grain transport vehicle and the bucket capacity of the grain transport vehicle. The multi-grain transport vehicle system scheduling model is a model for scheduling planning with the goal of minimizing the sum of the total driving distances of all grain transport vehicles and minimizing the sum of the waiting time of all harvesters; Based on the multi-grain transport vehicle system scheduling model, a grain unloading task correlation matrix is ​​constructed; the grain unloading task correlation matrix includes a grain unloading point location matrix, a grain unloading amount matrix and a grain unloading time matrix; According to the grain unloading task correlation matrix, a multi-grain truck scheduling planning algorithm based on hybrid genetic and heuristic iteration is adopted to solve the multi-grain truck system scheduling model to obtain the operation position sequence and operation time of each grain truck.

8. The multi-machine collaborative scheduling planning method based on harvesting and transportation according to claim 1 is characterized in that: After the step of updating the operation time of all harvesters according to the operation position sequence and operation time of all grain transport vehicles to obtain the optimal operation time of each harvester, the multi-machine coordinated scheduling planning method based on harvesting-transportation further includes: Draw a Gantt chart of grain truck scheduling based on the operating time of all grain trucks; Draw a harvester scheduling Gantt chart based on the optimal operating time of all harvesters.

9. The multi-machine collaborative scheduling planning method based on harvesting and transportation according to claim 1 is characterized in that: After the step of updating the operation time of all harvesters according to the operation position sequence and operation time of all grain transport vehicles to obtain the optimal operation time of each harvester, the multi-machine coordinated scheduling planning method based on harvesting-transportation further includes: Tabulate the operation position sequence of all grain transport vehicles to obtain the operation position sequence table of grain transport vehicles; Tabulate the operation task sequences of all harvesters to obtain a harvester operation task sequence table.

10. A multi-machine collaborative scheduling planning system based on harvesting and transportation, comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the harvesting-transportation-based multi-machine collaborative scheduling planning method described in any one of claims 1 to 9.

Citation Information

Patent Citations

  • Unmanned grain combine harvester collaborative navigation operation path planning system and method

    CN111103880A

  • Harvesting robot operation path planning method based on improved ant colony algorithm

    CN113190017A

  • Multi-grain combine harvester and grain transport vehicle collaborative operation path planning method and system

    CN115657669A

  • Whole-process path planning method, system and equipment for collaborative operation of multiple agricultural machines

    CN117270526A

  • Coordination of harvesting and transport units for area coverage

    WO2018185522A1

Cited By

  • F-PBVS-based harvester unloading cylinder pose automatic adjusting system and method

    CN119759108A