Steel grabbing machine distributed task scheduling method and system, computer equipment and medium

By using a distributed task scheduling method for steel grabbers, autonomous task allocation and path planning for steel grabbers in scrap yards were achieved, solving the problem of low efficiency in multi-machine collaboration, reducing safety risks and costs, and ensuring operational continuity in the event of a failure in the operation control center.

CN118966628APending Publication Date: 2024-11-15CISDI RES & DEV CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

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

AI Technical Summary

Technical Problem

In scrap yards, when multiple steel grabbers work together to perform tasks, task allocation and path planning are inefficient, manual operation poses safety risks and high costs, and centralized scheduling is impossible when the operation control center malfunctions, leading to the paralysis of the operation system.

Method used

A distributed task scheduling method for steel grabbing machines is adopted. Through autonomous communication and collaborative cooperation between the master steel grabbing machine and neighboring steel grabbing machines, task allocation and path planning are carried out, a local central system is constructed, the overall computing load is reduced, and autonomous decision-making and task execution are realized.

Benefits of technology

It improved the efficiency of the steel grabbing machine in executing tasks, reduced safety risks and labor costs, ensured that steel processing tasks could continue to be executed even when the operation control center malfunctioned, and improved calculation speed and solution efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118966628A_ABST
    Figure CN118966628A_ABST
Patent Text Reader

Abstract

The invention provides a distributed task scheduling method and system for a steel grabbing machine, computer equipment and a medium, and the method comprises the steps: comparing task information at a current moment with task information at a previous moment, and recognizing new task information based on a comparison result; when the new task information is sent by the preset personnel, entering a main grabbing steel machine operation process; and when the new task information is not sent by the preset personnel, entering a non-main grabbing steel machine operation process. Therefore, the unmanned steel grabbing machines which can communicate with each other are adopted to execute the steel processing task, and the efficiency problem, the safety risk problem and the cost problem existing when the steel grabbing machines are manually operated in a steel scrap stock ground at present can be solved. Meanwhile, in a waste steel field operation scene, when an operation control center breaks down, mutual cooperation among multiple unmanned steel grabbing machines can be supported, the unmanned steel grabbing machines can autonomously communicate with neighbor steel grabbing machines, and therefore it can be guaranteed that steel processing tasks are continuously executed through autonomous cooperation of the steel grabbing machines.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computer and steel technology, and in particular to a distributed task scheduling method, system, computer equipment and readable medium for a steel grabber. Background Art

[0002] In recent years, with the continuous increase in the pace of industrialization and urbanization, the demand for steel has also continued to expand. As an important downstream base for steel processing, the internal operating burden of the scrap steel yard has also continued to increase. As a special excavator, the steel grabber is mainly used for steel loading and unloading, feeding shears, and steel packaging. It is a core operating tool in the scrap steel yard.

[0003] In the process of multiple grabbers cooperating to perform tasks in the scrap steel yard, the number of tasks performed by the grabbers and their time sequence relationship will affect the planning results of the grabber's driving path, and sometimes even a feasible driving path cannot be generated; conversely, the different driving paths selected by the grabber will have an important impact on the efficiency of its task execution. Therefore, the task allocation and path planning of multiple vehicles and machines in the scrap steel yard are mutually coupled, and simply separating the processing often reduces the final execution efficiency of the task. In addition, when the operation control center fails, it is impossible to perform centralized task allocation and scheduling of the grabbers.

[0004] In addition, when processing large batches of orders, the following problems may occur when manually operating the steel grabber:

[0005] (1) Efficiency issues: Manual operation of steel grabbers and other equipment may lead to inefficiency;

[0006] (2) Safety risks: Operating a steel grabber to handle scrap steel may result in safety risks such as scrap steel falling, which may affect the stability and safety of the operation due to operator fatigue or inconsistent skills;

[0007] (3) Cost issues: Long manual operation may lead to expensive labor costs;

[0008] In addition, during the unmanned transformation of the scrap steel yard, the operation control center is responsible for the multi-machine and multi-vehicle task allocation and path joint optimization of the entire scrap steel yard. However, when a failure occurs in the operation control center, it will be impossible to centrally allocate tasks and schedule the steel grabbers, causing the on-site operation system to be paralyzed, affecting the on-site operation efficiency and safety. Summary of the invention

[0009] In view of the shortcomings of the prior art described above, the purpose of the present invention is to provide a distributed task scheduling method, system, computer equipment and readable medium for a steel grabber, which are used to solve the problems of manual operation of a steel grabber and task allocation and scheduling of a steel grabber in the prior art.

[0010] To achieve the above-mentioned purpose and other related purposes, the present invention provides a distributed task scheduling method for a steel grabber, comprising the following steps:

[0011] Compare the task information at the current moment with the task information at the previous moment, and identify the new task information based on the comparison result, and when the new task information is sent by a preset person, identify the current state of the main steel grabber, and identify whether the task type of the main steel grabber matches the new task information; wherein the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard;

[0012] When the current state of the main steel grabber is an idle state and the task type of the main steel grabber matches the new task information, sending the first winning bid information to the preset personnel;

[0013] When the current state of the main steel grabber is a non-idle state, and / or the task type of the main steel grabber does not match the new task information, the new task information is sent to a neighbor steel grabber, and the first bidding information is obtained through the neighbor steel grabber, and after the acquisition time of the first bidding information exceeds a first preset time, second winning bid information is generated based on the first bidding information, and the second winning bid information is published to the neighbor steel grabber, and after the neighbor steel grabber receives feedback information of the second winning bid information, the second winning bid information is sent to the preset personnel; wherein, the neighbor steel grabber includes all non-main steel grabbers in the scrap steel yard that are within a preset distance range from the main steel grabber, and the non-main steel grabber includes other steel grabbers in the scrap steel yard except the main steel grabber.

[0014] In one embodiment of the present invention, the first bidding information is obtained by the neighbor steel grabber, and if the time for obtaining the first bidding information does not exceed the first preset time, the first bidding information is continuously obtained until the time for obtaining the first bidding information exceeds the first preset time;

[0015] And, after the winning bid information is published to the neighboring steel grabber, if the neighboring steel grabber does not receive feedback information of the winning bid information, the winning bid information is published to the neighboring steel grabber again until the neighboring steel grabber receives feedback information of the winning bid information.

[0016] In one embodiment of the present invention, the first winning bid information includes: the number of the main steel grabber, the service number of the current steel transport vehicle, and the driving path from the main steel grabber to the current steel transport vehicle;

[0017] The first bidding information includes: the number of each non-main steel grabber among the neighboring steel grabbers, the service number of the current steel transport vehicle, and the minimum driving distance from each non-main steel grabber among the neighboring steel grabbers to the current steel transport vehicle;

[0018] The second winning bid information includes: the winning non-main steel grabbing machine number, the service number of the current steel transport vehicle, and the driving path from the winning non-main steel grabbing machine to the current steel transport vehicle.

[0019] In one embodiment of the present invention, if the new task information is not sent by a preset person, the current state of the non-main steel grabber is identified, and whether the task type of the non-main steel grabber matches the new task information is identified;

[0020] If the current state of the non-main steel grabber is a non-idle state, and / or the task type of the non-main steel grabber does not match the new task information, then the allocation of the new task information is terminated;

[0021] If the current state of the non-main steel grabber is an idle state, and the task type of the non-main steel grabber matches the new task information, the bidding cost is calculated, and the second bidding information is generated based on the bidding cost, and the second bidding information is sent to the main steel grabber, and the third winning bid information is generated by the main steel grabber, and the third winning bid information is sent to the non-main steel grabber, so that the non-main steel grabber reads the third winning bid information and determines whether it has won the bid based on the reading result of the third winning bid information; when the non-main steel grabber itself wins the bid, it sends winning bid feedback information to the main steel grabber; when the non-main steel grabber itself does not win the bid, the allocation of the new task information is terminated; wherein, the bidding cost includes the minimum driving distance from the non-main steel grabber to the current steel transport vehicle.

[0022] In one embodiment of the present invention, after sending the third winning bid information to the non-main steel grabbing machine, the method further includes:

[0023] Determining whether the non-main steel grabbing machine has received the third winning bid information;

[0024] If the non-main steel grasping machine receives the third bid winning information, the non-main steel grasping machine reads the third bid winning information;

[0025] If the non-main steel grabber does not receive the third winning bid information, it is determined whether the sending time of the third winning bid information exceeds the second preset time; when the sending time of the third winning bid information exceeds the second preset time, the allocation of the new task information is terminated; when the sending time of the third winning bid information does not exceed the second preset time, the third winning bid information is resent to the non-main steel grabber.

[0026] In one embodiment of the present invention, when the non-main steel grabber itself wins the bid, the state of the non-main steel grabber is adjusted from an idle state to a non-idle state according to the new task information and the second bidding information;

[0027] The second bidding information includes: the number of the non-main steel grabbing machine, the service number of the current steel material transport vehicle, and the minimum driving distance from the non-main steel grabbing machine to the current steel material transport vehicle;

[0028] The third winning bid information includes: the winning non-main steel grabbing machine number, the service number of the current steel transport vehicle, and the driving path from the winning non-main steel grabbing machine to the current steel transport vehicle.

[0029] In one embodiment of the present invention, if no new task information is identified based on the comparison result of the task information at the current moment and the task information at the previous moment, the method further includes:

[0030] Get the next moment task information;

[0031] The next moment task information is compared with the current moment task information, and based on the comparison result between the next moment task information and the current moment task information, it is identified whether there is new task information in the next moment task information; if there is, it is identified whether the new task information is sent by the preset personnel; if not, the subsequent moment task information is continued to be obtained for comparison until the new task information is identified.

[0032] The present invention also provides a distributed task scheduling system for a steel grabber, the system comprising:

[0033] The task information module is used to compare the task information at the current moment with the task information at the previous moment, and identify new task information based on the comparison result;

[0034] A main steel grabber state module, used to identify the current state of the main steel grabber when the new task information is sent by a preset person, and to identify whether the task type of the main steel grabber matches the new task information; wherein the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard;

[0035] A first scheduling module, configured to send first winning bid information to the preset personnel when the current state of the main steel grabber is an idle state and the task type of the main steel grabber matches the new task information;

[0036] The second scheduling module is used for sending the new task information to the neighboring grabber when the current state of the main grabber is a non-idle state and / or the task type of the main grabber does not match the new task information, and obtaining the first bidding information through the neighboring grabber, and generating the second winning bid information based on the first bidding information after the acquisition time of the first bidding information exceeds the first preset time, and publishing the second winning bid information to the neighboring grabber, and sending the second winning bid information to the preset personnel after the neighboring grabber receives the feedback information of the second winning bid information; wherein, the neighboring grabber includes all non-main grabbers in the scrap steel yard that are within a preset distance range from the main grabber, and the non-main grabber includes other grabbers in the scrap steel yard except the main grabber.

[0037] The present invention also provides a computer device, comprising a memory, a processor and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of the distributed task scheduling method for a steel grabber as described in any one of the above.

[0038] The present invention also provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of the distributed task scheduling method for a steel grabber described in any one of the above are implemented.

[0039] As described above, the present invention provides a distributed task scheduling method, system, computer equipment and readable medium for steel grabbers, which have the following beneficial effects: the present invention can solve the efficiency problems, safety risks and cost problems of manually operated steel grabbers in scrap steel yards by using unmanned steel grabbers that can communicate with each other to perform steel processing tasks. At the same time, in the scrap steel yard operation scenario, when the operation control center fails, the present invention can support the mutual cooperation between multiple unmanned steel grabbers. The unmanned steel grabbers can communicate autonomously with neighboring steel grabbers, so that the steel processing tasks can be continued through the autonomous collaboration of the steel grabbers. Moreover, each independent steel grabber in the present invention can act as a decision maker to perform autonomous task allocation and path planning. At the same time, the present invention can classify the steel grabbers into main steel grabbers and non-main steel grabbers, and can build a local center system to reduce the overall amount of calculation, thereby speeding up the calculation speed and improving the solution efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 A schematic diagram of an exemplary system architecture for applying the technical solutions in one or more embodiments of the present invention;

[0041] Figure 2 A schematic diagram of a flow chart of a distributed task scheduling method for a steel grabber provided in one embodiment of the present invention;

[0042] Figure 3 A schematic diagram of a process flow of task scheduling of a main steel grabber provided in an embodiment of the present invention;

[0043] Figure 4 A schematic diagram of a process flow of non-main steel grabbing machine task scheduling provided in an embodiment of the present invention;

[0044] Figure 5 A schematic diagram of a process for obtaining task information provided by an embodiment of the present invention;

[0045] Figure 6 A schematic diagram of a process flow of steel grabber task matching provided in an embodiment of the present invention;

[0046] Figure 7 A schematic diagram of a process for calculating a bidding cost provided by an embodiment of the present invention;

[0047] Figure 8 A schematic diagram of a process for generating bidding information provided by an embodiment of the present invention;

[0048] Fig. 9 A schematic diagram of a process for reading bidding information provided by an embodiment of the present invention;

[0049] Fig.10 A schematic diagram of a flow chart of updating the state of a steel grabber provided in an embodiment of the present invention;

[0050] Fig.11 The test data of distributed task scheduling of a steel grabber provided in one embodiment of the present invention;

[0051] Fig.12 for Fig.11 Schematic diagram of test results corresponding to the test data;

[0052] Fig.13 The figure is a schematic diagram of the hardware structure of a computer device suitable for implementing one or more embodiments of the present invention. DETAILED DESCRIPTION

[0053] The following describes the embodiments of the present invention by specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the following embodiments and features in the embodiments can be combined with each other without conflict.

[0054] It should be noted that the illustrations provided in this embodiment are only used to illustrate the basic concept of the present invention in a schematic manner. Therefore, the drawings only show components related to the present invention rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the type, quantity and proportion of each component may be changed arbitrarily, and the component layout may also be more complicated.

[0055] Figure 1 FIG. 1 is a schematic diagram showing an exemplary system architecture to which the technical solution in one or more embodiments of the present invention can be applied. Figure 1 As shown, the system architecture 100 may include a terminal device 110, a network 120, and a server 130. The terminal device 110 may include various electronic devices such as a smart phone, a tablet computer, a laptop computer, and a desktop computer. The server 130 may be an independent physical server, or a server cluster or a distributed system composed of multiple physical servers, or a cloud server providing cloud computing services. The network 120 may be a communication medium of various connection types that can provide a communication link between the terminal device 110 and the server 130, such as a wired communication link or a wireless communication link.

[0056] According to the implementation requirements, the system architecture in the embodiment of the present invention may have any number of terminal devices, networks and servers. For example, the server 130 may be a server group composed of multiple server devices. In addition, the technical solution provided in the embodiment of the present invention may be applied to the terminal device 110, or to the server 130, or may be implemented by the terminal device 110 and the server 130 together, and the present invention does not make any special limitation on this.

[0057] In one embodiment of the present invention, the terminal device 110 or the server 130 of the present invention can compare the task information at the current moment with the task information at the previous moment, and identify the new task information based on the comparison result, and when the new task information is sent by the preset personnel, identify the current state of the main steel grabber, and identify whether the task type of the main steel grabber matches the new task information; wherein the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard; when the current state of the main steel grabber is an idle state, and the task type of the main steel grabber matches the new task information, send the first winning bid information to the preset personnel; when the current state of the main steel grabber is a non-idle state When the state and / or the task type of the main steel grabber does not match the new task information, the new task information is sent to the neighbor steel grabber, and the first bidding information is obtained through the neighbor steel grabber, and after the acquisition time of the first bidding information exceeds the first preset time, the second winning bid information is generated based on the first bidding information, and the second winning bid information is published to the neighbor steel grabber, and after the neighbor steel grabber receives the feedback information of the second winning bid information, the second winning bid information is sent to the preset personnel; wherein, the neighbor steel grabber includes all non-main steel grabbers in the scrap steel yard that are within a preset distance range from the main steel grabber, and the non-main steel grabber includes other steel grabbers in the scrap steel yard except the main steel grabber. The distributed task scheduling method of steel grabbers is executed by using the terminal device 110 or the server 130, and the efficiency problems, safety risks and cost problems of manually operated steel grabbers in the scrap steel yard can be solved by using unmanned steel grabbers that can communicate with each other to perform steel processing tasks. At the same time, in the scrap steel yard operation scenario, when the operation control center fails, it can support the mutual cooperation between multiple unmanned steel grabbers. The unmanned steel grabbers can communicate autonomously with neighboring steel grabbers, so that through the autonomous coordination of the steel grabbers, it can ensure the continuation of steel processing tasks. Moreover, each independent steel grabber can act as a decision maker to perform autonomous task allocation and path planning. At the same time, by classifying the steel grabbers into main steel grabbers and non-main steel grabbers, a local center system can be built to reduce the overall calculation amount, thereby speeding up the calculation speed and improving the solution efficiency.

[0058] The above section introduces the contents of an exemplary system architecture that applies the technical solution of the present invention. Next, the distributed task scheduling method for a steel grabber of the present invention will be introduced.

[0059] Figure 2 FIG. 1 is a flow chart of a distributed task scheduling method for a steel grabber provided by an embodiment of the present invention. Specifically, in an exemplary embodiment, Figure 2 As shown, this embodiment provides a distributed task scheduling method for a steel grabber, the method comprising the following steps:

[0060] Get the current task information;

[0061] Compare the current task information with the previous task information, and determine whether there is new task information in the current task information based on the comparison result; if there is new task information in the current task information, determine whether the new task information is sent by a preset person; if there is no new task information in the current task information, obtain the next task information, and then compare the next task information with the current task information, and based on the comparison result corresponding to the next task information and the current task information, identify whether there is new task information in the next task information; if there is, identify whether the new task information is sent by a preset person; if not, continue to obtain subsequent task information for comparison until new task information is identified. In this embodiment or other embodiments, the preset person may be the driver of the steel transport vehicle.

[0062] If there is new task information in the task information at the current moment, and the new task information is sent by the preset personnel, the operation flow of the main steel grabber task scheduling is entered; if there is new task information in the task information at the current moment, and the new task information is not sent by the preset personnel, the operation flow of the non-main steel grabber task scheduling is entered. In this embodiment or other embodiments, the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard, and the non-main steel grabber includes other steel grabbers in the scrap steel yard except the main steel grabber.

[0063] According to the above records, in an exemplary embodiment, the operation process of the main steel grabbing machine task scheduling is as follows: Figure 3 As shown, if there is new task information in the task information at the current moment, and the new task information is sent by the preset personnel, the current state of the main steel grabber is identified, and whether the task type of the main steel grabber matches the new task information is identified.

[0064] When the current state of the main steel grabber is an idle state and the task type of the main steel grabber matches the new task information, the first winning bid information is sent to the preset personnel. In this embodiment or other embodiments, the first winning bid information includes: the main steel grabber number, the service number of the current steel material transport vehicle, and the driving path from the main steel grabber to the current steel material transport vehicle.

[0065] When the current state of the main steel grabber is a non-idle state, and / or the task type of the main steel grabber does not match the new task information, the new task information is sent to the neighbor steel grabber, and the first bidding information is obtained through the neighbor steel grabber, and after the acquisition time of the first bidding information exceeds the first preset time, the second winning bid information is generated based on the first bidding information, and the second winning bid information is published to the neighbor steel grabber, and after the neighbor steel grabber receives the feedback information of the second winning bid information, the second winning bid information is sent to the preset personnel; wherein the neighbor steel grabber includes all non-main steel grabbers in the scrap steel yard that are within a preset distance range from the main steel grabber. In this embodiment or other embodiments, when the first bidding information is obtained through the neighbor steel grabber, if the acquisition time of the first bidding information does not exceed the first preset time, the first bidding information is continued to be obtained until the acquisition time of the first bidding information exceeds the first preset time; and after the winning bid information is published to the neighbor steel grabber, if the neighbor steel grabber does not receive the feedback information of the winning bid information, the winning bid information is republished to the neighbor steel grabber until the neighbor steel grabber receives the feedback information of the winning bid information. In this embodiment or other embodiments, the first bidding information includes: the number of each non-main steel grabber among the neighboring steel grabbers, the service number of the current steel transport vehicle, and the minimum driving distance from each non-main steel grabber among the neighboring steel grabbers to the current steel transport vehicle. The second winning bid information includes: the number of the winning non-main steel grabber, the service number of the current steel transport vehicle, and the driving path from the winning non-main steel grabber to the current steel transport vehicle. In this embodiment or other embodiments, the first preset time can be set according to the actual application scenario, and this embodiment does not limit the specific value here.

[0066] According to the above records, in an exemplary embodiment, the operation process of the non-main steel grabbing machine task scheduling is as follows: Figure 4 As shown, if there is new task information in the task information at the current moment, and the new task information is not sent by the preset personnel, the current state of the non-main steel grabbing machine is identified, and whether the task type of the non-main steel grabbing machine matches the new task information is identified;

[0067] If the current state of the non-main steel grabber is a non-idle state, and / or the task type of the non-main steel grabber does not match the new task information, the allocation of the new task information is terminated;

[0068] If the current state of the non-main steel grabber is an idle state, and the task type of the non-main steel grabber matches the new task information, the bidding cost is calculated, and the second bidding information is generated based on the bidding cost, and the second bidding information is sent to the main steel grabber, and the third winning bid information is generated by the main steel grabber, and the third winning bid information is sent to the non-main steel grabber, so that the non-main steel grabber reads the third winning bid information, and judges whether it has won the bid based on the reading result of the third winning bid information; when the non-main steel grabber itself wins the bid, the winning bid feedback information is sent to the main steel grabber; when the non-main steel grabber itself does not win the bid, the allocation of new task information is terminated; wherein, the bidding cost includes the minimum driving distance from the non-main steel grabber to the current steel material transport vehicle. In addition, when the non-main steel grabber itself wins the bid, this embodiment can also adjust the state of the non-main steel grabber from an idle state to a non-idle state according to the new task information and the second bidding information. In this embodiment, after sending the third bid winning information to the non-main steel grabber, it may also include: judging whether the non-main steel grabber receives the third bid winning information; if the non-main steel grabber receives the third bid winning information, the non-main steel grabber reads the third bid winning information; if the non-main steel grabber does not receive the third bid winning information, judging whether the sending time of the third bid winning information exceeds the second preset time; when the sending time of the third bid winning information exceeds the second preset time, the allocation of new task information is terminated; when the sending time of the third bid winning information does not exceed the second preset time, the third bid winning information is sent to the non-main steel grabber again. Among them, the second bidding information includes: the number of the non-main steel grabber, the service number of the current steel material transport vehicle, and the minimum driving distance from the non-main steel grabber to the current steel material transport vehicle. The third bid winning information includes: the number of the winning non-main steel grabber, the service number of the current steel material transport vehicle, and the driving path from the winning non-main steel grabber to the current steel material transport vehicle. In this embodiment or other embodiments, the second preset time can be set according to the actual application scenario, and this embodiment does not limit the specific numerical value here.

[0069] In another exemplary embodiment of the present invention, the embodiment also provides a distributed task scheduling method for a steel grabber in a scrap steel yard. The overall process of the method is as follows: Figure 2 Specifically, the steps include:

[0070] First, the steel grabbers in the entire scene are classified. If a steel transport vehicle enters the material yard, when the steel transport vehicle approaches the material pile, the steel transport vehicle driver plays the role of the operator or the steel transport vehicle driver serves as the preset personnel to publish and bind the tasks, and the steel grabber closest to the steel transport vehicle is regarded as the main steel grabber, and the remaining steel grabbers in the scrap steel yard are regarded as non-main steel grabbers.

[0071] like Figure 2As shown, a new task is issued in the scrap steel yard scene. If there is no new task, the steel grabber continues to obtain tasks; if a new task is read, the task sending source is judged. If the source of the task information is the operator, the main steel grabber process is entered; if the source is not the operator, the non-main steel grabber process is entered.

[0072] The main steel grabbing machine process is as follows Figure 3 As shown. Specifically, the main steel grabber first determines its own status. If it is idle, it matches the task type. If the corresponding task can be executed, it provides information feedback, modifies its own status and ends the process; if the task type does not match or its own status is busy, the task information is published to the neighboring steel grabbers in sequence according to the task priority. Obtain the bidding information and determine whether the waiting time has timed out. If the bidding information is not obtained after the waiting timeout, the task is suspended and continued to be executed in the next new scene information. Otherwise, the bidding information is sorted and calculated to obtain the winning information. The winning information is published and fed back to the winning steel grabber. It is determined whether the winning steel grabber has fed back the winning information. If the winning steel grabber has not received the winning information, the winning information is republished. Otherwise, the winning information is sent to the operator and the round of task allocation is ended.

[0073] Non-main steel grabbing machine process Figure 4 As shown. Specifically, first determine whether its own status matches the task type. If it is busy or has no executable tasks, end this round of task allocation directly. If the corresponding task can be executed, calculate the bidding cost and send the bidding information. Then read the winning bid information to determine whether it has won the bid. If it has won the bid, send the read information feedback to the main steel grabber, change its own status to busy and end this round of bidding. If it has not won the bid, end it directly.

[0074] During the interaction process of the steel grabber, bidding information needs to be generated and sent to the main steel grabber, which will then conduct statistics to obtain the best result and publish the information. The winning steel grabber will go to the target task point to perform the operation and change its working status to busy. The task information acquisition process is as follows: Figure 5 As shown, the steel grabber will always read the task file, and when the task file is not empty, it will parse the file to obtain the task information. Figure 5 In P2.1 IsFileExisits(), it is used to detect whether the directory or file representing the task information exists.

[0075] Task matching process is as follows Figure 6 As shown, the steel grabber performs task matching to obtain an executable task set, and matches the steel grabber's own information and the task set according to the service type to obtain executable task information.

[0076] The bidding cost calculation process is as follows: Figure 7As shown, firstly, the feasible layout points corresponding to the starting point and the end point are obtained, then the middle layout points of the grid graph G are calculated, and finally the connected nodes are calculated to obtain the minimum distance.

[0077] The bidding information generation process is as follows: Figure 8 As shown, firstly, the minimum bidding cost for executing the task is obtained, and then the corresponding bidding information is generated and published.

[0078] The bidding information reading process is as follows Fig. 9 As shown in the figure, the main steel grabber, as a temporary central node, will obtain the bidding information sent by the non-main steel grabber. First, the maximum waiting time will be set. After the waiting time has passed, the bidding file will be opened and the bidding information will be read in and the non-main steel grabber number corresponding to the minimum bidding price will be calculated. Among them, MAX_WAITTIME represents the maximum waiting time.

[0079] After the steel grabber wins the bid, it will update its status to busy. Among them, the steel grabber updates the status information as follows Fig.10 shown.

[0080] It can be seen that this embodiment can design a distributed collaborative task allocation algorithm based on auction theory based on an unmanned intelligent steel grabber that can communicate autonomously. When the operation control center fails, the signal between the network center and the steel grabber is interrupted and the connection is lost. Local information interaction can be achieved between the steel grabbers, and the steel grabbers can autonomously select the tasks to be performed and the driving path. In the actual scenario, after the steel transport vehicle arrives near the steel grabber, the driver of the steel transport vehicle can perform manual binding operations to inform the service platform of the new tasks. The steel grabber then performs the autonomous task allocation process. Ultimately, the unmanned steel grabber can achieve autonomous operation effects when the operation control center fails and the communication is interrupted. Therefore, when the communication is interrupted due to a failure in the operation control center, the unmanned steel grabber can autonomously communicate with neighboring steel grabbers, and perform task allocation according to the distributed auction theory algorithm proposed in this embodiment, thereby achieving highly intelligent and autonomous operations.

[0081] Specifically, in one example, this example uses test data for actual testing. In the actual test, the test data file is named "number of steel transport vehicles-number of steel grabbers-n", where n represents the nth test result file in this type of scenario. For example, 12-18-1 is the result of the first test data in the scenario with a scale of 12 steel transport vehicles and 18 steel grabbers. Taking the 12-18-1 test data as an example, the test data is as follows: Fig.11 The actual test results of the 12-18-1 test data are shown in Table 1 below, and the corresponding visualization results are shown in Fig.12 shown. Fig.11The specific information is as follows: the number of tasks is 12, the number of steel grabbers is 18, the number of stockpiles is 8, the number of obstacles is 2, the coordinates of the lower left corner of the stockyard are (0, 0), the coordinates of the lower right corner of the stockyard are (300, 100), the length of the stockyard is 300, and the width of the stockyard is 100. In addition, for Fig.11 The task information in includes the task number, task type, scrap type, scrap weight and task target location. Fig.11 The grabber information in the includes the grabber number, the amount of scrap steel that the grabber can serve, the specific scrap steel type, the corresponding transportation speed of the scrap steel, the grabber coordinates, and the current state of the grabber. 0 means that the grabber will be idle at a certain time during the cycle, 1 means that the grabber will always work during the cycle, and -1 means that the grabber is faulty. Fig.11 The pile information in the includes the coordinates of the lower left corner of the pile, the coordinates of the upper right corner of the pile, the length of the pile, and the width of the pile. Fig.11 The obstacle area information in the obstacle area includes the coordinates of the lower left corner of the obstacle area, the coordinates of the upper right corner of the obstacle area, the length of the obstacle area, and the width of the obstacle area.

[0082] Table 1 Actual test results of 12-18-1 test data

[0083]

[0084] In summary, the present invention provides a distributed task scheduling method for a steel grabber, which compares the task information at the current moment with the task information at the previous moment, identifies the new task information based on the comparison result, and identifies the current state of the main steel grabber when the new task information is sent by a preset person, and identifies whether the task type of the main steel grabber matches the new task information; wherein the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard; when the current state of the main steel grabber is an idle state and the task type of the main steel grabber matches the new task information, sends the first winning bid information to the preset person; when the current state of the main steel grabber is a non-idle state , and / or when the task type of the main steel grabber does not match the new task information, the new task information is sent to the neighbor steel grabber, and the first bidding information is obtained through the neighbor steel grabber, and after the acquisition time of the first bidding information exceeds the first preset time, the second winning bid information is generated based on the first bidding information, and the second winning bid information is published to the neighbor steel grabber, and after the neighbor steel grabber receives the feedback information of the second winning bid information, the second winning bid information is sent to the preset personnel; wherein, the neighbor steel grabber includes all non-main steel grabbers in the scrap steel yard that are within a preset distance range from the main steel grabber, and the non-main steel grabber includes other steel grabbers in the scrap steel yard except the main steel grabber. It can be seen from this that this method can solve the efficiency problems, safety risks and cost problems of manually operated steel grabbers in the current scrap steel yard by using unmanned steel grabbers that can communicate with each other to perform steel processing tasks. At the same time, in the scrap steel yard operation scenario, when the operation control center fails, this method can support the mutual cooperation between multiple unmanned steel grabbers. The unmanned steel grabbers can communicate autonomously with neighboring steel grabbers, so that the steel handling task can be continued through the autonomous collaboration of the steel grabbers. Moreover, each independent steel grabber in this method can act as a decision maker to perform autonomous task allocation and path planning. At the same time, this method can classify the steel grabbers into main steel grabbers and non-main steel grabbers, and build a local center system to reduce the overall calculation amount, thereby speeding up the calculation speed and improving the solution efficiency.

[0085] In another exemplary embodiment of the present invention, the embodiment further provides a distributed task scheduling system for a steel grabber, comprising:

[0086] The task information module is used to obtain the task information at the current moment, compare the task information at the current moment with the task information at the previous moment, and identify the new task information based on the comparison result. Specifically, if there is new task information in the task information at the current moment, determine whether the new task information is sent by the preset person; if there is no new task information in the task information at the current moment, obtain the task information at the next moment, and then compare the task information at the next moment with the task information at the current moment, and based on the comparison result corresponding to the task information at the next moment and the task information at the current moment, identify whether there is new task information in the task information at the next moment; if there is, identify whether the new task information is sent by the preset person; if not, continue to obtain the task information at subsequent moments for comparison until new task information is identified. In this embodiment or other embodiments, the preset person may be the driver of the steel transport vehicle.

[0087] The main steel grabber state module is used to identify the current state of the main steel grabber when new task information is sent by a preset person, and to identify whether the task type of the main steel grabber matches the new task information; wherein the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard;

[0088] The first scheduling module is used to send the first winning bid information to the preset personnel when the current state of the main steel grabber is idle and the task type of the main steel grabber matches the new task information. In this embodiment or other embodiments, the first winning bid information includes: the main steel grabber number, the service number of the current steel material transport vehicle, and the driving path from the main steel grabber to the current steel material transport vehicle.

[0089] The second scheduling module is used for sending new task information to a neighboring steel grabber when the current state of the main steel grabber is a non-idle state and / or the task type of the main steel grabber does not match the new task information, and obtaining the first bidding information through the neighboring steel grabber, and generating the second winning bid information based on the first bidding information after the acquisition time of the first bidding information exceeds the first preset time, and publishing the second winning bid information to the neighboring steel grabber, and sending the second winning bid information to a preset personnel after the neighboring steel grabber receives the feedback information of the second winning bid information; wherein, the neighboring steel grabber includes all non-main steel grabbers in the scrap steel yard that are within a preset distance range from the main steel grabber. In this embodiment or other embodiments, when obtaining the first bidding information through the neighbor steel grabber, if the time for obtaining the first bidding information does not exceed the first preset time, the first bidding information will continue to be obtained until the time for obtaining the first bidding information exceeds the first preset time; and after the winning bid information is released to the neighbor steel grabber, if the neighbor steel grabber does not receive the feedback information of the winning bid information, the winning bid information will be released to the neighbor steel grabber again until the neighbor steel grabber receives the feedback information of the winning bid information. In this embodiment or other embodiments, the first bidding information includes: the number of each non-main steel grabber in the neighbor steel grabber, the service number of the current steel transport vehicle, and the minimum driving distance from each non-main steel grabber in the neighbor steel grabber to the current steel transport vehicle. The second winning bid information includes: the number of the winning non-main steel grabber, the service number of the current steel transport vehicle, and the driving path from the winning non-main steel grabber to the current steel transport vehicle.

[0090] In addition, the distributed task scheduling system for the steel grabber can also include:

[0091] The non-main steel grabber status module is used to identify the current status of the non-main steel grabber when there is new task information in the task information at the current moment and the new task information is not sent by the preset personnel, and to identify whether the task type of the non-main steel grabber matches the new task information.

[0092] A third scheduling module is used to terminate the allocation of the new task information when the current state of the non-main steel grabber is a non-idle state and / or the task type of the non-main steel grabber does not match the new task information;

[0093] The fourth scheduling module is used to calculate the bidding cost when the current state of the non-main steel grabber is idle and the task type of the non-main steel grabber matches the new task information, and generate the second bidding information based on the bidding cost, and send the second bidding information to the main steel grabber, generate the third winning bid information through the main steel grabber, and send the third winning bid information to the non-main steel grabber, so that the non-main steel grabber reads the third winning bid information and determines whether it has won the bid based on the reading result of the third winning bid information; when the non-main steel grabber itself wins the bid, it sends the winning bid feedback information to the main steel grabber; when the non-main steel grabber itself does not win the bid, it ends the allocation of the new task information; wherein the bidding cost includes the minimum driving distance from the non-main steel grabber to the current steel material transport vehicle. In addition, when the non-main steel grabber itself wins the bid, this embodiment can also adjust the state of the non-main steel grabber from the idle state to the non-idle state according to the new task information and the second bidding information. In this embodiment, after sending the third winning bid information to the non-main steel grabber, it can also include: judging whether the non-main steel grabber receives the third winning bid information; if the non-main steel grabber receives the third winning bid information, the non-main steel grabber reads the third winning bid information; if the non-main steel grabber does not receive the third winning bid information, judging whether the sending time of the third winning bid information exceeds the second preset time; when the sending time of the third winning bid information exceeds the second preset time, the allocation of new task information is terminated; when the sending time of the third winning bid information does not exceed the second preset time, the third winning bid information is sent to the non-main steel grabber again. Among them, the second bidding information includes: the number of the non-main steel grabber, the service number of the current steel transport vehicle, and the minimum driving distance from the non-main steel grabber to the current steel transport vehicle. The third winning bid information includes: the winning non-main steel grabber number, the service number of the current steel transport vehicle, and the driving path from the winning non-main steel grabber to the current steel transport vehicle.

[0094] In summary, the present invention provides a distributed task scheduling system for a steel grabber, which compares the task information at the current moment with the task information at the previous moment, identifies the new task information based on the comparison result, and identifies the current state of the main steel grabber when the new task information is sent by a preset person, and identifies whether the task type of the main steel grabber matches the new task information; wherein the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard; when the current state of the main steel grabber is an idle state and the task type of the main steel grabber matches the new task information, sends the first winning bid information to the preset person; when the current state of the main steel grabber is a non-idle state , and / or when the task type of the main steel grabber does not match the new task information, the new task information is sent to the neighbor steel grabber, and the first bidding information is obtained through the neighbor steel grabber, and after the acquisition time of the first bidding information exceeds the first preset time, the second winning bid information is generated based on the first bidding information, and the second winning bid information is published to the neighbor steel grabber, and after the neighbor steel grabber receives the feedback information of the second winning bid information, the second winning bid information is sent to the preset personnel; wherein, the neighbor steel grabber includes all non-main steel grabbers in the scrap steel yard that are within a preset distance range from the main steel grabber, and the non-main steel grabber includes other steel grabbers in the scrap steel yard except the main steel grabber. It can be seen from this that this system can solve the efficiency problems, safety risks and cost problems of manually operated steel grabbers in the current scrap steel yard by using unmanned steel grabbers that can communicate with each other to perform steel processing tasks. At the same time, in the scrap steel yard operation scenario, when the operation control center fails, this system can support the mutual cooperation between multiple unmanned steel grabbers. The unmanned steel grabbers can communicate autonomously with neighboring steel grabbers, so that through the autonomous coordination of the steel grabbers, the steel processing tasks can be continued. Moreover, each independent steel grabber in this system can act as a decision maker to perform autonomous task allocation and path planning. At the same time, this system can classify the steel grabbers into main steel grabbers and non-main steel grabbers, and build a local center system to reduce the overall calculation amount, thereby speeding up the calculation speed and improving the solution efficiency.

[0095] It should be noted that the distributed task scheduling system for the steel grabber provided in the above embodiment and the distributed task scheduling method for the steel grabber provided in the above embodiment belong to the same concept, wherein the specific manner in which the distributed task scheduling method for the steel grabber performs operations has been described in detail in the above method embodiment, and will not be repeated here. In actual applications, the distributed task scheduling system for the steel grabber provided in the above embodiment can allocate the above functions to different functional modules as needed, that is, divide the internal structure of the distributed task scheduling system for the steel grabber into different functional modules, and then implement all or part of the functions of the corresponding functional modules through the distributed task scheduling method for the steel grabber described in the above embodiment, and this is not specifically limited here.

[0096] The embodiment of the present invention further provides a computer device, which may include a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program so that the computer device executes Figure 2 The steps of the distributed task scheduling method for the steel grabber. Fig.13 FIG. 1 is a schematic diagram showing a structure of a computer device 1000. Fig.13 As shown, the computer device 1000 includes: a processor 1010 , a memory 1020 , a power supply 1030 , a display unit 1040 , and an input unit 1060 .

[0097] The processor 1010 is the control center of the computer device 1000. It uses various interfaces and lines to connect various components, and executes various functions of the computer device 1000 by running or executing computer programs / instructions stored in the memory 1020, thereby monitoring the computer device 1000 as a whole. In the embodiment of the present invention, when the processor 1010 calls the computer program stored in the memory 1020, the following is executed: Figure 2 The steps of the distributed task scheduling method for the steel grabber. Optionally, the processor 1010 may include one or more processing units; preferably, the processor 1010 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface and application, etc., and the modem processor mainly processes wireless communication. In some embodiments, the processor, memory, and memory may be implemented on a single chip, and in some embodiments, they may also be implemented separately on separate chips.

[0098] The memory 1020 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, various applications, etc.; the data storage area may store instruction data, etc. created according to the use of the computer device 1000. In addition, the memory 1020 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage devices, etc.

[0099] The computer device 1000 also includes a power source 1030 (such as a battery) for supplying power to various components. The power source can be logically connected to the processor 1010 through a power management system, so that the power management system can manage functions such as charging, discharging, and power consumption.

[0100] The display unit 1040 may be used to display information input by the user or information provided to the user and various menus of the computer device 1000, and in the embodiment of the present invention, is mainly used to display the display interface of each application in the computer device 1000 and objects such as text and pictures displayed in the display interface. The display unit 1040 may include a display panel 1050. The display panel 1050 may be configured in the form of a liquid crystal display (LCD), an organic light-emitting diode (OLED), etc.

[0101] The input unit 1060 may be used to receive information such as numbers or characters input by the user. The input unit 1060 may include a touch panel 1070 and other input devices 1080. The touch panel 1070, also known as a touch screen, may collect touch operations of the user on or near it (such as operations of the user using a finger, a stylus, or any other suitable object or accessory on or near the touch panel 1070).

[0102] Specifically, the touch panel 1070 can detect the user's touch operation, detect the signal brought by the touch operation, convert these signals into touch point coordinates, send them to the processor 1010, and receive and execute the command sent by the processor 1010. In addition, the touch panel 1070 can be implemented in various types such as resistive, capacitive, infrared and surface acoustic wave. Other input devices 1080 can include but are not limited to one or more of a physical keyboard, function keys (such as volume control keys, power on / off keys, etc.), a trackball, a mouse, a joystick, etc.

[0103] Of course, the touch panel 1070 can cover the display panel 1050. When the touch panel 1070 detects a touch operation on or near it, it is transmitted to the processor 1010 to determine the type of touch event, and then the processor 1010 provides a corresponding visual output on the display panel 1050 according to the type of touch event. Fig.13 In the embodiment, the touch panel 1070 and the display panel 1050 are two independent components to implement the input and output functions of the computer device 1000, but in some embodiments, the touch panel 1070 and the display panel 1050 can be integrated to implement the input and output functions of the computer device 1000.

[0104] The computer device 1000 may further include one or more sensors, such as a pressure sensor, a gravity acceleration sensor, a proximity light sensor, etc. Of course, according to the needs of specific applications, the computer device 1000 may also include other components such as a camera.

[0105] The embodiment of the present invention further provides a computer-readable storage medium, in which a computer program / instruction is stored. When the computer program / instruction is executed by a processor, the above-mentioned device can perform the present invention as follows: Figure 2 The steps of the distributed task scheduling method for the steel grabber.

[0106] It can be understood by those skilled in the art that Fig.13 This is only an example of a computer device and does not constitute a limitation on the device. The device may include more or fewer components than shown in the figure, or combine certain components, or different components. For the convenience of description, the above parts are divided into modules (or units) according to their functions and described separately. Of course, when implementing the present invention, the functions of each module (or unit) can be implemented in the same or multiple software or hardware.

[0107] Those skilled in the art should understand that the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code. The present invention is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be applied to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the process. Figure 1 A process or multiple processes and / or boxes Figure 1 These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing device to work in a specific way, so that the instructions stored in the computer-readable memory produce a product including an instruction device, which implements the functions specified in the process. Figure 1 A process or multiple processes and / or boxes Figure 1 These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of operation steps are executed on the computer or other programmable device to produce a computer-implemented process, so that the instructions executed on the computer or other programmable device provide for implementing the process in the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0108] It should be understood that, although the terms first, second, third, etc. may be used to describe bidding information, etc. in the embodiments of the present invention, these terms are only used to distinguish bidding information from each other. For example, without departing from the scope of the embodiments of the present invention, the first bidding information may also be referred to as the second bidding information, and similarly, the second bidding information may also be referred to as the first bidding information.

[0109] The above embodiments are merely illustrative of the principles and effects of the present invention, and are not intended to limit the present invention. Anyone familiar with the art may modify or alter the above embodiments without departing from the spirit and scope of the present invention. Therefore, all equivalent modifications or alterations made by a person of ordinary skill in the art without departing from the spirit and technical concept disclosed by the present invention shall still be covered by the claims of the present invention.

Claims

1. A distributed task scheduling method for a steel grabber, characterized in that: The method comprises the following steps: Compare the task information at the current moment with the task information at the previous moment, and identify the new task information based on the comparison result, and when the new task information is sent by a preset person, identify the current state of the main steel grabber, and identify whether the task type of the main steel grabber matches the new task information; wherein the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard; When the current state of the main steel grabber is an idle state and the task type of the main steel grabber matches the new task information, sending the first winning bid information to the preset personnel; When the current state of the main steel grabber is a non-idle state, and / or the task type of the main steel grabber does not match the new task information, the new task information is sent to a neighbor steel grabber, and the first bidding information is obtained through the neighbor steel grabber, and after the acquisition time of the first bidding information exceeds a first preset time, second winning bid information is generated based on the first bidding information, and the second winning bid information is published to the neighbor steel grabber, and after the neighbor steel grabber receives feedback information of the second winning bid information, the second winning bid information is sent to the preset personnel; wherein, the neighbor steel grabber includes all non-main steel grabbers in the scrap steel yard that are within a preset distance range from the main steel grabber, and the non-main steel grabber includes other steel grabbers in the scrap steel yard except the main steel grabber.

2. The distributed task scheduling method for a steel grabber according to claim 1 is characterized in that: Acquire the first bidding information through the neighbor steel grabber, and if the time for acquiring the first bidding information does not exceed the first preset time, continue to acquire the first bidding information until the time for acquiring the first bidding information exceeds the first preset time; And, after the winning bid information is published to the neighboring steel grabber, if the neighboring steel grabber does not receive feedback information of the winning bid information, the winning bid information is published to the neighboring steel grabber again until the neighboring steel grabber receives feedback information of the winning bid information.

3. The distributed task scheduling method for a steel grabber according to claim 1 or 2, characterized in that: The first winning bid information includes: the main steel grabber number, the service number of the current steel transport vehicle, and the driving path from the main steel grabber to the current steel transport vehicle; The first bidding information includes: the number of each non-main steel grabber among the neighboring steel grabbers, the service number of the current steel transport vehicle, and the minimum driving distance from each non-main steel grabber among the neighboring steel grabbers to the current steel transport vehicle; The second winning bid information includes: the winning non-main steel grabbing machine number, the service number of the current steel transport vehicle, and the driving path from the winning non-main steel grabbing machine to the current steel transport vehicle.

4. The distributed task scheduling method for a steel grabber according to claim 1, characterized in that: If the new task information is not sent by a preset person, identifying the current state of the non-main steel grabber and identifying whether the task type of the non-main steel grabber matches the new task information; If the current state of the non-main steel grabber is a non-idle state, and / or the task type of the non-main steel grabber does not match the new task information, then the allocation of the new task information is terminated; If the current state of the non-main steel grabber is an idle state, and the task type of the non-main steel grabber matches the new task information, the bidding cost is calculated, and the second bidding information is generated based on the bidding cost, and the second bidding information is sent to the main steel grabber, and the third winning bid information is generated by the main steel grabber, and the third winning bid information is sent to the non-main steel grabber, so that the non-main steel grabber reads the third winning bid information and determines whether it has won the bid based on the reading result of the third winning bid information; when the non-main steel grabber itself wins the bid, it sends winning bid feedback information to the main steel grabber; when the non-main steel grabber itself does not win the bid, the allocation of the new task information is terminated; wherein, the bidding cost includes the minimum driving distance from the non-main steel grabber to the current steel transport vehicle.

5. The distributed task scheduling method for a steel grabber according to claim 4 is characterized in that: After sending the third winning bid information to the non-main steel grabbing machine, the method further includes: Determining whether the non-main steel grabbing machine has received the third winning bid information; If the non-main steel grasping machine receives the third bid winning information, the non-main steel grasping machine reads the third bid winning information; If the non-main steel grabber does not receive the third winning bid information, it is determined whether the sending time of the third winning bid information exceeds the second preset time; when the sending time of the third winning bid information exceeds the second preset time, the allocation of the new task information is terminated; when the sending time of the third winning bid information does not exceed the second preset time, the third winning bid information is resent to the non-main steel grabber.

6. The distributed task scheduling method for a steel grabber according to claim 4 or 5, characterized in that: When the non-main steel grabber itself wins the bid, according to the new task information and the second bidding information, the state of the non-main steel grabber is adjusted from an idle state to a non-idle state; The second bidding information includes: the number of the non-main steel grabbing machine, the service number of the current steel material transport vehicle, and the minimum driving distance from the non-main steel grabbing machine to the current steel material transport vehicle; The third winning bid information includes: the winning non-main steel grabbing machine number, the service number of the current steel transport vehicle, and the driving path from the winning non-main steel grabbing machine to the current steel transport vehicle.

7. The distributed task scheduling method for a steel grabber according to claim 1, characterized in that: If no new task information is identified based on the comparison result of the task information at the current moment and the task information at the previous moment, the method further includes: Get the next moment task information; The next moment task information is compared with the current moment task information, and based on the comparison result between the next moment task information and the current moment task information, it is identified whether there is new task information in the next moment task information; if there is, it is identified whether the new task information is sent by the preset personnel; if not, the subsequent moment task information is continued to be obtained for comparison until the new task information is identified.

8. A distributed task scheduling system for steel grabbing machine, characterized in that: The system comprises: The task information module is used to compare the task information at the current moment with the task information at the previous moment, and identify new task information based on the comparison result; A main steel grabber state module, used to identify the current state of the main steel grabber when the new task information is sent by a preset person, and to identify whether the task type of the main steel grabber matches the new task information; wherein the main steel grabber includes the steel grabber closest to the steel transport vehicle in the scrap steel yard; A first scheduling module, configured to send first winning bid information to the preset personnel when the current state of the main steel grabber is an idle state and the task type of the main steel grabber matches the new task information; The second scheduling module is used for sending the new task information to the neighboring grabber when the current state of the main grabber is a non-idle state and / or the task type of the main grabber does not match the new task information, and obtaining the first bidding information through the neighboring grabber, and generating the second winning bid information based on the first bidding information after the acquisition time of the first bidding information exceeds the first preset time, and publishing the second winning bid information to the neighboring grabber, and sending the second winning bid information to the preset personnel after the neighboring grabber receives the feedback information of the second winning bid information; wherein, the neighboring grabber includes all non-main grabbers in the scrap steel yard that are within a preset distance range from the main grabber, and the non-main grabber includes other grabbers in the scrap steel yard except the main grabber.

9. A computer device comprising a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the steps of the distributed task scheduling method for a steel grabber as described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the distributed task scheduling method for a steel grabber described in any one of claims 1 to 7 are implemented.