Vegetable planting agricultural machinery sharing service management platform

Abstract

The invention discloses a vegetable planting agricultural machinery sharing service management platform, and relates to the technical field of agricultural management. The system comprises a storage unit which is used for updating and storing an order record of each planting work order in a service management area; the planning guide unit is used for extracting order records of the service management area in the last year; according to the agricultural machinery number, the agricultural machinery driver number, the work order time and the work order position of the planting work order in the order record, taking the planting order with service relevance as an associated planting order; dividing a plurality of intensive planting areas; dividing concentrated demand time periods in a natural year and corresponding agricultural machinery types; and the information issuing unit is used for sending the concentrated demand time period of each concentrated planting area in the natural year and the corresponding agricultural machinery type to an agricultural machinery holder and an agricultural machinery driver in the current year. The service matching degree and the working efficiency of the agricultural machinery and the agricultural machinist are improved.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of agricultural management, and particularly relates to a vegetable planting agricultural machine sharing service management platform. BACKGROUND

[0002] Vegetable planting is an important part of China's agriculture, and is related to the national economy and people's livelihood and the economic benefits of vegetable farmers. Unlike traditional field crops (such as rice and wheat), vegetable planting has the characteristics of short production cycle, high multiple cropping index, many agricultural operation links (such as plowing, ridging, seeding, transplanting, water and fertilizer management, plant protection, harvesting, etc.), and relatively dispersed plots. These characteristics determine that vegetable production has a strong and high-frequency demand for small and medium-sized, special-purpose agricultural machinery (hereinafter referred to as "agricultural machinery").

[0003] The prior art cannot effectively solve the problems of low efficiency of agricultural machinery resource allocation, inaccurate service supply and demand matching, etc. in the field of vegetable planting. SUMMARY

[0004] The purpose of the present application is to provide a vegetable planting agricultural machine sharing service management platform, which can improve the service matching degree and work efficiency of agricultural machinery and agricultural machinery operators by analyzing the order records in the service management area and estimating the agricultural machinery demand of different areas at different times.

[0005] To solve the above technical problems, the present application is realized by the following technical scheme: The present application provides a vegetable planting agricultural machine sharing service management platform, comprising, a storage unit for updating and storing the order records of each planting work order in the service management area; a planning guide unit for extracting the order records of the service management area in the previous year to obtain the vegetable type, vegetable growth stage, agricultural machinery type, agricultural machinery number, agricultural machinery operator number, work order time, and work order location of each planting work order; According to the agricultural machinery number, agricultural machinery operator number, work order time, and work order location of the planting work order in the order record, the planting order with service correlation is taken as the associated planting order; According to the associated planting order and the vegetable type, vegetable growth stage, and agricultural machinery type of each planting order in the order record, a plurality of intensive planting areas are divided in the service management area; the concentrated demand period and the corresponding agricultural machinery type in the natural year are divided; an information publishing unit for sending the concentrated demand period and the corresponding agricultural machinery type of each intensive planting area in the natural year to the agricultural machinery owner and the agricultural machinery operator in the current year.

[0006] The application analyzes each planting work order of the platform in the last year through the planning guide unit, finds out the associated planting orders, and then performs relevance analysis on each order record, thereby dividing intensive planting areas and dividing the concentrated demand period in the natural year and the corresponding agricultural machinery type, so as to realize the planning and guidance of the agricultural machinery holder and the agricultural machinery hand, improve the matching degree of subsequent agricultural machinery and vegetable planting services, and improve the work efficiency of the agricultural machinery and the agricultural machinery hand.

[0007] Of course, implementing any product of the application does not necessarily require achieving all the advantages described above at the same time. BRIEF DESCRIPTION OF DRAWINGS

[0008] In order to more clearly illustrate the technical solutions of the embodiments of the application, the drawings needed for the embodiment description will be briefly introduced as follows. Obviously, the drawings in the following description are only some embodiments of the application, and other drawings can also be obtained by those skilled in the art without creative labor.

[0009] Figure 1 A functional unit and information flow direction schematic diagram of the vegetable planting agricultural machinery sharing service management platform according to an embodiment of the application; Figure 2 A functional flow schematic diagram of the storage unit, the planning guide unit and the information publishing unit according to an embodiment of the application; Figure 3 A functional flow schematic diagram of step S2 according to an embodiment of the application; Figure 4 A functional flow schematic diagram of step S3 according to an embodiment of the application; Figure 5 A functional flow schematic diagram of step S34 according to an embodiment of the application; Figure 6 A functional flow schematic diagram of step S4 according to an embodiment of the application; Figure 7 A functional flow schematic diagram of step S03 according to an embodiment of the application; Figure 8 A schematic diagram of different state agricultural machinery hands according to an embodiment of the application; Figure 9 A schematic diagram of different state agricultural machinery according to an embodiment of the application; Figure 10 A schematic diagram of different intensive planting areas according to an embodiment of the application; Figure 11 A schematic diagram of the matching state of the agricultural machinery hand, the agricultural machinery and the intensive planting area according to an embodiment of the application.

[0010] The components represented by the reference numbers in the drawings are listed as follows: 1 - storage unit, 2 - planning guide unit, 3 - information publishing unit. DETAILED DESCRIPTION

[0011] In order to make the purpose, technical scheme and advantages of the present application clearer, the embodiments of the present application will be further described in detail below with reference to the drawings.

[0012] It should be noted that the terms "first", "second", and the like in the present application are used to distinguish similar objects, and do not necessarily have to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0013] Referring to Figure 1 and Figure 2 The present application provides a vegetable planting agricultural machinery sharing service management platform, which includes a storage unit 1, a planning guide unit 2 and an information publishing unit 3 from the functional unit. The storage unit 1 continuously updates and stores the order record of each planting work order in the service management area in the platform operation step S01. The planning guide unit 2 is the functional core of the platform, which can first extract the order record of the service management area in the last year to obtain the vegetable type, vegetable growth stage, agricultural machinery type, agricultural machinery number, agricultural machinery number, work order time and work order location of each planting work order in the planning process step S1. Next, it can execute step S2 to associate the planting order with the service according to the agricultural machinery number, agricultural machinery number, work order time and work order location of the planting work order in the order record, and take the planting order with the service association as the associated planting order.

[0014] The agricultural machinery type in the present scheme uses the industry standard "Agricultural Machinery Classification (NY / T 1640-2021)". The vegetable type in the present scheme uses the industry standard "Vegetable Name and Computer Code (NY / T 1741-2009)".

[0015] Referring to Figure 3As shown, in order to find out the associated planting orders, firstly, step S21 can be performed to set a time duration threshold adjacent to the order time. Next, step S22 can be performed to set a distance threshold adjacent to the order location. Next, step S23 can be performed to take the planting orders of the same agricultural machine driven by the same agricultural machine operator, the order time adjacent or the order location adjacent as the associated planting orders according to the agricultural machine number, the agricultural machine operator number, the order time and the order location of the planting order. Step S24 can be performed to take the partial associated planting orders as the associated planting orders of each other according to the chain conduction property of the service association between the associated planting orders, and obtain the associated planting orders in the order record.

[0016] Considering that the associated orders should also exist interweaving in time and space, next, step S25 can be performed to obtain the time distribution of the order time and the spatial distribution of the order location in each group of associated planting orders. Finally, step S26 can be performed to take the two groups of associated planting orders in which the time distribution of the order time and the spatial distribution of the order location exist interweaving as the associated planting orders having the service association with each other.

[0017] Please continue to refer to Figure 1 , Figure 2 , Figure 4 and Figure 5 As shown, after the associated planting orders are obtained, next, step S3 can be performed to divide a plurality of intensive planting areas in the service management area according to the associated planting orders and the vegetable type, the vegetable growth stage and the agricultural machine type of each planting order in the order record. This requires firstly performing step S31 to obtain the vegetable type code of the vegetable type in each planting order. Next, step S32 can be performed to obtain the agricultural machine type code of the agricultural machine type in each planting order. Next, step S33 can be performed to obtain the growth stage code in the order of growth time for each growth stage of the vegetable type. Next, step S34 can be performed to divide the planting orders having consistent planting states into the same order set domain according to the vegetable type code, the growth stage code and the agricultural machine type code in each planting order, and verify by the associated planting orders. Finally, step S35 can be performed to take the geographical distribution range of the order location of the planting orders in the same order set domain as an intensive planting area, and divide a plurality of intensive planting areas.

[0018] Please refer to Figure 5As shown, since the intensive planting vegetable garden usually has high consistency in vegetable variety selection and planting process, it can be divided according to the vegetable category and the agricultural machinery type in the planting order, but the reference standard for division is also needed to be selected, which is the identification planting order in the present scheme. Therefore, step S341 is first executed to select an identification planting order in each vegetable variety code in each planting order according to the vegetable category code in each planting order. In the industry standard "Vegetable Name and Computer Coding (NY / T 1741-2009)", the first level is the category code (2 digits), the second level is the variety code (2 sequential codes), and the third level is the specification code (1 letter), and the second level variety code is used in the present scheme.

[0019] In order to improve the division accuracy of the order centralized domain, the number of identification planting orders can be appropriately increased, so that step S342 is executed to select an identification planting order in each agricultural machinery item code in each planting order according to the agricultural machinery type code in each planting order. In the industry standard "Agricultural Machinery Classification (NY / T 1640-2021)", the agricultural machinery code is composed of four parts of industry or field machinery code and large category sequential code, small category sequential code, and item sequential code, and the item sequential code is used as the agricultural machinery item code in the present scheme.

[0020] The differentiation degree between the planting orders needs to be quantified during the division, so that step S343 is executed to obtain the planting service differentiation degree between the two planting orders by subtracting and superimposing the corresponding vegetable category code, growth stage code and agricultural machinery type code in the two planting orders. Step S344 is executed to classify each planting order other than the identification planting order into the same order centralized domain as the identification planting order with the smallest planting service differentiation degree. Step S345 is executed to determine whether the planting orders contained in each order centralized domain belong to the associated planting orders. If yes, step S346 is executed to obtain the order centralized domain with consistent planting state of the contained planting orders.

[0021] If the result of step S345 is no, it means that the planting order consistency in the currently divided order centralized domain is not enough, so the identification planting order needs to be optimized, specifically, step S347 is first executed to calculate the superimposed value of the planting service differentiation degree between each planting order and other planting orders in each divided order centralized domain as the identification qualification degree of the planting order in the order centralized domain. Then, step S348 is executed to select the planting order with the highest identification qualification degree in each order centralized domain as the optimized identification planting order.

[0022] After the optimization of the identified planting orders, the next step S344 and step S345 can be performed to re-divide the order set domains according to the optimized identified planting orders, and continue to determine whether the planting orders contained in each order set domain belong to the associated planting orders.

[0023] In order to supplement the implementation process of the above steps S341 to S348, the source code of part of the function modules is provided, and the annotation part is explained. In order to avoid the leakage of data related to business secrets, the data which does not affect the implementation of the scheme is desensitized, and the same is true below.

[0024] / / Initial division of order set domain std::vector <ordercluster>initialClusterDivision( const std::vector<PlantingOrder*>&identifiers) { std::vector <ordercluster>clusters; std::set <std::string>assignedOrders; / / Create a cluster for each identified order for (auto identifier : identifiers) { OrderCluster cluster("CLUSTER_" + std::to_string(clusters.size() + 1), identifier); cluster.addOrder(*identifier); assignedOrders.insert(identifier->orderId); clusters.push_back(cluster); } / / Find the identified order with the minimum differentiation for each unassigned order for (const auto&order : allOrders) { if (assignedOrders.find(order.orderId)!= assignedOrders.end()){ continue; } double minDifferentiation = std::numeric_limits <double>::max(); OrderCluster* bestCluster = nullptr; / / Find the cluster with the minimum differentiation for (auto&cluster : clusters) { double differentiation = calculateServiceDifferentiation( order, *cluster.identifierOrder); if (differentiation<minDifferentiation) { minDifferentiation = differentiation; bestCluster =&cluster; } } / / Assign the order to the best cluster if (bestCluster!= nullptr) { bestCluster->addOrder(order); assignedOrders.insert(order.orderId); } } return clusters; } / / Check if all orders within a cluster are associated with each other bool areAllOrdersAssociated(const OrderCluster&cluster) { const auto&orderIds = cluster.getOrderIds(); if (orderIds.size()<= 1) { return true; / / Single order is naturally associated } / / Check if each pair of orders is in the same association group for (size_t i = 0; i<orderIds.size(); ++i) { for (size_t j = i + 1; j <orderIds.size(); ++j) { bool foundAssociation = false; / / Find this order in all related groups for (const auto&group : associatedGroups) { if (group.areOrdersAssociated(orderIds[i], orderIds[j])) { foundAssociation = true; break } } if (!foundAssociation) { return false; / / Find a pair of unrelated orders } } } return true; } / / Calculate the qualification of the order identifier in the cluster double calculateIdentifierQualification(const PlantingOrder&order, const OrderCluster&cluster) { double totalDifferentiation = 0.0; int comparisonCount = 0; / / Calculate the sum of the differentiation degrees of all other orders in the cluster. for (const auto&otherOrder : cluster.orders) { if (order.orderId != otherOrder.orderId) { totalDifferentiation += calculateServiceDifferentiation(order, otherOrder); comparisonCount++ } } / / Return the inverse of the average differentiation (the smaller the differentiation, the higher the qualification) return comparisonCount>0? (1.0 / (totalDifferentiation / comparisonCount)) : 0.0; } / / Validate and optimize the cluster std::vector <ordercluster>validateAndOptimizeClusters( std::vector <ordercluster>clusters) { bool allValid = false; int optimizationRound = 0; const int maxRounds = 10; / / prevent infinite loop while (!allValid&&optimizationRound<maxRounds) { optimizationRound++; allValid = true; std::vector <ordercluster>newClusters; for (auto& cluster : clusters) { if (areAllOrdersAssociated(cluster)) { / / The cluster is valid, directly retain it newClusters.push_back(cluster); } else { / / The cluster is invalid and needs to be optimized allValid = false; std::cout << "Cluster " << cluster.clusterId << " failed the association verification and is being optimized..." << std::endl; / / Calculate the identifier qualification of each order in the cluster std::vector<std::pair<double, PlantingOrder*>> qualificationScores; for (auto& order : cluster.orders) { double score = calculateIdentifierQualification(order, cluster); qualificationScores.emplace_back(score, &order); } / / Select the order with the highest qualification as the new identifier order auto bestOrder = std::max_element( qualificationScores.begin(), qualificationScores.end(), [](const auto& a, const auto& b) { return a.first < b.first;}); PlantingOrder* newIdentifier = bestOrder->second; std::cout << "Select order "< <newidentifier->orderId " as a new identification order, eligibility: " <bestorder->first<<std::endl; / / Re-partition based on the new identifier order OrderCluster newCluster("OPT_" + cluster.clusterId, newIdentifier); newCluster.addOrder(*newIdentifier); / / Re-allocate other orders in the cluster for (auto& order : cluster.orders) { if (order.orderId != newIdentifier->orderId) { / / Check if it should remain in the current cluster double differentiation = calculateServiceDifferentiation( order, *newIdentifier); / / Simple threshold judgment: if the differentiation is less than 0.5, then retain if (differentiation < 0.5) { newCluster.addOrder(order); } } } newClusters.push_back(newCluster); } } / / If there are still invalid clusters, perform the next round of optimization if (!allValid) { std::cout << "The " << optimizationRound << "th round of optimization is completed, continue to verify..." << std::endl; } } if (optimizationRound >= maxRounds) { std::cout << "Reached the maximum number of optimization rounds, terminate the optimization process" << std::endl; } return clusters; } } The scheme selects the planting orders from two dimensions of vegetable types and agricultural machine types, calculates the planting service differentiation degree between orders for initial division, then verifies the service correlation of orders in the cluster by using the associated order network, adopts the identification eligibility evaluation for multi-round optimization iteration for the clusters that do not pass the verification, and finally forms the order centralized domain with high planting state consistency and strong service correlation, thereby providing a scientific order grouping basis for intensive agricultural production.

[0025] Please continue to refer to Figure 1 、 Figure 2 、 Figure 6 、 Figure 9 and Figure 10 , after the intensive planting area division is implemented, the step S4 of dividing the concentrated demand period within the natural year and the corresponding agricultural machine type can be performed. In the process of dividing the concentrated demand period and the corresponding agricultural machine type for each intensive planting area, first, the step S41 of taking the period of the order time distribution of the planting orders in the same order centralized domain as a concentrated demand period can be performed. Next, the step S42 of taking the agricultural machine types involved in the planting orders in the same order centralized domain as the corresponding agricultural machine types of the order centralized domain can be performed. Finally, the step S43 of correlating the intensive planting area, the concentrated demand period and the agricultural machine type corresponding to the same order centralized domain with each other to obtain the concentrated demand period within the natural year and the corresponding agricultural machine type of each intensive planting area can be performed.

[0026] Please continue to refer to Figure 1 、 Figure 2 、 Figure 7 、 Figure 8 and Figure 11 , the information publishing unit 3 in the scheme is to push the planning information, that is, to perform the step S03 of sending the concentrated demand period within the natural year and the corresponding agricultural machine type of each intensive planting area in the current year to the agricultural machine holder and the agricultural machine operator, and a task order as shown in Figure 11 can be generated after the matching is successful.

[0027] In order to avoid disturbing the busy agricultural machines and at the same time improve the utilization rate of the remaining agricultural machines, first, the step S031 of obtaining the working state of each agricultural machine, including the task, maintenance and idle, can be performed. Next, the step S032 of actively pushing the concentrated demand period within the natural year of each intensive planting area to the holder and the agricultural machine operator of the corresponding type agricultural machine in the maintenance and idle working state can be performed. Finally, the step S033 of receiving the information request and then sending the concentrated demand period within the natural year of each intensive planting area to the holder and the agricultural machine operator of the corresponding type agricultural machine in the task working state can be performed.

[0028] Although the application has been described in connection with various embodiments thereof, it will be understood that other modifications and variations will be apparent to those skilled in the art in view of the foregoing disclosure, the drawings, and the accompanying claims. It is therefore contemplated that the application will be practiced otherwise than as specifically set forth herein. In the claims, the word "comprising" does not exclude other elements or steps, and the indefinite articles "a" or "an" do not exclude a plurality. A single processor or other unit can fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage. The embodiments described herein are illustrative of the application rather than limiting thereof, as it will be understood by those skilled in the art that the present application is capable of further modifications and variations and is not limited to the examples described above. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting. The use of terms such as "including", "comprising", "having", "containing", or "encompassing" and variations thereof, does not exclude other components or steps. The singular forms "a", "an" and "the" include plural referents unless the context clearly dictates otherwise. < / ordercluster> < / ordercluster> < / ordercluster> < / double> < / std::string> < / ordercluster> < / ordercluster>

Claims

1. A vegetable planting machinery sharing service management platform, characterized in that, include, Storage units are used to update and store order records for each planting work order within the storage service management area; The planning and guidance unit is used to extract the order records of the service management area in the previous year, and obtain the vegetable type, vegetable growth stage, agricultural machinery type, agricultural machinery number, agricultural machinery operator number, work order time and work order location for each planting work order; Based on the agricultural machinery number, agricultural machinery operator number, work order time, and work order location in the order record, planting orders with service relevance are identified as related planting orders; Based on the associated planting orders and the vegetable types, growth stages, and agricultural machinery types in each planting order in the order records, multiple intensive planting areas are divided in the service management area; The concentrated demand periods within a calendar year and the corresponding types of agricultural machinery are identified. The information dissemination unit is used to send the peak demand periods and corresponding agricultural machinery types for each intensive planting area within the current year to agricultural machinery owners and operators.

2. The vegetable planting machinery sharing service management platform according to claim 1, characterized in that, The step of identifying planting orders with service relevance as related planting orders based on the agricultural machinery number, agricultural machinery operator number, work order time, and work order location in the order record includes: Set a time threshold for adjacent work order times; Set a distance threshold between adjacent work order locations; Based on the agricultural machinery number, agricultural machinery operator number, work order time and work order location of the planting work order, planting orders with the same agricultural machinery operator driving the same agricultural machinery and with adjacent work order times or adjacent work order locations are considered as related planting orders. Related planting orders have a chain-like transmission property of service association. By treating some related planting orders as related planting orders, the related planting orders in the order record can be obtained.

3. The vegetable planting machinery sharing service management platform according to claim 2, characterized in that, The step of identifying planting orders with service relevance as related planting orders based on the agricultural machinery number, agricultural machinery operator number, work order time, and work order location in the order record further includes: Obtain the temporal distribution of work order times and the spatial distribution of work order locations in each group of related planting orders; Two sets of related planting orders that overlap in both the temporal distribution and spatial distribution of the work order are also considered as related planting orders that have a service relationship with each other.

4. The vegetable planting machinery sharing service management platform according to claim 1, characterized in that, The step of dividing the service management area into multiple intensive planting zones based on associated planting orders and the vegetable types, growth stages, and agricultural machinery types in each planting order in the order records. include, Obtain the vegetable type code for each planting order; Obtain the agricultural machinery type code for each planting order; The growth stages of each vegetable variety are coded according to their growth time sequence. Based on the vegetable type code, growth stage code, and agricultural machinery type code in each planting order, planting orders with consistent planting status are divided into the same order set domain, and verified through related planting orders. The geographical distribution range of planting orders within the same order set domain is considered as an intensive planting area, which is then divided into multiple intensive planting areas.

5. The vegetable planting machinery sharing service management platform according to claim 4, characterized in that, The step of dividing planting orders with consistent planting status into the same order set domain based on the vegetable type code, growth stage code, and agricultural machinery type code in each planting order, and verifying them through related planting orders. include, In all planting orders, according to the vegetable type code in each planting order, select one planting order as the identification planting order from each involved vegetable variety code; The degree of differentiation of planting services between the two planting orders is obtained by subtracting the corresponding vegetable type codes, growth stage codes, and agricultural machinery type codes from each of the two planting orders and then summing them up. For each planting order other than the identified planting order, classify it into the same order set domain as the identified planting order with the lowest degree of differentiation from the planting service; Determine whether the planting orders contained within each order set domain belong to related planting orders; If so, then the order set domain containing planting orders with consistent planting status is obtained.

6. The vegetable planting machinery sharing service management platform according to claim 5, characterized in that, The step of grouping planting orders with consistent planting status into the same order set domain based on the vegetable type code, growth stage code, and agricultural machinery type code in each planting order, and verifying them through associated planting orders, also includes: In all planting orders, according to the agricultural machinery type code in each planting order, select one planting order from each relevant agricultural machinery item code as the identification planting order.

7. The vegetable planting machinery sharing service management platform according to claim 5, characterized in that, The step of grouping planting orders with consistent planting status into the same order set domain based on the vegetable type code, growth stage code, and agricultural machinery type code in each planting order, and verifying them through associated planting orders, also includes: If not, then optimize the labeled planting order to obtain the optimized labeled planting order; Based on the optimized identification of planting orders, the order set domains are re-divided, and it is further determined whether the planting orders contained in each order set domain belong to related planting orders.

8. The vegetable planting machinery sharing service management platform according to claim 7, characterized in that, The step of optimizing the labeled planting order to obtain the optimized labeled planting order. include, Within each partitioned order set domain, the sum of the planting service differentiation degree of each planting order and other planting orders is calculated as the identification qualification degree of the planting order within that order set domain; The planting order with the highest qualification rate in each order set domain is selected as the optimized labeled planting order.

9. The vegetable planting machinery sharing service management platform according to claim 4, characterized in that, The step of dividing the concentrated demand periods within a calendar year and the corresponding agricultural machinery types includes, The time periods during which planting orders are distributed across the same order set domain are considered as a concentrated demand period. The type of agricultural machinery involved in planting orders within the same order set domain is taken as the type of agricultural machinery corresponding to that order set domain; By associating the intensive planting areas, concentrated demand periods, and agricultural machinery types corresponding to the same order concentration domain, we can obtain the concentrated demand periods and corresponding agricultural machinery types for each intensive planting area within a natural year.

10. The vegetable planting machinery sharing service management platform according to claim 1, characterized in that, The step of sending the concentrated demand periods and corresponding agricultural machinery types for each intensive planting area within the current year to agricultural machinery owners and operators includes, The working status of each agricultural machine is obtained, including being in operation, under maintenance, and idle. The system proactively pushes the concentrated demand periods for each intensive planting area within the current year to owners and operators of the corresponding type of agricultural machinery that are under maintenance or idle; upon receiving the information request, it then sends the concentrated demand periods for each intensive planting area within the current year to owners and operators of the corresponding type of agricultural machinery that are currently in operation.

Images