Sorting task processing method and device, electronic equipment and readable medium

Abstract

The invention provides a sorting task processing method and device, electronic equipment and a readable medium, and the sorting task processing method comprises the following steps: obtaining a sorting record sent by RF sorting equipment; according to the sorting record and the sorting area where the sorter is located, the sorting efficiency in the specified time period is determined; determining attribute information of a to-be-received sorting task; and based on the sorting efficiency and the attribute information, the to-be-sorted tasks are distributed to RF sorting equipment corresponding to the sorters. Through the embodiment of the invention, the distribution efficiency of the sorting tasks can be improved, and the overstock amount of the sorting tasks of the warehousing system is reduced.

Description

Background Art

[0002] In the existing logistics warehouse picking operation process, each time a picker receives a task, he needs to actively trigger the WMS (warehouse management system) through a handheld picking device to receive the sorting task. This leads to inefficient allocation of sorting tasks and easily causes a backlog of sorting tasks in the WMS.

[0003] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention

[0004] The purpose of the present disclosure is to provide a method, device, electronic device and readable medium for processing a sorting task, so as to at least overcome the problems of low efficiency in allocating sorting tasks due to limitations and defects of related technologies to a certain extent.

[0005] According to a first aspect of an embodiment of the present disclosure, a method for processing a sorting task is provided, comprising: obtaining a sorting record sent by an RF sorting device; determining a sorting efficiency within a specified time period according to the sorting record and a sorting area where the sorter is located; determining attribute information of a sorting task to be collected; and allocating the task to be sorted to the RF sorting device corresponding to the sorter based on the sorting efficiency and the attribute information.

[0006] In an exemplary embodiment of the present disclosure, determining the sorting efficiency within a specified period of time according to the sorting record and the sorting area where the sorter is located includes:

[0007] Determining the complexity of the completed sorting task according to the sorting record;

[0008] Determine the storage location information of the sorting area where the sorter in the waiting task state is located, wherein the storage location information includes the length of the lane and / or the number of storage locations through which the sorting task is performed;

[0009] The sorting efficiency of the sorter within a specified time period is determined based on the complexity and the storage location information.

[0010] In an exemplary embodiment of the present disclosure, determining the attribute information of the sorting task to be picked up includes:

[0011] Determine the priority and timeliness information of the sorting task to be picked up;

[0012] Determine a profit index according to the number and complexity of items corresponding to the task to be sorted;

[0013] The priority, the timeliness information and the profit index are determined as the attribute information.

[0014] In an exemplary embodiment of the present disclosure, allocating the to-be-sorted task to the RF sorting device corresponding to the sorter based on the sorting efficiency and the attribute information includes:

[0015] Determining the authority information of the sorter for the task to be sorted;

[0016] Determine the bipartite graph weight corresponding to the sorting efficiency and the complexity in the attribute information based on the authority information;

[0017] Based on the Kuhn-Munkres algorithm, the tasks to be sorted under the bipartite graph weights are allocated to the RF sorting equipment corresponding to the sorter.

[0018] In an exemplary embodiment of the present disclosure, allocating the to-be-sorted tasks under the bipartite graph weights to the RF sorting equipment corresponding to the sorter based on the Kuhn-Munkres algorithm includes:

[0019] Assigning values ​​to the sorters and the tasks to be sorted under the bipartite graph weight according to the authority information;

[0020] Calculating the product between any of the assigned values ​​of the sorting efficiency and any of the assigned values ​​of the complexity;

[0021] Based on the product, one-to-one matching is performed between the plurality of the sorters and the plurality of the tasks to be sorted;

[0022] The to-be-sorted tasks are assigned to the RF sorting equipment corresponding to the sorter according to the matching results.

[0023] In an exemplary embodiment of the present disclosure, it further includes:

[0024] After allocating the to-be-sorted task to the RF sorting device corresponding to the sorter, determining the status of the allocated sorting task according to the response information of the RF sorting device;

[0025] The RF sorting device and the assigned sorting task are bound according to the status.

[0026] In an exemplary embodiment of the present disclosure, it further includes:

[0027] In response to the instruction of completing the sorting task fed back by the RF sorting device,

[0028] parsing the sorting task instructions to determine the completed sorting tasks;

[0029] The binding relationship between the RF sorting device and the completed sorting task is released.

[0030] According to a second aspect of an embodiment of the present disclosure, there is provided a device for processing a sorting task, comprising:

[0031] An acquisition module, configured to acquire the sorting records sent by the RF sorting device;

[0032] A determination module, configured to determine the sorting efficiency within a specified time period according to the sorting record and the sorting area where the sorter is located;

[0033] The determination module is configured to determine the attribute information of the sorting task to be collected;

[0034] The allocation module is configured to allocate the to-be-sorted tasks to the RF sorting equipment corresponding to the sorter based on the sorting efficiency and the attribute information.

[0035] According to a third aspect of the present disclosure, there is provided an electronic device, comprising: a memory; and a processor coupled to the memory, wherein the processor is configured to execute any one of the methods described above based on instructions stored in the memory.

[0036] According to a fourth aspect of the present disclosure, a computer-readable storage medium is provided, on which a program is stored, and when the program is executed by a processor, the method for processing a sorting task as described in any one of the above items is implemented.

[0037] The disclosed embodiment obtains the sorting records sent by the RF (Radio Frequency) sorting device, determines the sorting efficiency within a specified time period according to the sorting records and the sorting area where the sorter is located, and further determines the attribute information of the sorting tasks to be collected. Finally, based on the sorting efficiency and the attribute information, the sorting tasks to be collected are allocated to the RF sorting device corresponding to the sorter. An optimized active allocation scheme for sorting tasks is implemented by combining the sorting efficiency and the attribute information, which can improve the allocation efficiency of sorting tasks and reduce the backlog of sorting tasks in the warehousing system.

[0038] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without creative work.

[0040] Figure 1is a flow chart of a method for processing a sorting task in an exemplary embodiment of the present disclosure;

[0041] Figure 2 is a flow chart (I) of a method for processing a sorting task in an exemplary embodiment of the present disclosure;

[0042] Figure 3 is a flowchart (II) of another method for processing a sorting task in an exemplary embodiment of the present disclosure;

[0043] Figure 4 is a flowchart (III) of another method for processing a sorting task in an exemplary embodiment of the present disclosure;

[0044] Figure 5 is a flowchart (IV) of another method for processing a sorting task in an exemplary embodiment of the present disclosure;

[0045] Figure 6 is a flowchart (V) of another method for processing a sorting task in an exemplary embodiment of the present disclosure;

[0046] Figure 7 is a flowchart (six) of another method for processing a sorting task in an exemplary embodiment of the present disclosure;

[0047] Figure 8 is a flowchart (VII) of another method for processing a sorting task in an exemplary embodiment of the present disclosure;

[0048] Fig. 9 is an interactive schematic diagram of a processing scheme for a sorting task in an exemplary embodiment of the present disclosure;

[0049] Fig.10 is a flowchart of a processing scheme for a sorting task in an exemplary embodiment of the present disclosure;

[0050] Fig.11 is a schematic diagram of many-to-many matching under a processing scheme of a sorting task in an exemplary embodiment of the present disclosure (I);

[0051] Fig.12 is a schematic diagram of many-to-many matching under a processing scheme of a sorting task in an exemplary embodiment of the present disclosure (II);

[0052] Fig.13 is a schematic diagram of many-to-many matching under a processing scheme of a sorting task in an exemplary embodiment of the present disclosure (III);

[0053] Fig.14 is a schematic diagram of many-to-many matching under a processing scheme of a sorting task in an exemplary embodiment of the present disclosure (IV);

[0054] Fig.15is a schematic diagram of many-to-many matching under a processing scheme of a sorting task in an exemplary embodiment of the present disclosure (V);

[0055] Fig.16 is a block diagram of a processing device for a sorting task in an exemplary embodiment of the present disclosure;

[0056] Fig.17 is a block diagram of an electronic device in an exemplary embodiment of the present disclosure. DETAILED DESCRIPTION

[0057] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as being limited to the examples set forth herein; on the contrary, these embodiments are provided so that the present disclosure will be more comprehensive and complete, and the concepts of the example embodiments are fully conveyed to those skilled in the art. The described features, structures, or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure may be practiced while omitting one or more of the specific details, or other methods, components, devices, steps, etc. may be adopted. In other cases, known technical solutions are not shown or described in detail to avoid obscuring various aspects of the present disclosure.

[0058] In addition, the accompanying drawings are only schematic diagrams of the present disclosure, and the same reference numerals in the drawings represent the same or similar parts, so their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities, which do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

[0059] Figure 1 A schematic diagram showing an exemplary system architecture to which a processing solution for sorting tasks according to an embodiment of the present invention can be applied.

[0060] like Figure 1 As shown, the system architecture 100 may include one or more of terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or optical fiber cables, etc.

[0061] It should be understood that Figure 1The number of terminal devices, networks and servers in the embodiment is only for illustration. According to the implementation requirements, there may be any number of terminal devices, networks and servers. For example, the server 105 may be a server cluster composed of multiple servers.

[0062] Users can use terminal devices 101, 102, 103 to interact with server 105 through network 104 to receive or send messages, etc. Terminal devices 101, 102, 103 can be various electronic devices with display screens, including but not limited to smart phones, tablet computers, portable computers, desktop computers, etc.

[0063] In some embodiments, the processing method of the sorting task provided in the embodiments of the present invention is generally executed by the server 105. Accordingly, the processing device of the sorting task is generally set in the terminal device 103 (or the terminal device 101 or 102). In other embodiments, some terminals may have functions similar to those of the server device to execute the present method.

[0064] The exemplary embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.

[0065] Figure 2 is a flowchart of a method for processing a sorting task in an exemplary embodiment of the present disclosure.

[0066] refer to Figure 2 , the processing methods of sorting tasks can include:

[0067] Step S202, obtaining the sorting record sent by the RF sorting device.

[0068] In one embodiment of the present disclosure, the RF sorting device is used to scan and identify the sorted goods to record the circulation status of the goods based on the scanning results. Based on this, the status of the sorting task can be accurately and timely determined. The sorting record generated by the RF sorting device includes the goods identification, sorting time, sorting area, number of pieces, weight and category, etc.

[0069] Step S204, determining the sorting efficiency within a specified time period according to the sorting record and the sorting area where the sorter is located.

[0070] In one embodiment of the present disclosure, the sorting efficiency of the sorter in the sorting area is determined through the sorting records, which more accurately reflects the sorter's operational proficiency in the sorting area. Sorting tasks are actively allocated based on the sorting efficiency, so that the allocation plan of the sorting tasks is further optimized.

[0071] Step S206, determining the attribute information of the sorting task to be received.

[0072] In one embodiment of the present disclosure, the attribute information includes the cargo object, cargo quantity, timeliness, complexity and performance of the sorting task, but is not limited thereto. The attribute information can not only reflect the physical properties of the sorting task, but also reflect the benefits of completing the sorting task. Actively allocating sorting tasks in combination with the attribute information can further optimize the sorting plan, which is conducive to further improving the sorting efficiency and initiative of the sorters.

[0073] Step S208: allocating the to-be-sorted tasks to the RF sorting equipment corresponding to the sorter based on the sorting efficiency and the attribute information.

[0074] The disclosed embodiment obtains the sorting records sent by the RF sorting device, determines the sorting efficiency within a specified time period according to the sorting records and the sorting area where the sorter is located, and further determines the attribute information of the sorting tasks to be collected. Finally, based on the sorting efficiency and the attribute information, the tasks to be sorted are allocated to the RF sorting devices corresponding to the sorter. Combining the sorting efficiency and the attribute information, an optimized active allocation scheme for sorting tasks is implemented, which can improve the allocation efficiency of sorting tasks and reduce the backlog of sorting tasks in the warehousing system.

[0075] Next, each step of the method for processing the sorting task is described in detail.

[0076] In an exemplary embodiment of the present disclosure, Figure 3 As shown, determining the sorting efficiency within a specified period of time according to the sorting record and the sorting area where the sorter is located includes:

[0077] Step S302: determining the complexity of the completed sorting task according to the sorting record.

[0078] Step S204, determining the storage location information of the sorting area where the sorter in the waiting task state is located, wherein the storage location information includes the length of the lane and / or the number of storage locations passed by in executing the sorting task.

[0079] Step S306, determining the sorting efficiency of the sorter within a specified time period according to the complexity and the storage location information.

[0080] In one embodiment of the present disclosure, in the process of calculating the sorting efficiency, not only the influence of the storage location information on the sorting task is considered, but also the reliability of determining the sorting efficiency of the sorter in the designated sorting area is further improved by adding complexity.

[0081] In an exemplary embodiment of the present disclosure, Figure 4 As shown, the attribute information of the sorting task to be picked up includes:

[0082] Step S402, determining the priority and timeliness information of the sorting task to be picked up.

[0083] Step S404: determining a profit index according to the number and complexity of items corresponding to the to-be-sorted task.

[0084] Step S406: determine the priority, the timeliness information and the benefit index as the attribute information.

[0085] In one embodiment of the present disclosure, the priority can optimize the order of sorting task allocation, which is conducive to improving the processing efficiency of high-priority sorting tasks. In addition, the timeliness information includes the task creation time and the latest sorting time, etc., based on which the sorting task is guaranteed to be allocated within the effective time.

[0086] In one embodiment of the present disclosure, the profit index may be set to be positively correlated with the complexity, thereby improving the profit of the sorter in handling complex sorting tasks.

[0087] In an exemplary embodiment of the present disclosure, Figure 5 As shown, allocating the to-be-sorted task to the RF sorting device corresponding to the sorter based on the sorting efficiency and the attribute information includes:

[0088] Step S502, determining the authority information of the sorter for the task to be sorted.

[0089] Step S504: determining the bipartite graph weight corresponding to the sorting efficiency and the complexity in the attribute information based on the authority information.

[0090] In one embodiment of the present disclosure, by setting permission information to constrain the relationship between sorters and sorting tasks, the problem of assigning M picking tasks to N pickers can be converted into a weighted graph theory problem of a bipartite graph, that is, the global optimal problem is solved by matching the maximum weight of the bipartite graph, thereby optimizing the allocation efficiency of the sorting tasks to the greatest extent.

[0091] Step S506: Allocate the to-be-sorted tasks under the bipartite graph weights to the RF sorting equipment corresponding to the sorter based on the Kuhn-Munkres algorithm.

[0092] In one embodiment of the present disclosure, the Kuhn-Munkres algorithm is used to assign the tasks to be sorted under the bipartite graph weights to the RF sorting devices corresponding to the sorters, and the optimal solution can be found, that is, the best one-to-one match can be found when the sum of weights is maximized or minimized.

[0093] In an exemplary embodiment of the present disclosure, Figure 6As shown, allocating the to-be-sorted tasks under the bipartite graph weights to the RF sorting equipment corresponding to the sorter based on the Kuhn-Munkres algorithm includes:

[0094] Step S602: assigning values ​​to the sorters and the tasks to be sorted under the bipartite graph weights according to the authority information.

[0095] Step S604, calculating the product between any assigned value of the sorting efficiency and any assigned value of the complexity.

[0096] Step S606: performing one-to-one matching between the plurality of sorters and the plurality of tasks to be sorted based on the product.

[0097] Step S608: assigning the to-be-sorted task to the RF sorting device corresponding to the sorter according to the matching result.

[0098] In an exemplary embodiment of the present disclosure, Figure 7 As shown, the method for processing the sorting task also includes:

[0099] Step S702: after allocating the to-be-sorted task to the RF sorting device corresponding to the sorter, determining the status of the allocated sorting task according to the response information of the RF sorting device.

[0100] Step S704: Binding the RF sorting device and the allocated sorting task according to the status.

[0101] In an exemplary embodiment of the present disclosure, Figure 8 As shown, the method for processing the sorting task also includes:

[0102] Step S802, in response to the sorting task completion instruction fed back by the RF sorting device,

[0103] Step S804: parsing the sorting task instruction to determine the completed sorting task.

[0104] Step S806: releasing the binding relationship between the RF sorting device and the completed sorting task.

[0105] like Fig. 9 As shown, the logistics warehousing picking task dispatching solution 900 based on the delayed centralized order splitting idea according to an embodiment of the present disclosure includes the following four stages:

[0106] The order receiving stage 902 includes: the WMS warehouse management system receives the RF picking parameters and verifies the picker status and picking area, and determines whether there are any assigned but unfinished picking tasks. The judgment results include queuing, not queuing, and receiving assigned but unfinished picking tasks. The picker status is updated to the waiting picking task dispatch status, and the delayed centralized order distribution link is entered and the current status is returned to the picker's RF sorting device as the waiting picking task dispatch status.

[0107] The order calculation stage 904 includes: the WMS warehouse management system counts the picking efficiency of the pickers who are waiting for the picking task to be dispatched within a period of time, counts the complexity and profit index of the tasks to be picked up, matches and binds the pickers who are waiting for the picking task to be dispatched with the tasks to be picked up in a many-to-many manner, and pushes the picking tasks to the pickers' RF sorting devices.

[0108] The picking operation stage 906 includes: the picker operates the RF to perform the picking operation, and the WMS warehouse management system obtains the current picking task status, matches the picking tasks, and binds them.

[0109] Complete the task and exit the online stage 908: The picker operates the RF sorting equipment and clicks "Picking Offline", the WMS warehouse management system updates the picker's status to the leave status, and the assigned picking task is unbound.

[0110] like Fig.10 As shown, the sorting task processing solution according to the embodiment of the present invention includes the following key processes:

[0111] In step S1002, the picker clicks "Go Online to Pick" on the RF sorting device, that is, waits for the sorting task, and transmits the picker's authority information, picking area, and account information stored locally on the RF sorting device to the WMS backend system through an HTTP POST request. For example, a socket channel can be established between the RF and WMS backend systems through WebSocket technology, and continuous communication can be achieved after the connection is established.

[0112] Step S1004, the RF sorting device establishes a WebSocket with the WMS system and the picker enters a state of waiting for the picking task to be dispatched.

[0113] Step S1006: The WMS system centrally dispatches picking tasks based on the sorting task allocation algorithm of the embodiment of the present disclosure.

[0114] Step S1008: Push the batched sorting tasks to the picker's RF sorting equipment.

[0115] Combine the following Figures 11 to 15A scheme for allocating the to-be-sorted tasks under the weight of the bipartite graph to the RF sorting equipment corresponding to the sorter based on the Kuhn-Munkres algorithm is specifically described.

[0116] like Figures 11 to 15 As shown, a bipartite graph weight G(V, E) is set, where V includes a picker endpoint set So and a task endpoint set St, and E represents a pairable relationship between the picker and the picking task authority.

[0117] Step A: Count the picking tasks completed by N pickers during this period of time, and count the total number of pieces, total weight, total volume, the length of the aisle the pickers pass through, and the number of storage locations involved in these tasks. Calculate the complexity index C of these tasks based on the influencing factors of the corresponding parameters, and divide it by the time T to calculate and determine the index corresponding to the picker's sorting efficiency during this period.

[0118] Step B: Among the tasks to be received, take the first M tasks with the highest priority and timeliness, and calculate the complexity index C of these tasks. The revenue index R of this task is obtained by dividing the number of task items Qty by the complexity index C. For example, the revenue weight of picking task 1 can be recorded as R1, the revenue weight of picking task 2 can be recorded as R2, and the revenue weight of picking task 3 can be recorded as R3, and so on.

[0119] Step C: According to the picker's authority for the picking task, determine the pairing relationship diagram G2 between the picker and the task. If a picker does not have the authority for a picking task, the picker cannot be connected to the picking task. Figures 12 to 15 It is indicated by dotted lines. For example, picker 2 has no authority for picking task 2, and picker 3 has no authority for picking task 1 and picking task 3.

[0120] Step D: Multiply the picker's comprehensive picking efficiency index E by the task complexity index C as the bipartite graph weight, for example, Fig.11 The bipartite graph weight 1100 shown in Fig.12 The bipartite graph weight is 1200, as shown in Fig.13 The bipartite graph weight 1300 is shown in Fig.14 The bipartite graph weight shown is 1400, as Fig.15 The bipartite graph shown has weight 1500.

[0121] Step F: Use the Kuhn–Munkres algorithm (KM for short) to assign picking tasks. The specific processing method is shown in F1-F5.

[0122] F1: First, assign a value to each picker, whose value is the maximum weight of the bipartite graph of the connected edges, and the vertex on the right, that is, the picking task, is assigned a value of 0.

[0123] like Fig.13 As shown, traverse each picker, such as Fig.13 As shown, assuming that picker 1 does not have the authority for picking task 3, and it is determined that E1×R2>E1×R1, the matching result is picker 1 performing sorting task 2 as shown in E1×R2, which is simply recorded as T1-2, and its value is the calculation result of picker 1 performing picking task 2, where E1 represents picker 1 performing picking task 1, R1 represents the profit weight of picking task 1, and R2 represents the profit weight of picking task 2.

[0124] F2: Start matching. The matching principle is to only match the edge with the same weight as the score on the left (top label), that is, to select the edge with the largest value.

[0125] F3: When dealing with conflicts, it can be found that picker 3 and picker 1 exist, so they need to change sides. According to the pairing relationship diagram G2 of pickers and tasks, since picker 3 has no other tasks to choose, picker 1 must change sides.

[0126] F4: If Fig.14 As shown, T2-1 means that picker 2 performs picking task 1, T1-2 means that picker 1 performs picking task 2, and T3-2 means that picker 3 performs picking task 2. If picker 1 and picker 2 conflict, it is necessary to reduce D from the top mark of all left vertices of this path, that is, Fig.14 For T2-1-D, T1-2-D and T3-2 shown, the top mark of all right vertices is added with D.

[0127] F5: Since the node value has changed, the matching steps included in F2 above need to be re-executed.

[0128] For example, if T2-3>(T2-1-D), T2-3 represents the calculation result of picker 2 performing picking task 3, and T2-1-D represents the calculation result of picker 2 performing picking task 1, then the match between picker 2 and picking task 3 is available.

[0129] Furthermore, when it is determined that all matching relationships in the bipartite graph weights are conflict-free, we get Fig.15 The matching relationships shown are T1-2, T2-3 and T3-2, which respectively indicate that picker 1 performs picking task 2, T2-3 indicates that picker 2 performs picking task 3, and T3-2 indicates that picker 3 performs picking task 2, and the KM algorithm ends.

[0130] Step G: Bind the picker information with the assigned picking task.

[0131] Corresponding to the above method embodiments, the present disclosure also provides a sorting task processing device, which can be used to execute the above method embodiments.

[0132] Fig.16 It is a block diagram of a processing device for a sorting task in an exemplary embodiment of the present disclosure.

[0133] refer to Fig.16 , the processing device 1600 for the sorting task may include:

[0134] The acquisition module 1602 is configured to acquire the sorting records sent by the RF sorting device.

[0135] The determination module 1604 is configured to determine the sorting efficiency within a specified time period according to the sorting record and the sorting area where the sorter is located.

[0136] The determination module 1604 is configured to determine attribute information of the sorting task to be received.

[0137] The allocation module 1606 is configured to allocate the to-be-sorted tasks to the RF sorting equipment corresponding to the sorter based on the sorting efficiency and the attribute information.

[0138] In an exemplary embodiment of the present disclosure, the determining module 1604 is further configured to:

[0139] Determining the complexity of the completed sorting task according to the sorting record;

[0140] Determine the storage location information of the sorting area where the sorter in the waiting task state is located, wherein the storage location information includes the length of the lane and / or the number of storage locations through which the sorting task is performed;

[0141] The sorting efficiency of the sorter within a specified time period is determined based on the complexity and the storage location information.

[0142] In an exemplary embodiment of the present disclosure, the determining module 1604 is further configured to:

[0143] Determine the priority and timeliness information of the sorting task to be picked up;

[0144] Determine a profit index according to the number and complexity of items corresponding to the task to be sorted;

[0145] The priority, the timeliness information and the profit index are determined as the attribute information.

[0146] In an exemplary embodiment of the present disclosure, the allocation module 1606 is further configured to:

[0147] Determining the authority information of the sorter for the task to be sorted;

[0148] Determine the bipartite graph weight corresponding to the sorting efficiency and the complexity in the attribute information based on the authority information;

[0149] Based on the Kuhn-Munkres algorithm, the tasks to be sorted under the bipartite graph weights are allocated to the RF sorting equipment corresponding to the sorter.

[0150] In an exemplary embodiment of the present disclosure, the allocation module 1606 is further configured to:

[0151] Assigning values ​​to the sorters and the tasks to be sorted under the bipartite graph weight according to the authority information;

[0152] Calculating the product between any of the assigned values ​​of the sorting efficiency and any of the assigned values ​​of the complexity;

[0153] Based on the product, one-to-one matching is performed between the plurality of the sorters and the plurality of the tasks to be sorted;

[0154] The to-be-sorted tasks are assigned to the RF sorting equipment corresponding to the sorter according to the matching results.

[0155] In an exemplary embodiment of the present disclosure, the processing device 1600 for sorting tasks is further configured as follows:

[0156] After allocating the to-be-sorted task to the RF sorting device corresponding to the sorter, determining the status of the allocated sorting task according to the response information of the RF sorting device;

[0157] The RF sorting device and the assigned sorting task are bound according to the status.

[0158] In an exemplary embodiment of the present disclosure, the processing device 1600 for sorting tasks is further configured as follows:

[0159] In response to the instruction of completing the sorting task fed back by the RF sorting device,

[0160] parsing the sorting task instructions to determine the completed sorting tasks;

[0161] The binding relationship between the RF sorting device and the completed sorting task is released.

[0162] Since the functions of the device 1600 have been described in detail in the corresponding method embodiments, the present disclosure will not elaborate on them here.

[0163] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0164] In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.

[0165] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".

[0166] Refer to the following Fig.17 1700 according to this embodiment of the present invention will be described. Fig.17 The electronic device 1700 shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0167] like Fig.17 As shown, the electronic device 1700 is in the form of a general computing device. The components of the electronic device 1700 may include but are not limited to: at least one processing unit 1710, at least one storage unit 1720, and a bus 1730 connecting different system components (including the storage unit 1720 and the processing unit 1710).

[0168] The storage unit stores program codes, which can be executed by the processing unit 1710, so that the processing unit 1710 performs the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification. For example, the processing unit 1710 can perform the method shown in the embodiment of the present disclosure.

[0169] The storage unit 1720 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 17201 and / or a cache storage unit 17202 , and may further include a read-only storage unit (ROM) 17203 .

[0170] The storage unit 1720 may also include a program / utility 17204 having a set (at least one) of program modules 17205, such program modules 17205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0171] Bus 1730 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0172] The electronic device 1700 may also communicate with one or more external devices 1740 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 1700, and / or communicate with any device that enables the electronic device 1700 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 1750. Furthermore, the electronic device 1700 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 1760. As shown, the network adapter 1760 communicates with other modules of the electronic device 1700 via a bus 1730. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 1700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0173] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0174] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present invention can also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present specification.

[0175] The program product for implementing the above method according to an embodiment of the present invention can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto, and in this document, a readable storage medium can be any tangible medium containing or storing a program, which can be used by or in combination with an instruction execution system, an apparatus or a device.

[0176] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0177] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0178] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0179] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0180] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0181] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are to be considered exemplary only, and the true scope and concept of the present disclosure are indicated by the claims.

Claims

1. A method for processing a sorting task, characterized in that: include: Get the sorting records sent by the RF sorting device; Determine the sorting efficiency within a specified time period according to the sorting record and the sorting area where the sorter is located; Determine the attribute information of the sorting task to be picked up; The to-be-sorted tasks are allocated to the RF sorting equipment corresponding to the sorter based on the sorting efficiency and the attribute information.

2. The method for processing a sorting task according to claim 1, characterized in that: Determining the sorting efficiency within a specified period of time according to the sorting records and the sorting area where the sorter is located includes: Determining the complexity of the completed sorting task according to the sorting record; Determine the storage location information of the sorting area where the sorter in the waiting task state is located, wherein the storage location information includes the length of the lane and / or the number of storage locations through which the sorting task is performed; The sorting efficiency of the sorter within a specified time period is determined based on the complexity and the storage location information.

3. The method for processing a sorting task according to claim 1, characterized in that: The attribute information of the sorting task to be picked up includes: Determine the priority and timeliness information of the sorting task to be picked up; Determine a profit index according to the number and complexity of items corresponding to the task to be sorted; The priority, the timeliness information and the profit index are determined as the attribute information.

4. The method for processing a sorting task according to claim 1, characterized in that: Allocating the to-be-sorted task to the RF sorting device corresponding to the sorter based on the sorting efficiency and the attribute information includes: Determining the authority information of the sorter for the task to be sorted; Determine the bipartite graph weight corresponding to the sorting efficiency and the complexity in the attribute information based on the authority information; Based on the Kuhn-Munkres algorithm, the tasks to be sorted under the bipartite graph weights are allocated to the RF sorting equipment corresponding to the sorter.

5. The method for processing a sorting task according to claim 4, characterized in that: Allocating the to-be-sorted tasks under the bipartite graph weights to the RF sorting equipment corresponding to the sorter based on the Kuhn-Munkres algorithm includes: Assigning values ​​to the sorters and the tasks to be sorted under the bipartite graph weight according to the authority information; Calculating the product between any of the assigned values ​​of the sorting efficiency and any of the assigned values ​​of the complexity; Based on the product, one-to-one matching is performed between the plurality of the sorters and the plurality of the tasks to be sorted; The to-be-sorted tasks are assigned to the RF sorting equipment corresponding to the sorter according to the matching results.

6. The method for processing a sorting task according to any one of claims 1 to 5, characterized in that: Also includes: After allocating the to-be-sorted task to the RF sorting device corresponding to the sorter, determining the status of the allocated sorting task according to the response information of the RF sorting device; The RF sorting device and the assigned sorting task are bound according to the status.

7. The method for processing a sorting task according to any one of claims 1 to 5, characterized in that: Also includes: In response to the sorting task completion instruction fed back by the RF sorting device, parsing the sorting task instruction to determine the completed sorting task; The binding relationship between the RF sorting device and the completed sorting task is released.

8. A processing device for sorting tasks, characterized in that: include: An acquisition module, configured to acquire the sorting records sent by the RF sorting device; A determination module, configured to determine the sorting efficiency within a specified time period according to the sorting record and the sorting area where the sorter is located; The allocation determination module is configured to determine attribute information of the sorting task to be collected; The allocation module is configured to allocate the to-be-sorted tasks to the RF sorting equipment corresponding to the sorter based on the sorting efficiency and the attribute information.

9. An electronic device, characterized in that: include: Memory; as well as A processor coupled to the memory, wherein the processor is configured to execute the method for processing a sorting task according to any one of claims 1 to 7 based on instructions stored in the memory.

10. A computer-readable storage medium having a program stored thereon, wherein when the program is executed by a processor, the method for processing a sorting task as claimed in any one of claims 1 to 7 is implemented.

Images