Vehicle task allocation method, device, storage medium and electronic device

Abstract

The present invention proposes a vehicle task allocation method, device, storage medium and electronic device, which obtain the efficiency value between each task to be allocated and each idle overhead crane; perform initial parameter value processing, take the maximum value of the efficiency values ​​between the hth task to be allocated and all idle overhead cranes as the first standard value of the hth task to be allocated, and set the second standard value of the idle overhead crane. In the case of multiple tasks and multiple overhead cranes, the efficiency value between the task to be allocated and each idle overhead crane, the first standard value of the task to be allocated and the second standard value of the idle overhead crane are combined to establish a matching relationship between the task to be allocated and the idle overhead crane from the perspective of the system, thereby ensuring the scheduling efficiency of the idle overhead cranes in the system as a whole and reducing the performance consumption of the system. The task to be allocated is allocated to the matching overhead crane with which the matching relationship is established.

Description

Technical Field

[0001] The present invention relates to the field of warehouse scheduling, and in particular to a vehicle task allocation method, device, storage medium and electronic equipment. Background Art

[0002] With the continuous development of the semiconductor industry, automation and unmanned factories are becoming more and more popular. Overhead Hoist Transport (OHT) is a device widely used in semiconductor production lines to automatically transport wafer boxes. The overhead transport device can realize automatic material transportation, reduce labor costs, and thus greatly speed up the overall production speed.

[0003] Due to the fixed nature of the overhead crane track and the requirements of the overhead crane's working environment, the overhead crane can only run on the track. Therefore, for the handling instructions issued by the upstream, the system needs to allocate suitable carts more efficiently and promptly to prevent traffic jams and reduce the overall efficiency of the factory. Summary of the invention

[0004] The object of the present invention is to provide a vehicle task allocation method, device, storage medium and electronic device to improve the above-mentioned problem.

[0005] In order to achieve the above purpose, the technical solution adopted by the embodiment of the present invention is as follows:

[0006] In a first aspect, an embodiment of the present invention provides a vehicle task allocation method, the method comprising:

[0007] Obtain the efficiency value between each task to be assigned and each idle overhead crane;

[0008] Performing initial processing of parameter values, including: taking the maximum value of the efficiency values ​​between the hth task to be assigned and all idle overhead cranes as the first standard value L(h) of the hth task to be assigned, setting the second standard value R(v) of the idle overhead crane, wherein 1≤h≤J, 1≤v≤V, J represents the total number of tasks to be assigned in the current matching round, and V represents the total number of idle overhead cranes in the current matching round;

[0009] Determine a matching relationship between the task to be assigned and the idle overhead cranes according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead cranes;

[0010] The task to be assigned is assigned to a matching overhead travelling crane with which a matching relationship is established.

[0011] In a second aspect, an embodiment of the present invention provides a vehicle task allocation device, the device comprising:

[0012] The first processing unit is used to obtain the efficiency value between each task to be assigned and each idle overhead crane;

[0013] The first processing unit is also used to perform initial processing of parameter values, including: taking the maximum value of the efficiency values ​​between the hth task to be assigned and all idle overhead cranes as the first standard value L(h) of the hth task to be assigned, and setting the second standard value R(v) of the idle overhead crane, wherein 1≤h≤J, 1≤v≤V, J represents the total number of tasks to be assigned in the current matching round, and V represents the total number of idle overhead cranes in the current matching round;

[0014] The first processing unit is further used to determine the matching relationship between the task to be assigned and the idle overhead crane according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead crane;

[0015] The second processing unit is used to assign the task to be assigned to a matching overhead travelling crane with which a matching relationship is established.

[0016] In a third aspect, an embodiment of the present invention provides a storage medium having a computer program stored thereon, and the computer program implements the above method when executed by a processor.

[0017] In a fourth aspect, an embodiment of the present invention provides an electronic device, comprising: a processor and a memory, wherein the memory is used to store one or more programs; when the one or more programs are executed by the processor, the above method is implemented.

[0018] Compared with the prior art, the vehicle task allocation method, device, storage medium and electronic device provided in the embodiments of the present invention obtain the efficiency value between each task to be allocated and each idle overhead crane; perform initial parameter value processing, including: taking the maximum value of the efficiency values ​​between the hth task to be allocated and all idle overhead cranes as the first standard value L(h) of the hth task to be allocated, setting the second standard value R(v) of the idle overhead crane, wherein 1≤h≤J, 1≤v≤V, J represents the total number of tasks to be allocated in the current matching round, and V represents the total number of idle overhead cranes in the current matching round; determining the matching relationship between the task to be allocated and the idle overhead crane according to the efficiency value between the task to be allocated and each idle overhead crane, the first standard value of the task to be allocated and the second standard value of the idle overhead crane; and allocating the task to be allocated to the matching overhead crane with which the matching relationship is established. In the case of multiple tasks and multiple overhead cranes, a matching relationship between the tasks to be assigned and the idle overhead cranes is established from the perspective of the system, combining the efficiency values ​​between the tasks to be assigned and each idle overhead crane, the first standard value of the tasks to be assigned and the second standard value of the idle overhead cranes, thereby ensuring the scheduling efficiency of the idle overhead cranes in the system as a whole and reducing the performance consumption of the system.

[0019] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, preferred embodiments are given below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0021] Figure 1 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention.

[0022] Figure 2 A schematic flow chart of a vehicle task allocation method provided in an embodiment of the present invention.

[0023] Figure 3 A schematic diagram of the initial processing results of parameter values ​​provided in an embodiment of the present invention.

[0024] Figure 4 A schematic diagram of sub-steps of S30 provided in an embodiment of the present invention.

[0025] Figure 5 This is one of the matching relationship diagrams provided in the embodiment of the present invention.

[0026] Figure 6 The second matching relationship diagram provided in the embodiment of the present invention.

[0027] Figure 7 The third matching relationship diagram provided for the embodiment of the present invention.

[0028] Figure 8 The fourth matching relationship diagram provided for the embodiment of the present invention.

[0029] Fig. 9 The fifth matching relationship diagram provided for the embodiment of the present invention.

[0030] Fig.10 The sixth matching relationship diagram provided for the embodiment of the present invention.

[0031] Fig.11 The seventh matching relationship diagram provided for the embodiment of the present invention.

[0032] Fig.12 The eighth matching relationship diagram provided for the embodiment of the present invention.

[0033] Fig.13 The ninth matching relationship diagram provided for the embodiment of the present invention.

[0034] Fig.14 A schematic diagram of units of a vehicle task allocation device provided in an embodiment of the present invention.

[0035] In the figure: 10 - processor; 11 - memory; 12 - bus; 13 - communication interface; 501 - first processing unit; 502 - second processing unit. DETAILED DESCRIPTION

[0036] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Generally, the components of the embodiments of the present invention described and shown in the drawings here can be arranged and designed in various different configurations.

[0037] Therefore, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the invention claimed for protection, but merely represents selected embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0038] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings. At the same time, in the description of the present invention, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0039] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0040] In the description of the present invention, it should be noted that the terms "upper", "lower", "inside", "outside", etc. indicate directions or positional relationships based on the directions or positional relationships shown in the accompanying drawings, or are directions or positional relationships in which the product of the invention is usually placed when in use. They are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore should not be understood as a limitation on the present invention.

[0041] In the description of the present invention, it is also necessary to explain that, unless otherwise clearly specified and limited, the terms "disposed" and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be an indirect connection through an intermediate medium, or it can be the internal communication of two elements. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0042] Some embodiments of the present invention are described in detail below in conjunction with the accompanying drawings. In the absence of conflict, the following embodiments and features in the embodiments can be combined with each other.

[0043] The embodiment of the present invention provides an electronic device, which may be a mobile phone device, a computer device, a server device, etc. The electronic device may serve as the central control center of the overhead crane dispatching system, and may communicate with any overhead crane in the system to achieve the purpose of overhead crane dispatching. Figure 1 , a schematic diagram of the structure of an electronic device. The electronic device includes a processor 10, a memory 11, and a bus 12. The processor 10 and the memory 11 are connected via the bus 12, and the processor 10 is used to execute an executable module stored in the memory 11, such as a computer program.

[0044] The processor 10 may be an integrated circuit chip having the ability to process signals. In the implementation process, each step of the vehicle task allocation method may be completed by an integrated logic circuit of hardware in the processor 10 or by instructions in the form of software. The above-mentioned processor 10 may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gates or transistor logic devices, or discrete hardware components.

[0045] The memory 11 may include a high-speed random access memory (RAM), and may also include a non-volatile memory, such as at least one disk memory.

[0046] The bus 12 may be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus, or an EISA (Extended Industry Standard Architecture) bus. Figure 1 Although only one bidirectional arrow is used in the diagram, it does not mean that there is only one bus 12 or only one type of bus 12 .

[0047] The memory 11 is used to store programs, such as programs corresponding to the vehicle task allocation device. The vehicle task allocation device includes at least one software function module that can be stored in the memory 11 in the form of software or firmware or fixed in the operating system (OS) of the electronic device. After receiving the execution instruction, the processor 10 executes the program to implement the vehicle task allocation method.

[0048] Possibly, the electronic device provided by the embodiment of the present invention further includes a communication interface 13. The communication interface 13 is connected to the processor 10 via a bus.

[0049] It should be understood that Figure 1 The structure shown is only a schematic diagram of a portion of the electronic device. The electronic device may also include Figure 1More or fewer components as shown, or with Figure 1 Different configurations are shown. Figure 1 Each component shown in the figure can be implemented by hardware, software or a combination thereof.

[0050] A vehicle task allocation method provided by an embodiment of the present invention can be applied to, but not limited to, Figure 1 For detailed procedures, please refer to the electronic equipment shown in Figure 2 , the vehicle task allocation method includes: S10, S20, S30 and S40, which are specifically described as follows.

[0051] S10, obtaining the efficiency value between each task to be assigned and each idle overhead crane.

[0052] The efficiency value between the task to be assigned and the idle overhead crane is related to the optimal route cost between the task to be assigned and the idle overhead crane, the execution priority of the task to be assigned, and the matching round of the task to be assigned. The task to be assigned can be a task issued by an upstream end (such as a server end, a user end, or a client end).

[0053] Optionally, W(h,v)=A- r(h,v)+priority(h)+extra(h), where W(h,v) is the efficiency value between the vth idle overhead crane and the hth task to be assigned, A is a preset value, which can be but is not limited to Integer.Max (2147483647), r(h,v) is the optimal route cost between the vth idle overhead crane and the hth task to be assigned, priority(h) is the execution priority of the hth task to be assigned (which can be specified by the user or divided according to preset rules), priority(h) is the execution priority of the hth task to be assigned, and extra(h) is the matching round of the hth task to be assigned (or its corresponding conversion coefficient). Wherein, 1≤h≤J, 1≤v≤V, J represents the total number of tasks to be assigned in the current matching round, and V represents the total number of idle overhead cranes in the current matching round.

[0054] It should be noted that, when the number of matching failures of a task is greater, that is, the number of matching rounds is greater, the value of extra(h) is greater.

[0055] S20, performing initial processing of parameter values, including: taking the maximum value of the efficiency between the hth task to be assigned and all idle overhead cranes as the first standard value L(h) of the hth task to be assigned, and setting the second standard value R(v) of the idle overhead cranes.

[0056] Optionally, for all h∈J, l(h)=max{w(h,v)}(v∈V), and the initial second standard value R(v) of all idle overhead cranes is set to zero.

[0057] Please refer to Figure 3 , Figure 3 A schematic diagram of the initial processing results of parameter values ​​provided by an embodiment of the present invention. Figure 3 In the figure, J=4 and V=4 are used as examples for illustration, but they are not used as limitations. Among them, Jh represents the hth task to be assigned in the current matching round, and Vi represents the i-th idle overhead crane in the current matching round. The dotted line between the task to be assigned and the idle overhead crane in the figure indicates that there is at least one reachable path from the current position of the idle overhead crane to the task starting point of the task to be assigned. The value next to the dotted line is the efficiency value between the task to be assigned and the idle overhead crane. In the figure, the value on the left side of the task to be assigned is the first standard value of the task to be assigned, and the value on the right side of the idle overhead crane is the second standard value of the idle overhead crane.

[0058] S30, determining a matching relationship between the task to be assigned and the idle overhead cranes according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead cranes.

[0059] S40, allocating the task to be allocated to the matching overhead travelling crane with which a matching relationship is established.

[0060] It should be understood that by assigning the task to be assigned to the matching overhead crane with which a matching relationship is established, the matching overhead crane can be scheduled to execute the task with which the matching relationship is established.

[0061] In the vehicle task allocation method provided in the embodiment of the present invention, in the case of multiple tasks and multiple overhead cranes, a matching relationship between the task to be allocated and the idle overhead cranes is established from the perspective of the system, combining the efficiency value between the task to be allocated and each idle overhead crane, the first standard value of the task to be allocated and the second standard value of the idle overhead cranes, thereby ensuring the scheduling efficiency of the idle overhead cranes in the system as a whole and reducing the performance consumption of the system.

[0062] exist Figure 2 Based on the content in S30, how to determine the matching relationship between the task to be assigned and the idle overhead crane, the embodiment of the present invention also provides an optional implementation method, please refer to Figure 4 , Figure 4 A schematic diagram of sub-steps of S30 provided in an embodiment of the present invention. S30, a step of determining a matching relationship between a task to be assigned and an idle overhead crane according to the efficiency value between the task to be assigned and each idle overhead crane, a first standard value of the task to be assigned and a second standard value of the idle overhead crane, comprises: S301 to S317, which are specifically described as follows.

[0063] S301, let j=1.

[0064] S302, determine whether there is an idle overhead crane that meets the matching condition corresponding to the jth task to be assigned. If there is no idle overhead crane that meets the matching condition corresponding to the jth task to be assigned, execute S303; if there is an idle overhead crane that meets the matching condition corresponding to the jth task to be assigned, execute S305.

[0065] Among them, the matching conditions corresponding to the jth task to be assigned include that there is a reachable path from the current position of the idle overhead crane to the task starting point of the jth task to be assigned, and W(j,v) = L(j)+ R(v), W(j,v) is the efficiency value between the vth idle overhead crane and the jth task to be assigned, L(j) is the first standard value of the jth task to be assigned, and R(v) is the second standard value of the vth idle overhead crane.

[0066] Through the matching condition, the idle overhead crane with the highest efficiency in executing the jth task to be assigned is found, thereby establishing a matching relationship between the two.

[0067] When there is no idle overhead crane that meets the matching condition corresponding to the jth task to be assigned, the matching condition corresponding to the jth task to be assigned needs to be adjusted in time. Specifically, the first standard value of the jth task to be assigned can be adjusted. At this time, S303 needs to be executed.

[0068] S303, determine whether the first type of efficiency difference corresponding to the jth task to be assigned exists. If the first type of efficiency difference corresponding to the jth task to be assigned exists, execute S304; if the first type of efficiency difference corresponding to the jth task to be assigned does not exist, execute S309.

[0069] Among them, the first type of efficiency difference is the minimum value greater than 0 in L(j)+ R(v)- W(j,v).

[0070] When j is a fixed value, if L(j)+R(v)-W(j,v) is less than or equal to 0 regardless of the value of v, it means that the first type of efficiency difference corresponding to the jth task to be assigned does not exist. At this time, it means that there is no overhead crane matching the jth task to be assigned in the current matching round, so S309 is executed to determine that the jth task to be assigned has failed to match. If at least one of the results of L(j)+R(v)-W(j,v) is greater than 0, it means that the first type of efficiency difference exists, and the minimum value greater than 0 in L(j)+R(v)-W(j,v) is taken as the first type of efficiency difference, and S304 is executed at this time.

[0071] S304: According to the first type of efficiency difference corresponding to the jth task to be assigned, adjust the first standard value L(j) of the jth task to be assigned.

[0072] Optionally, the first type of efficiency difference corresponding to the j-th task to be assigned is subtracted from the first standard value L(j) to obtain a new first standard value L(j) for the j-th task to be assigned.

[0073] Please refer to Figure 5 , Figure 5 This is one of the matching relationship diagrams provided in the embodiment of the present invention. Figure 5 Taking j=4 as an example, there is a reachable path from the current position of the idle overhead crane (V2, V3 and V4) to the starting point of the fourth task to be assigned, but none of the idle overhead cranes (V2, V3 and V4) satisfies W(j,v) = L(j)+ R(v). Therefore, there is no idle overhead crane that satisfies the matching condition corresponding to the fourth task to be assigned. At this time, the first type of efficiency difference corresponding to the fourth task to be assigned is determined to be the value of the formula L(j)+ R(v)- W(j,v) when v=3, specifically: 5+0-4=1.

[0074] When it is determined that the first type of efficiency difference corresponding to the fourth task to be assigned is 1, the first standard value L(4) of the fourth task to be assigned is adjusted. The first standard value L(4) of the fourth task to be assigned is 5-1=4. Please refer to Figure 6 , Figure 6 This is the second matching relationship diagram provided by the embodiment of the present invention. It should be noted that: Figure 6 for Figure 5 Corresponding adjustment results: It should be understood that during the matching process, the first standard value L(j) of the jth task to be assigned may be variable.

[0075] It should be noted that after executing S304 to adjust the first standard value L(j) of the jth task to be assigned, S302 is repeatedly executed to determine whether there is an idle overhead crane that meets the matching condition corresponding to the jth task to be assigned.

[0076] S309: Determine that the jth task to be assigned fails to match.

[0077] It should be noted that after determining that the jth task to be assigned fails to match, the matching round of the jth task to be assigned can be updated, and then 1 is added to the corresponding original matching round to obtain an updated value.

[0078] S310, let j=j+1, and determine whether j≤J holds.

[0079] If j≤J holds, S302 is repeatedly executed to determine whether there is an idle overhead travelling vehicle that meets the matching condition corresponding to the jth task to be assigned; if j≤J does not hold, it is determined that the current matching round is ended.

[0080] When the result of executing S302 is that there is an idle overhead crane that meets the matching condition corresponding to the j-th task to be assigned, it is necessary to further determine whether a matching relationship can be established between the two, so it is necessary to execute S305.

[0081] S305, determining whether there is a non-conflicting overhead crane among the idle overhead cranes that meet the matching conditions corresponding to the j-th task to be assigned. If there is a non-conflicting overhead crane among the idle overhead cranes that meet the matching conditions corresponding to the j-th task to be assigned, S306 is executed; if there is no non-conflicting overhead crane among the idle overhead cranes that meet the matching conditions corresponding to the j-th task to be assigned, that is, all the idle overhead cranes that meet the matching conditions corresponding to the j-th task to be assigned are conflicting overhead cranes, S307 is executed.

[0082] The non-conflicting overhead crane is an idle overhead crane that has not established a matching relationship with other tasks to be assigned, and the conflicting overhead crane is an idle overhead crane that has established a matching relationship with other tasks to be assigned.

[0083] Please refer to Figure 7 , Figure 7 The third matching relationship diagram provided by the embodiment of the present invention. Figure 7 For Figure 3 The matching results when j is 1 based on .

[0084] like Figure 7 As shown in FIG. 1 , when j is 1, the idle overhead crane that meets the matching condition corresponding to the first task to be assigned is V2, and the idle overhead crane V2 has not established a matching relationship with other tasks to be assigned. At this time, the idle overhead crane V2 is a non-conflicting overhead crane, and S306 can be executed to select one of the non-conflicting overhead cranes that meet the matching condition corresponding to the first task to be assigned as the matching overhead crane corresponding to the first task to be assigned, that is, the idle overhead crane V2 is used as the matching overhead crane corresponding to the first task to be assigned. Figure 7 The arrow line points to the middle.

[0085] S306: Select one of the non-conflicting overhead cranes that meet the matching condition corresponding to the j-th task to be assigned as the matching overhead crane corresponding to the j-th task to be assigned.

[0086] Establish a matching relationship between the jth task to be assigned and the selected non-conflicting overhead crane.

[0087] After S306, S310 is executed, and j=j+1 is set to determine whether j≤J holds; if j≤J holds, it is repeatedly determined whether there is an idle overhead travelling vehicle that meets the matching condition corresponding to the jth task to be assigned; if j≤J does not hold, it is determined that the current matching round is ended.

[0088] Please continue to refer to Figure 7When j is 2, the idle overhead crane that meets the matching condition corresponding to the second task to be assigned is V2, but the idle overhead crane V2 has established a matching relationship with the first task to be assigned, and the idle overhead crane V2 is a conflicting overhead crane. In the case that there is no non-conflicting overhead crane among the idle overhead cranes that meet the matching condition corresponding to the jth task to be assigned, S307 can be executed.

[0089] S307, determine whether there is an idle overhead crane that meets the matching condition corresponding to the K-th target conflict task other than the K-th target conflict overhead crane. If there is no idle overhead crane that meets the matching condition corresponding to the K-th target conflict task other than the K-th target conflict overhead crane, execute S308; if there is an idle overhead crane that meets the matching condition corresponding to the K-th target conflict task other than the K-th target conflict overhead crane, execute S314.

[0090] Among them, the initial value of K is 1. When K=1, the first target conflicting overhead crane is any conflicting overhead crane that meets the matching conditions corresponding to the j-th task to be assigned, and the first target conflicting task is the task to be assigned that establishes a matching relationship with the first target conflicting overhead crane. When K>1, the K-th target conflicting overhead crane is any conflicting overhead crane that meets the matching conditions corresponding to the K-1-th target conflicting task, and the K-th target conflicting task is the task to be assigned that establishes a matching relationship with the K-th target conflicting overhead crane.

[0091] Among them, the matching conditions corresponding to the Kth target conflict task include that there is a reachable path from the current position of the idle crane to the task starting point of the conflict task, and W(x K ,v) = L(x K )+ R(v),W(x K ,v) represents the efficiency value between the vth idle crane and the Kth target conflict task, x K is the task ranking number of the Kth target conflict task in the current matching round. Optionally, x K The task sequence number of the Kth target conflicting task (end point) on the target adjustment path in the current matching round.

[0092] S308, determine whether the second type of efficiency difference or the third type of efficiency difference corresponding to the jth task to be assigned exists. If neither the second type of efficiency difference nor the third type of efficiency difference exists, execute S309 to determine that the jth task to be assigned fails to match; if the second type of efficiency difference or the third type of efficiency difference corresponding to the jth task to be assigned exists, execute S311.

[0093] Among them, the second type of efficiency difference is L(x K )+ R(v)- W(x K ,v), and the third type of efficiency difference is the minimum value greater than 0 among L(j)+ R(v)- W(j,v).

[0094] When j is a fixed value, if L(j)+R(v)-W(j,v) is less than or equal to 0 regardless of the value of v, it means that the third type of efficiency difference corresponding to the j-th task to be assigned does not exist. If at least one of the results of L(j)+R(v)-W(j,v) is greater than 0, it means that the third type of efficiency difference exists, and the minimum value greater than 0 in L(j)+R(v)-W(j,v) is taken as the third type of efficiency difference.

[0095] In x K When v is a fixed value, L(x K )+ R(v)- W(x K ,v) are less than or equal to 0, it means that the second type of efficiency difference corresponding to the jth task to be assigned does not exist. K )+ R(v)- W(x K ,v) is greater than 0, indicating that the second type of efficiency difference exists. K )+ R(v)- W(x K ,v) is taken as the second type of efficiency difference.

[0096] Optionally, when there are multiple conflicting overhead cranes that meet the matching conditions of j tasks to be assigned, each conflicting overhead crane is used as the first target conflicting overhead crane, thereby obtaining multiple second-type efficiency differences, the minimum value of which is used as the second-type efficiency difference corresponding to the j-th task to be assigned, and the conflict path corresponding to the minimum value is used as the target adjustment path. The conflict path includes the j-th task to be assigned, the 1st to K target conflicting tasks, and the 1st to K target conflicting overhead cranes.

[0097] If the second type of efficiency difference or the third type of efficiency difference corresponding to the j-th task to be assigned exists, an adjustment method is further determined and S311 needs to be executed.

[0098] S311, determine whether a first preset condition is met. If the first preset condition is met, execute S312; if the first preset condition is not met, execute S313.

[0099] The first preset condition is that the second type of efficiency difference corresponding to the jth task to be assigned exists and the third type of efficiency difference does not exist, or the second type of efficiency difference is smaller than the third type of efficiency difference.

[0100] Please refer to Figure 8 , Figure 8 The fourth matching relationship diagram provided by the embodiment of the present invention. Figure 8 For Figure 7The matching result when j is 2 is based on . When j is 2, the idle overhead crane V2 that meets the matching conditions corresponding to the second task to be assigned has established a matching relationship with the first task to be assigned. At this time, the idle overhead crane V2 is the first target conflicting overhead crane, and the first task to be assigned is the first target conflicting task. It is determined that except for the idle overhead crane V2 (the first target conflicting overhead crane), there is no idle overhead crane that meets the matching conditions corresponding to the first task to be assigned (the first target conflicting task). At this time, execute S308 to determine whether the second type of efficiency difference or the third type of efficiency difference corresponding to the second task to be assigned exists. Combined with Figure 7 It can be seen that the second type of efficiency difference corresponding to the second task to be assigned (corresponding to the staggered path J2-V2-J1) is: 5+0-2=3; the third type of efficiency difference corresponding to the second task to be assigned (corresponding to the staggered path V3) is: 8+0-7=1. At this time, the first preset condition is not met, so S313 is executed, and the execution result is as follows Figure 8 shown.

[0101] S312: according to the second type of efficiency difference corresponding to the jth task to be assigned, the first standard value L(j) of the jth task to be assigned and the first standard value L(x) of the kth target conflicting task are calculated. k ) and the second standard value R(y k ) is adjusted, where 1≤k≤K.

[0102] Among them, y k It is the vehicle ranking number of the k-th target conflicting overhead vehicle in the current matching round.

[0103] S313: According to the third type of efficiency difference corresponding to the jth task to be assigned, the first standard value L(j) of the jth task to be assigned is adjusted.

[0104] After S312 or S313, that is, according to the second type of efficiency difference corresponding to the jth task to be assigned, the first standard value L(j) of the jth task to be assigned and the first standard value L(x k ) and the second standard value R(y k ) is adjusted, or after the first standard value L(j) of the j-th task to be assigned is adjusted according to the third type efficiency difference corresponding to the j-th task to be assigned, S302 is repeatedly executed to determine whether there is an idle overhead crane that meets the matching condition corresponding to the j-th task to be assigned.

[0105] exist Figure 8On this basis, when j is 3, S302 and its subsequent steps are repeated. The idle overhead crane V2 that meets the matching conditions corresponding to the third task to be assigned has established a matching relationship with the first task to be assigned. According to the above conditions, there is no idle overhead crane that meets the matching conditions corresponding to the first task to be assigned (the first target conflicting task). At this time, the second type of efficiency difference and the third type of efficiency difference corresponding to the third task to be assigned are determined. Combined Figure 8 It can be seen that the second type of efficiency difference corresponding to the third task to be assigned (corresponding to the staggered path J3-V2-J1) is: 5+0-2=3; the third type of efficiency difference corresponding to the third task to be assigned (corresponding to the staggered path V1) is: 8+0-4=4. At this time, the first preset condition is met, so S312 is executed, and the execution result is as follows: Fig. 9 As shown, L(3)=8-3=5, L(1)=5-3=2, R(2)=0+3=3. Please refer to Fig. 9 , Fig. 9 The fifth matching relationship diagram provided by the embodiment of the present invention. Fig. 9 For Figure 8 The adjustment result when j is 3 based on .

[0106] like Fig. 9 As shown, after executing S312 and adjusting the parameters, S302 and subsequent steps are repeated. The idle overhead crane V2 that meets the matching condition corresponding to the third task to be assigned has established a matching relationship with the first task to be assigned, and there is also an idle overhead crane V4 that meets the matching condition corresponding to the first task to be assigned. That is, in addition to the Kth target conflicting overhead crane, there is also an idle overhead crane that meets the matching condition corresponding to the Kth target conflicting task, and S314 needs to be executed at this time.

[0107] S314, determine whether there is a non-conflicting overhead crane among the idle overhead cranes that meet the matching conditions corresponding to the K-th target conflict task. If there is a non-conflicting overhead crane among the idle overhead cranes that meet the matching conditions corresponding to the K-th target conflict task, execute S315; if there is no non-conflicting overhead crane among the idle overhead cranes that meet the matching conditions corresponding to the K-th target conflict task, execute S317.

[0108] S315 , selecting one of the non-conflicting overhead cranes that meet the matching conditions corresponding to the K th target conflicting task as the matching overhead crane for the K th target conflicting task.

[0109] Please refer to Fig.10 , Fig.10 The sixth matching relationship diagram provided by the embodiment of the present invention. Fig.10 For Fig. 9The matching result when j is 3 is shown on the basis of . The idle overhead crane V4 that meets the matching condition corresponding to the first task to be assigned is a non-conflicting overhead crane, and the idle overhead crane V4 is used as the matching overhead crane corresponding to the first task to be assigned (the Kth target conflicting task).

[0110] S316, when K>1, the k-th target conflict overhead crane is used as the matching overhead crane for the k-1-th target conflict task; when K=1, the 1st target conflict overhead crane is used as the matching overhead crane for the j-th task to be assigned.

[0111] Among them, the 0th target conflict task is the jth task to be assigned.

[0112] After S316, S310 is repeatedly executed, and j=j+1 is set to determine whether j≤J is established. If j≤J is established, S302 is repeatedly executed to determine whether there is an idle overhead crane that meets the matching condition corresponding to the jth task to be assigned; if j≤J is not established, it is determined that the current matching round is over.

[0113] In an alternative scenario, Fig.10 Based on, when j is 4, S302 and its subsequent steps are repeatedly executed, and the idle overhead crane V4 that meets the matching conditions corresponding to the fourth task to be assigned has established a matching relationship with the first task to be assigned. According to the above conditions, there is no idle overhead crane that meets the matching conditions corresponding to the first task to be assigned (the first target conflicting task). The result after the corresponding parameter adjustment is as follows: Figure 5 As shown. Figure 5 Based on this, S302 and subsequent steps are repeated again, and the result is as follows Figure 6 As shown. Figure 6 Based on this, S302 and subsequent steps are repeated again, and the result is as follows Fig.11 As shown, Fig.11 The seventh matching relationship diagram provided by the embodiment of the present invention. Fig.11 On the basis of, when j is 4, S302 and its subsequent steps are repeated again. There are multiple idle overhead cranes that meet the matching conditions corresponding to the j (4)th task to be assigned, such as the idle overhead crane V2 and the idle overhead crane V3 shown in the figure. Idle overhead crane V2 and idle overhead crane V3 are respectively used as the first target conflicting overhead cranes corresponding to the j (4)th task to be assigned, and multiple conflicting paths are constructed. S307 is executed respectively to determine whether there are idle overhead cranes that meet the matching conditions corresponding to the Kth target conflicting task except the Kth target conflicting overhead crane on the conflicting path, until the end point of each conflicting path is found, and there is no idle overhead crane that meets the matching conditions corresponding to the Kth target conflicting task except the Kth target conflicting overhead crane. The second type efficiency difference of each conflicting path corresponding to the j (4)th task to be assigned is respectively calculated, and the minimum value thereof is taken as the second type efficiency difference corresponding to the j (4)th task to be assigned.

[0114] Take idle overhead crane V3 as an example to illustrate the first target conflicting overhead crane corresponding to the j (4)th task to be assigned. The first target conflicting overhead crane (idle overhead crane V3) corresponds to the second target conflicting task to be assigned (J2). At this time, idle overhead crane V2 that meets the matching conditions corresponding to the second task to be assigned has established a matching relationship with the third task to be assigned, so K=K+1 is executed, that is, the 13th task to be assigned is taken as the second target conflicting task corresponding to the j (4)th task to be assigned, and the above steps are continued. Finally, the conflict path is determined to be J4-V3-J2-V2-J3, the second task to be assigned is the first target conflicting task corresponding to the j (4)th task to be assigned, the idle overhead crane V2 is the second target conflicting overhead crane corresponding to the j (4)th task to be assigned, and the third task to be assigned is the second target conflicting task (Kth target conflicting task) corresponding to the j (4)th task to be assigned, which is also the end point of the conflict path. The second type of efficiency difference of the conflict path is given by its end point (x K ) is determined by the second type of efficiency difference of the conflicting path. K )+ R(v)- W(x K ,v) is the smallest value greater than 0, x K It is the task sequence number of the end point of the conflict path (the Kth target conflict task) in the current matching round.

[0115] refer to Fig.11 , it can be seen that the second type efficiency difference of the conflict path J4-V3-J2-V2-J3 is 5+0-4=1.

[0116] Similarly, the second type efficiency difference of the conflict path J4-V2-J3 is 5+0-4=1.

[0117] When there are multiple conflict paths with the minimum second-type efficiency difference, any conflict path with the minimum value is used as the target adjustment path. At this time, if the first preset condition is met, S312 is executed according to the target adjustment path, and the first standard value L(j) of the j-th task to be assigned and the first standard value L(x) of the k-th target conflict task on the target adjustment path are calculated according to the second-type efficiency difference corresponding to the j-th task to be assigned. k ) and the second standard value R(y k ) to make adjustments.

[0118] exist Fig.11 Based on this, the conflict path J4-V3-J2-V2-J3 is used as the target adjustment path. The results are as follows Fig.12 As shown, Fig.12 The eighth matching relationship diagram provided for the embodiment of the present invention.

[0119] S317, let K=K+1, and repeatedly determine whether there is an idle overhead crane that meets the matching condition corresponding to the Kth target conflict task except the Kth target conflict overhead crane.

[0120] exist Fig.12 Based on this, the final matching result is as follows Fig.13 As shown, Fig.13 The ninth matching relationship diagram provided for the embodiment of the present invention.

[0121] exist Figure 2 Based on the content in S10, the embodiment of the present invention also provides an optional implementation method, please refer to the following. S10, the step of obtaining the efficiency value between each task to be assigned and each idle overhead crane includes: S101, S102, S103 and S104, which are specifically described as follows.

[0122] S101, performing path planning according to the task starting point of the task to be assigned and the current position of the idle overhead crane.

[0123] S102, when the path planning result includes at least one reachable path, determine the route cost corresponding to each reachable path, wherein the route cost represents the time cost of moving from the current position of the idle overhead crane to the task starting point of the task to be assigned along the reachable path (optionally, including the movement time along the path, the turning time on the path, and the waiting time on the path).

[0124] Optionally, the reachable path is a (clear) path moving from the current position of the idle overhead crane to the task starting point of the task to be assigned.

[0125] S103, determining the optimal route cost between the task to be assigned and the idle overhead crane, wherein the optimal route cost is the route cost of the optimal route, and the optimal route is the reachable path with the lowest route cost;

[0126] S104, determining the efficiency value between the task to be assigned and the idle overhead crane according to the optimal route cost, the execution priority of the task to be assigned and the matching round of the task to be assigned.

[0127] When the idle crane is inaccessible, that is, it cannot move to the starting point of the task to be assigned, the efficiency value is empty.

[0128] See also Fig.14 , Fig.14 A vehicle task allocation device is provided in an embodiment of the present invention. Optionally, the vehicle task allocation device is applied to the electronic device described above.

[0129] The vehicle task allocation device includes: a first processing unit 501 and a second processing unit 502 .

[0130] The first processing unit 501 is used to obtain the efficiency value between each task to be assigned and each idle overhead crane;

[0131] The first processing unit 501 is also used to perform initial processing of parameter values, including: taking the maximum value of the efficiency values ​​between the hth task to be assigned and all idle overhead cranes as the first standard value L(h) of the hth task to be assigned, and setting the second standard value R(v) of the idle overhead crane, wherein 1≤h≤J, 1≤v≤V, J represents the total number of tasks to be assigned in the current matching round, and V represents the total number of idle overhead cranes in the current matching round.

[0132] The first processing unit 501 is further configured to determine a matching relationship between the task to be assigned and the idle overhead cranes according to the efficiency values ​​between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead cranes.

[0133] The second processing unit 502 is configured to assign the task to be assigned to a matching overhead travelling crane with which a matching relationship is established.

[0134] It should be noted that the vehicle task allocation device provided in this embodiment can execute the method flow shown in the above method flow embodiment to achieve the corresponding technical effect. For the sake of brief description, for parts not mentioned in this embodiment, reference can be made to the corresponding contents in the above embodiment.

[0135] The embodiment of the present invention further provides a storage medium, which stores computer instructions and programs, and when the computer instructions and programs are read and run, the vehicle task allocation method of the above embodiment is executed. The storage medium may include a memory, a flash memory, a register, or a combination thereof.

[0136] The following provides an electronic device, which may be a mobile phone device, a computer device, a server device, etc. The electronic device may be used as a central control center of the overhead crane dispatching system. Figure 1 As shown, the above-mentioned vehicle task allocation method can be implemented; specifically, the electronic device includes: a processor 10, a memory 11, and a bus 12. The processor 10 can be a CPU. The memory 11 is used to store one or more programs. When the one or more programs are executed by the processor 10, the vehicle task allocation method of the above-mentioned embodiment is executed.

[0137] In summary, the embodiments of the present invention provide a vehicle task allocation method, device, storage medium and electronic device, which obtain the efficiency value between each task to be allocated and each idle overhead crane; perform initial parameter value processing, including: taking the maximum value of the efficiency values ​​between the hth task to be allocated and all idle overhead cranes as the first standard value L(h) of the hth task to be allocated, setting the second standard value R(v) of the idle overhead crane, wherein 1≤h≤J, 1≤v≤V, J represents the total number of tasks to be allocated in the current matching round, and V represents the total number of idle overhead cranes in the current matching round; determining the matching relationship between the task to be allocated and the idle overhead crane according to the efficiency value between the task to be allocated and each idle overhead crane, the first standard value of the task to be allocated and the second standard value of the idle overhead crane; and allocating the task to be allocated to the matching overhead crane with which the matching relationship is established. In the case of multiple tasks and multiple overhead cranes, a matching relationship between the tasks to be assigned and the idle overhead cranes is established from the perspective of the system, combining the efficiency values ​​between the tasks to be assigned and each idle overhead crane, the first standard value of the tasks to be assigned and the second standard value of the idle overhead cranes, thereby ensuring the scheduling efficiency of the idle overhead cranes in the system as a whole and reducing the performance consumption of the system.

[0138] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

[0139] It will be apparent to those skilled in the art that the invention is not limited to the details of the exemplary embodiments described above and that the invention can be implemented in other specific forms without departing from the spirit or essential features of the invention. Therefore, the embodiments should be considered exemplary and non-limiting in all respects, and the scope of the invention is defined by the appended claims rather than the foregoing description, and it is intended that all variations falling within the meaning and scope of the equivalent elements of the claims be included in the invention. Any reference numeral in a claim should not be considered as limiting the claim to which it relates.

Claims

1. A vehicle task allocation method, characterized in that: The method comprises: Obtain the efficiency value between each task to be assigned and each idle overhead crane; Performing initial processing of parameter values, including: taking the maximum value of the efficiency values ​​between the hth task to be assigned and all idle overhead cranes as the first standard value L(h) of the hth task to be assigned, setting the second standard value R(v) of the idle overhead crane, wherein 1≤h≤J, 1≤v≤V, J represents the total number of tasks to be assigned in the current matching round, and V represents the total number of idle overhead cranes in the current matching round; Determine a matching relationship between the task to be assigned and the idle overhead cranes according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead cranes; Allocating the task to be assigned to a matching overhead travelling vehicle with which a matching relationship has been established; The step of determining the matching relationship between the task to be assigned and the idle overhead crane according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead crane comprises: Let j = 1; Determine whether there is an idle overhead crane that meets the matching condition corresponding to the jth task to be assigned; The matching condition corresponding to the jth task to be assigned includes that there is a reachable path from the current position of the idle overhead crane to the starting point of the jth task to be assigned, and W(j,v) = L(j)+ R(v), W(j,v) is the efficiency value between the vth idle overhead crane and the jth task to be assigned, L(j) is the first standard value of the jth task to be assigned, and R(v) is the second standard value of the vth idle overhead crane; If there is an idle overhead crane that meets the matching condition corresponding to the j-th task to be assigned, determine whether there is a non-conflicting overhead crane among the idle overhead cranes that meet the matching condition corresponding to the j-th task to be assigned; The non-conflicting overhead crane is an idle overhead crane that has not established a matching relationship with other tasks to be assigned; When there is a non-conflicting overhead crane among the idle overhead cranes that meet the matching condition corresponding to the j-th task to be assigned, one of the non-conflicting overhead cranes that meet the matching condition corresponding to the j-th task to be assigned is selected as the matching overhead crane corresponding to the j-th task to be assigned; Let j=j+1, and determine whether j≤J holds; If j≤J holds, then repeatedly determine whether there is an idle overhead crane that meets the matching condition corresponding to the jth task to be assigned; If j≤J is not true, the current matching round is determined to be over.

2. The vehicle task allocation method according to claim 1, characterized in that: The step of determining the matching relationship between the task to be assigned and the idle overhead crane according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead crane also includes: If there is no idle overhead crane that meets the matching condition corresponding to the jth task to be assigned, determine whether the first type of efficiency difference corresponding to the jth task to be assigned exists; Wherein, the first type of efficiency difference is the minimum value greater than 0 among L(j)+ R(v)- W(j,v); If the first type of efficiency difference corresponding to the jth task to be assigned exists, then the first standard value L(j) of the jth task to be assigned is adjusted according to the first type of efficiency difference corresponding to the jth task to be assigned; After adjusting the first standard value L(j) of the jth task to be assigned, repeatedly determining whether there is an idle overhead crane that meets the matching condition corresponding to the jth task to be assigned; If the first type of efficiency difference corresponding to the jth task to be assigned does not exist, it is determined that the jth task to be assigned fails to match; Let j=j+1 and determine whether j≤J holds.

3. The vehicle task allocation method according to claim 1, characterized in that: The step of determining the matching relationship between the task to be assigned and the idle overhead crane according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead crane also includes: In the case that there is no non-conflicting overhead crane among the idle overhead cranes that meet the matching condition corresponding to the j-th task to be assigned, determining whether there is an idle overhead crane that meets the matching condition corresponding to the K-th target conflicting task except the K-th target conflicting overhead crane; Wherein, the initial value of K is 1. When K=1, the first target conflicting overhead vehicle is any conflicting overhead vehicle that satisfies the matching condition corresponding to the jth task to be assigned, and the first target conflicting task is the task to be assigned that establishes a matching relationship with the first target conflicting overhead vehicle. When K>1, the Kth target conflicting overhead vehicle is any conflicting overhead vehicle that satisfies the matching condition corresponding to the K-1th target conflicting task, and the Kth target conflicting task is the task to be assigned that establishes a matching relationship with the Kth target conflicting overhead vehicle. The matching conditions corresponding to the Kth target conflicting task include that there is a reachable path from the current position of the idle overhead crane to the starting point of the conflicting task, and W(x K ,v) = L(x K )+ R(v),W(x K ,v) represents the efficiency value between the vth idle crane and the Kth target conflicting task, x K The task ranking number of the Kth target conflict task in the current matching round; If there is no idle overhead crane that meets the matching condition corresponding to the Kth target conflict task except the Kth target conflict overhead crane, determine whether the second type efficiency difference or the third type efficiency difference corresponding to the jth task to be assigned exists; Among them, the second type of efficiency difference is L(x K )+ R(v)- W(x K ,v), the third type of efficiency difference is the minimum value greater than 0 among L(j)+ R(v)- W(j,v); If neither the second type of efficiency difference nor the third type of efficiency difference exists, it is determined that the jth task to be assigned fails to match; If the second type of efficiency difference or the third type of efficiency difference corresponding to the j-th task to be assigned exists, determining whether the first preset condition is met; The first preset condition is that the second type of efficiency difference corresponding to the j-th task to be assigned exists and the third type of efficiency difference does not exist, or the second type of efficiency difference is smaller than the third type of efficiency difference; If the first preset condition is met, then according to the second type of efficiency difference corresponding to the jth task to be assigned, the first standard value L(j) of the jth task to be assigned and the first standard value L(x k ) and the second standard value R(y k ) is adjusted, where 1≤k≤K; If the first preset condition is not met, the first standard value L(j) of the jth task to be assigned is adjusted according to the third type of efficiency difference corresponding to the jth task to be assigned; According to the second type of efficiency difference corresponding to the jth task to be assigned, the first standard value L(j) of the jth task to be assigned and the first standard value L(x k ) and the second standard value R(y k ) is adjusted, or after the first standard value L(j) of the j-th task to be assigned is adjusted according to the third type efficiency difference corresponding to the j-th task to be assigned, it is repeatedly determined whether there is an idle overhead crane that meets the matching condition corresponding to the j-th task to be assigned.

4. The vehicle task allocation method according to claim 3, characterized in that: The step of determining the matching relationship between the task to be assigned and the idle overhead crane according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead crane also includes: If there is an idle overhead crane that meets the matching condition corresponding to the Kth target conflict task in addition to the Kth target conflict overhead crane, it is determined whether there is a non-conflicting overhead crane among the idle overhead cranes that meet the matching condition corresponding to the Kth target conflict task; If there is a non-conflicting overhead crane among the idle overhead cranes that meet the matching conditions corresponding to the K-th target conflict task, one of the non-conflicting overhead cranes that meet the matching conditions corresponding to the K-th target conflict task is selected as the matching overhead crane for the K-th target conflict task; When K>1, the k-th target conflict overhead crane is used as the matching overhead crane for the k-1-th target conflict task; when K=1, the 1st target conflict overhead crane is used as the matching overhead crane for the j-th task to be assigned; Let j=j+1 and determine whether j≤J holds.

5. The vehicle task allocation method according to claim 4, characterized in that: The step of determining the matching relationship between the task to be assigned and the idle overhead crane according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead crane also includes: If there is no non-conflicting overhead crane among the idle overhead cranes that meet the matching conditions corresponding to the Kth target conflict task, then let K=K+1, and repeatedly determine whether there is any idle overhead crane that meets the matching conditions corresponding to the Kth target conflict task except the Kth target conflict overhead crane.

6. The vehicle task allocation method according to claim 1, characterized in that: The step of obtaining the efficiency value between each task to be assigned and each idle overhead crane comprises: Path planning is performed based on the starting point of the task to be assigned and the current position of the idle overhead crane; In the case where the path planning result includes at least one reachable path, determining a route cost corresponding to each reachable path, wherein the route cost represents a time cost of moving from the current position of the idle overhead crane to the task starting point of the task to be assigned along the reachable path; Determine the optimal route cost between the task to be assigned and the idle overhead crane, wherein the optimal route cost is the route cost of the optimal route, and the optimal route is the reachable path with the lowest route cost; The efficiency value between the task to be assigned and the idle overhead crane is determined according to the optimal route cost, the execution priority of the task to be assigned and the matching round of the task to be assigned.

7. A vehicle task allocation device, characterized in that: For executing the method according to any one of claims 1 to 6, the device comprises: The first processing unit is used to obtain the efficiency value between each task to be assigned and each idle overhead crane; The first processing unit is also used to perform initial processing of parameter values, including: taking the maximum value of the efficiency values ​​between the hth task to be assigned and all idle overhead cranes as the first standard value L(h) of the hth task to be assigned, and setting the second standard value R(v) of the idle overhead crane, wherein 1≤h≤J, 1≤v≤V, J represents the total number of tasks to be assigned in the current matching round, and V represents the total number of idle overhead cranes in the current matching round; The first processing unit is further used to determine the matching relationship between the task to be assigned and the idle overhead crane according to the efficiency value between the task to be assigned and each idle overhead crane, the first standard value of the task to be assigned and the second standard value of the idle overhead crane; The second processing unit is used to assign the task to be assigned to a matching overhead travelling crane with which a matching relationship is established.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

9. An electronic device, characterized in that: include: A processor and a memory, the memory being used to store one or more programs; When the one or more programs are executed by the processor, the method according to any one of claims 1 to 6 is implemented.

Images