A method and system for sorting goods

Abstract

The application discloses a kind of cargo sorting method and system, wherein method includes the all stoppage scheme of the supply component under each simulation step number, the simulation step number does not exceed first preset step number;The number of executable tasks corresponding to each stoppage scheme is calculated, the executable task includes input task and output task;The running distance corresponding to each stoppage scheme is calculated;The optimal stoppage scheme is selected based on at least including the simulation step number running distance and the number of executable tasks multiple factors;The supply component is controlled based on the optimal stoppage scheme operation.The application, the number of executable tasks corresponding to all stoppage schemes including only stopping once to continuous stopping multiple times and running distance are investigated, and the supply component lifting movement is dispatched based on this to carry out input task and output task, realize doing a step to see many steps, compared with the scheme of traditional single supply component can obviously improve task execution beat, can realize the improvement of sorting efficiency.

Description

Technical Field

[0001] This invention relates to the field of cargo sorting technology, and in particular to a cargo sorting method and system. Background Technology

[0002] Automated sorting systems are a key technology in modern logistics, significantly improving efficiency and accuracy through the integration of advanced automated equipment and intelligent algorithms. In traditional logistics sorting, workers manually identify and classify thousands of packages, a time-consuming, labor-intensive, and error-prone process. Automated sorting systems, using scanners, barcode readers, weight sensors, and other equipment, automatically identify cargo information and quickly and accurately allocate goods to designated areas or transport routes according to preset sorting rules. The introduction of automated sorting systems not only significantly reduces labor costs and error rates but also improves the speed and flexibility of logistics processing. This is crucial for coping with the rapid development of e-commerce and the ever-increasing logistics demands.

[0003] In the prior art, patent CN 218808222 U discloses a typical automatic sorting machine, which has a vertical layout of multi-layer boxes and a delivery mechanism driven by a Cartesian coordinate robot. The sorting efficiency of this sorting machine is low, and it can only deliver one item to the corresponding box at a time, with a long delivery interval between two adjacent items.

[0004] Some technical solutions can improve sorting efficiency to some extent by setting up sorting carts on each floor and supplying goods to the carts on each floor through elevators, but there is still room for optimization in operational efficiency. Summary of the Invention

[0005] Purpose of the invention: In order to overcome the shortcomings of the existing technology, the present invention provides a goods sorting method and system that can improve sorting efficiency.

[0006] Technical solution: To achieve the above objectives, the goods sorting method of the present invention includes:

[0007] The statistics are compiled for all docking schemes of the supply component under each simulated number of steps, wherein the simulated number of steps does not exceed a first preset number of steps; wherein, "number of steps" is defined as follows: when the supply component moves from one supply position to another supply position without docking, it is considered that the supply component has taken one step; when the supply position of the supply component changes twice, it is considered that it has taken two steps, and so on.

[0008] Calculate the number of executable tasks corresponding to each of the aforementioned docking schemes, wherein the executable tasks include input tasks and output tasks; wherein, the input task is for the input mechanism to deliver goods to the supply component, and the output task is for the supply component to supply goods to the delivery unit; at each of the aforementioned reachable locations, at least one of the aforementioned supply units is capable of supplying goods to the sorting device; preferably, the first preset number of steps does not exceed the number of supply units;

[0009] Calculate the running distance corresponding to each of the aforementioned docking schemes. Here, the running distance is represented by the number of minimum step distances, which is the distance between two adjacent sorting devices. The running distance of the supply component is an integer multiple of the minimum step distance, and the value of this integer multiple is used as the running distance.

[0010] The optimal docking scheme is selected based on multiple factors, including at least the simulated step distance and the number of executable tasks.

[0011] The operation of the supply components is controlled based on the optimal docking scheme.

[0012] Furthermore, the statistics for all docking schemes of the supply components at each simulation step include:

[0013] When the simulated step count N is 1, based on the current position of the supply component, determine the position it can reach by moving once, and obtain all the docking schemes when the simulated step count is 1;

[0014] In this step, the position that the supply component can reach in one movement is preferably a position where there is an input task or output task to execute. Of course, in one approach, all possible positions can be traversed.

[0015] When the simulated step count N is greater than 1, all docking schemes for a simulated step count of N are determined based on the docking schemes for a simulated step count of N-1. That is, when N=2, based on the docking scheme for N=1, the position reachable by moving once more from its final docking position (preferably a position where an input or output task can be executed, but it can also be any of all possible positions) is obtained, resulting in a docking scheme for N=2. When N=3, this process continues based on the docking scheme for N=2. This continues until all docking schemes for a first preset step count of N are obtained.

[0016] The above steps allow for the rapid acquisition of all docking options, reducing computation time.

[0017] Further, the calculation corresponding to the number of executable tasks for each of the aforementioned docking schemes includes:

[0018] The system acquires information on multiple goods to be sorted from the input mechanism and determines the target layer corresponding to each of the goods to be sorted. The target layer is also the number of layers in the sorting device, which can be determined based on the number of layers in the collection container corresponding to the collection task where the goods to be sorted are located.

[0019] In this step, the number of goods to be sorted that have obtained information is no less than the first preset number of steps. This ensures that when there are continuous output tasks in the docking scheme, there is enough information on goods to be sorted that can be provided. The control system can know the corresponding goods information on each supply department after each input task is implemented.

[0020] Determine whether each of the docking locations corresponding to the docking scheme has an executable input task or output task. If yes, the sum of the input task and the output task is recorded in the number of executable tasks. Otherwise, it indicates that the docking scheme contains invalid docking and the docking scheme is removed.

[0021] In this step, if at a certain docking location, one of the suppliers has an output task at the corresponding layer's sorting device, but the mobile delivery mechanism on that layer cannot reach the receiving location in time to accept the supplier's goods, it is considered an unfeasible output task and is not counted in the number of executable tasks. This method can promptly eliminate docking schemes that clearly do not meet the requirements, and

[0022] Furthermore, it is important to eliminate input tasks that do not meet the output requirements. In this scheme, when the supply component reaches the top position, the topmost supply unit corresponds to the topmost sorting device. Therefore, only the topmost supply unit can supply goods to the topmost sorting device. If the goods corresponding to the topmost sorting device are assigned to other supply units, it is considered an invalid input task. Therefore, an input task that does not meet the output requirements is defined as one where the assigned supply unit cannot reach the target layer corresponding to the goods.

[0023] Furthermore, to prevent goods from remaining in the supply department for extended periods, priority delivery rights need to be established for such goods. Therefore, preferably,

[0024] Furthermore, the calculation corresponds to the running distance of each of the aforementioned docking schemes, specifically as follows:

[0025] Calculate the number of steps for each step, and sum the number of steps for all steps to represent the running distance.

[0026] Furthermore, the selection of the optimal docking scheme based on multiple factors, including at least the simulated step distance and the number of executable tasks, specifically includes:

[0027] The optimal docking scheme is selected based on the principles of fewer simulated steps, shorter running distance, and a larger number of executable tasks.

[0028] When the number of simulated steps is the same: if the running distance is the same, the docking scheme with more executable tasks is selected; if the number of executable tasks is the same, the docking scheme with shorter running distance is selected.

[0029] When the number of simulated steps is different: The running time can be used to unify the number of simulated steps and the running distance. That is, the time required for each docking and handover and the time required for the running distance traveled by the supply component 2 are determined to calculate the total running time. The number of simulated steps and the running distance can be combined, and then the average time spent on each executable task can be calculated based on the total running time and the number of executable tasks. The docking scheme with the shorter average time is selected first.

[0030] Furthermore, the step of selecting the optimal docking scheme based on at least several factors, including the simulated step distance and the number of executable tasks, also includes:

[0031] The optimal docking scheme is selected based on the principle of reducing the number of dwell times. The dwell time is used to count the dwell time of goods on the supply section. For each time the supply component docks at a position and the goods are not output, the dwell time of the goods is incremented by 1. When the goods that have been dwelling for a long time are delivered, the total number of dwell times on all supply sections of the supply component can be significantly reduced.

[0032] Correspondingly, before selecting the optimal docking scheme based on multiple factors including at least the simulated step running distance and the number of executable tasks, the method further includes: determining whether any cargo has been detained more than a second preset number of steps, and if so, eliminating the docking scheme.

[0033] In actual operation, the priority of the three factors—number of dwell times, short running distance, and number of executable tasks—can be increased as needed.

[0034] A goods sorting system includes a multi-layered sorting device, a supply component capable of vertical lifting and lowering, and an input mechanism with a fixed vertical position. The supply component has multiple supply sections, enabling it to simultaneously supply goods to the multiple layers of the sorting device. All supply sections lift and lower synchronously, and the input mechanism can supply goods to at most one supply section at a time. The sorting device includes a mobile delivery mechanism capable of moving along a fixed path. This mobile delivery mechanism receives goods supplied by the supply sections and moves along the path to deliver the goods to collection containers located on the side of the path. Each path has multiple collection containers on its side. In use, a control system assigns corresponding collection tasks to the collection containers and controls the supply sections to deliver the received goods into the corresponding collection containers based on the collection tasks. The system also includes a control system for executing the aforementioned goods sorting method.

[0035] Beneficial effects: The goods sorting method and system of the present invention adopts a scheme that includes multiple supply components that can simultaneously supply goods to multiple sorting devices. The number of executable tasks and running distances corresponding to all stopping schemes, from stopping only once to stopping multiple times, were examined. Based on this, the lifting and lowering motion of the supply components is scheduled to perform input and output tasks, realizing the ability to see multiple steps while doing one step. Compared with the traditional single supply component scheme, it can significantly improve the task execution cycle and improve sorting efficiency. Attached Figure Description

[0036] Figure 1 This is a schematic diagram of the cargo sorting system.

[0037] Figure 2 This is a structural diagram of the supplied components;

[0038] Figure 3 This is a schematic diagram of the structure of a goods sorting method.

[0039] In the diagram: 1-Sorting device; 11-Mobile feeding mechanism; 12-Collection container; 2-Feeding component; 21-Feeding section; 3-Input mechanism. Detailed Implementation

[0040] The invention will now be further described with reference to the accompanying drawings.

[0041] The cargo sorting method of the present invention is based on, for example, Figure 1The illustrated goods sorting system includes a multi-layered sorting device 1, a vertically movable supply component 2, and an input mechanism 3 with a fixed vertical position. The supply component 2 has multiple supply sections 21, enabling it to simultaneously supply goods to multiple layers of the sorting device 1. All supply sections 21 move synchronously, and the input mechanism 3 can supply goods to a maximum of one supply section 21 at a time. The sorting device 1 includes a mobile delivery mechanism 11 that moves along a fixed path. This mobile delivery mechanism 11 receives goods supplied by the supply sections 21 and moves along the path to deliver the goods to collection containers 12 located on the side of the path. Each path has multiple collection containers 12. In use, the control system assigns corresponding collection tasks to the collection containers 12 and controls the supply sections 21 to deliver the received goods to the corresponding collection containers 12 based on the collection tasks. Collection tasks are generally orders.

[0042] Based on this, the method includes the following steps S101-S105 (the order of the following steps is not used to constrain the actual execution order between steps):

[0043] Step S101: Count all docking schemes of the supply component 2 under each simulated number of steps, wherein the simulated number of steps does not exceed the first preset number of steps; wherein, the "number of steps" is defined as: the supply component 2 moves from one supply position to another supply position without docking, which is considered as the supply component 2 taking one step; when the supply position of the supply component 2 changes twice, it is considered as taking two steps, and so on.

[0044] Step S102: Calculate the number of executable tasks corresponding to each of the docking schemes. The executable tasks include input tasks and output tasks. The input task is for the input mechanism 3 to deliver goods to the supply component 2, and the output task is for the supply component 2 to supply goods to the delivery unit 1. At each reachable location, at least one supply unit 21 can supply goods to the sorting device 1. Preferably, the first preset number of steps does not exceed the number of supply units 21.

[0045] Step S103: Calculate the running distance corresponding to each of the above-mentioned docking schemes. Here, the running distance is represented by the number of minimum step distances. The minimum step distance is the distance between two adjacent sorting devices 1. The running distance of the supply component 2 is an integer multiple of the minimum step distance, and the value of the integer multiple is used as the running distance.

[0046] Step S104: Select the optimal docking scheme based on multiple factors, including at least the simulated step distance and the number of executable tasks;

[0047] Step S105: Control the operation of the supply component 2 based on the optimal docking scheme.

[0048] The above method examines the number of executable tasks and running distances corresponding to all docking schemes, from stopping only once to stopping multiple times consecutively (the number of stops does not exceed the first preset number of steps). Based on this, the lifting and lowering motion of the supply component 2 is scheduled to perform input and output tasks, realizing the ability to see multiple steps while doing one step. Compared with the traditional single supply component scheme, it can significantly improve the task execution cycle and improve sorting efficiency.

[0049] Preferably, the step S101 above, which involves counting all docking schemes of the supply component 2 at each simulation step, includes the following steps S201-S202:

[0050] Step S201: When the simulated step count N is 1, determine the position that the supply component 2 can reach by moving once based on its current position, and obtain all the docking schemes when the simulated step count is 1.

[0051] In this step, the position that the supply component 2 can reach in one movement is preferably a position where an input task or output task can be executed. Of course, in one embodiment, all possible positions can be traversed.

[0052] Step S202: When the simulated step count N is greater than 1, determine all the docking schemes for the simulated step count N based on the docking schemes with a simulated step count of N-1. That is, when N=2, based on the docking scheme of N=1, continue moving one more time to the position that can be reached (preferably the position that can be reached one time, where there is an input task or output task to execute, or it can be traversing all possible positions) to obtain the docking scheme of N=2. When N=3, continue in the same way based on the docking scheme of N=2. And so on, until all docking schemes with N=1 preset step count are obtained.

[0053] The above steps allow for the rapid acquisition of all docking options, reducing computation time.

[0054] Preferably, the calculation of the number of executable tasks corresponding to each of the above-mentioned docking schemes in step S102 includes the following steps S301-S302:

[0055] Step S301: Obtain information on multiple goods to be sorted on the input mechanism 3, and determine the target layer corresponding to each of the goods to be sorted; the target layer is also the number of layers of the sorting device 1, which can be determined based on the number of layers of the collection container 12 corresponding to the collection task where the goods to be sorted are located.

[0056] In this step, the number of goods to be sorted that have obtained information is not less than the first preset number of steps. This ensures that when there are continuous output tasks in the docking scheme, there is enough information on goods to be sorted that can be provided. The control system can know the corresponding goods information on each supply department 21 after each input task is implemented.

[0057] Step S302: Determine whether there is an executable input task or output task for each docking position corresponding to the docking scheme. If yes, the sum of the input task and the output task is recorded in the number of executable tasks. Otherwise, it indicates that the docking scheme contains invalid docking and the docking scheme is removed.

[0058] In this step, when a supplier 21 has an output task at a certain docking location, but the mobile delivery mechanism 11 of that layer cannot reach the receiving location in time to accept the goods from the supplier 21, it is considered an unfeasible output task and is not counted in the number of executable tasks. This method can promptly eliminate docking schemes that clearly do not meet the requirements, and

[0059] In the above steps, during the process of statistical analysis of executable tasks, parking schemes with invalid parking locations can be eliminated in a timely manner to prevent these parking schemes from affecting subsequent operations.

[0060] Furthermore, it is important to eliminate input tasks that do not meet the output requirements. In this embodiment, when the supply component 2 reaches its uppermost position, the uppermost supply unit 21 corresponds to the uppermost sorting device 1. Therefore, only the uppermost supply unit 21 can supply goods to the uppermost sorting device 1. When the goods corresponding to the uppermost sorting device 1 are assigned to other supply units 21, it is considered an invalid input task. Therefore, an input task that does not meet the output requirements is defined as: the supply unit 21 to which the goods are assigned cannot reach the target layer corresponding to the goods.

[0061] Furthermore, to prevent goods from remaining on the supply section 21 for extended periods, priority delivery rights need to be established for such goods. Therefore, preferably,

[0062] Preferably, the calculation of the running distance corresponding to each of the above-mentioned docking schemes in step S104 specifically includes:

[0063] Calculate the number of steps for each step, and sum the number of steps for all steps to represent the running distance.

[0064] Preferably, the step S104 above, which selects the optimal docking scheme based on at least the simulated step distance and the number of executable tasks, specifically includes:

[0065] The optimal docking scheme is selected based on the principles of fewer simulated steps, shorter running distance, and feasible tasks.

[0066] When the number of simulated steps is the same: if the running distance is the same, the docking scheme with more executable tasks is selected; if the number of executable tasks is the same, the docking scheme with shorter running distance is selected.

[0067] When the number of simulated steps is different: The running time can be used to unify the number of simulated steps and the running distance. That is, the time required for each docking and handover and the time required for the running distance traveled by the supply component 2 are determined to calculate the total running time. The number of simulated steps and the running distance can be combined, and then the average time spent on each executable task can be calculated based on the total running time and the number of executable tasks. The docking scheme with the shorter average time is selected first.

[0068] Preferably, step S104 above, which involves selecting the optimal docking scheme based on at least the simulated step distance and the number of executable tasks, further includes:

[0069] The optimal docking scheme is selected based on the principle of reducing the number of times goods are delayed. The number of times goods are delayed is used to count the dwell time of goods on the supply unit 21. Every time the supply component 2 docks at a position and the goods are not output, the number of times goods are delayed is incremented by 1. When goods that have been delayed multiple times are delivered, the total number of times goods are delayed on all supply units 21 on the supply component 2 can be significantly reduced.

[0070] Correspondingly, before step S104, the method further includes: determining whether any goods have been detained more than the second preset number of times, and if so, removing the docking scheme.

[0071] In actual operation, the priority of factors such as the number of times to stay, the shortest running distance, and the average time spent on each executable task can be set as needed to determine the optimal docking plan.

[0072] Through the above process, priority can be given to the delivery of delayed goods, preventing goods from being delayed in delivery.

[0073] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the principle of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

Claims

1. A method for sorting goods, characterized in that, The goods sorting method is implemented based on a goods sorting system, which includes a multi-layered sorting device, a supply component capable of vertical lifting and lowering, and an input mechanism with a fixed vertical position. The supply component has multiple supply sections, enabling it to simultaneously supply goods to multiple layers of the sorting device. All supply sections lift and lower synchronously, and the input mechanism can supply goods to at most one supply section at a time. The sorting device includes a mobile delivery mechanism capable of moving along a fixed path. This mobile delivery mechanism receives goods supplied by the supply sections and moves along the path to deliver the goods to collection containers located on the side of the path. Each path has multiple collection containers on its side. In use, the control system assigns corresponding collection tasks to the collection containers and controls the supply sections to deliver the received goods into the corresponding collection containers based on the collection tasks. The method includes: Statistically analyze all docking schemes of the supply component under each simulation step number, wherein the simulation steps do not exceed a first preset number of steps; Calculate the number of executable tasks corresponding to each of the aforementioned docking schemes, wherein the executable tasks include input tasks and output tasks; Calculate the running distance corresponding to each of the aforementioned docking schemes; The optimal docking scheme is selected based on multiple factors, including at least the number of simulated steps, the running distance, and the number of executable tasks. The operation of the supply components is controlled based on the optimal docking scheme.

2. The cargo sorting method according to claim 1, characterized in that, The statistics for all docking schemes of the supplied components at each simulation step include: When the simulated step count N is 1, based on the current position of the supply component, determine the position it can reach by moving once, and obtain all the docking schemes when the simulated step count is 1; When the simulated step count N is greater than 1, all the docking schemes when the simulated step count is N are determined based on the docking schemes with a simulated step count of N-1.

3. The cargo sorting method according to claim 1, characterized in that, Calculating the number of executable tasks corresponding to each of the aforementioned docking schemes includes: Obtain information on multiple goods to be sorted from the input mechanism, and determine the target layer corresponding to each of the goods to be sorted based on this information; Determine whether there is an executable input task or output task for each docking location corresponding to the docking scheme. If so, the sum of the input task and the output task is added to the number of executable tasks; otherwise, the docking scheme is removed.

4. The cargo sorting method according to claim 1, characterized in that, The calculation corresponds to the running distance of each of the aforementioned docking schemes, specifically as follows: Calculate the number of steps for each step, and sum the number of steps for all steps to represent the running distance.

5. The cargo sorting method according to claim 1, characterized in that, The selection of the optimal docking scheme based on multiple factors, including at least the simulated step distance and the number of executable tasks, specifically includes: The optimal docking scheme is selected based on the principles of fewer simulated steps, shorter running distance, and a larger number of executable tasks.

6. The cargo sorting method according to claim 1, characterized in that, The method of selecting the optimal docking scheme based on multiple factors, including at least the simulated step distance and the number of executable tasks, further includes: The optimal docking scheme is selected based on the principle of reducing the number of delays.

7. A cargo sorting system, performing the cargo sorting method according to any one of claims 1-6.

Images