Warehousing partitioning method, device and equipment and warehousing system

By dynamically dividing physical tunnels as target sub-lane in the intelligent warehousing system, the problem of unbalanced robot tasks is solved, and the warehousing and handling efficiency and order fulfillment speed are improved.

CN119037969AActive Publication Date: 2024-11-29HAI ROBOTICS CO LTD

Patent Information

Application Number
CN202411377187.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-27
Publication Date
2024-11-29
Estimated Expiration
2044-09-27

AI Technical Summary

Technical Problem

In an intelligent warehousing system, when robots perform handling operations, resources are wasted and inefficient due to unbalanced tasks.

Method used

By dynamically dividing physical tunnels into target sub-tiles, the task load to be performed in each target sub-tile is more balanced, ensuring that the operating points in each tunnel are continuous and belong to the same physical tunnel, and a robot is assigned to each target sub-tile. to perform tasks.

Benefits of technology

It effectively avoids long-distance movement and route interference between robots, balances task allocation, improves handling operation efficiency and shortens order fulfillment time.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119037969A_ABST
    Figure CN119037969A_ABST
Patent Text Reader

Abstract

The invention discloses a storage partition method, device and equipment and a storage system. The method comprises the following steps: dividing a plurality of physical roadways into a plurality of target sub-roadways according to a first number and a to-be-executed task load corresponding to each operation point, so that the number of the target sub-roadways is the first number; a first difference value between to-be-executed task loads corresponding to any two target sub-roadways in the same physical roadway is smaller than a to-be-executed task load mean value, and the sum of the to-be-executed task loads corresponding to any two target sub-roadways in the same physical roadway is larger than the to-be-executed task load mean value, the operation points in the target sub-roadway are continuous and belong to the same physical roadway. According to the technical scheme, the physical roadway is dynamically partitioned, the number of tasks executed by each robot can be effectively balanced, and the carrying operation efficiency of the robots is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of intelligent warehousing, and specifically to a warehousing partitioning method, device, equipment and warehousing system. Background Art

[0002] Smart warehousing usually requires the use of automated equipment such as robots to automate the storage, picking and handling of goods.

[0003] In some existing warehouse automation operation scenarios, when robots perform handling operations according to tasks, the uneven number of tasks in the fixed storage area corresponding to each robot leads to waste of robot resources and low handling efficiency of the entire warehouse. Summary of the invention

[0004] In view of this, the present application proposes a warehouse partitioning method, device, equipment and warehouse system to improve the warehouse handling efficiency.

[0005] In a first aspect, the present application proposes a storage partitioning method, the method is applied to a storage system, the storage system includes a plurality of physical lanes, the method includes:

[0006] Obtaining a first number of robots in a usable state in the storage area;

[0007] Counting the load of tasks to be executed corresponding to each operation point in the storage area, wherein the operation point includes spatial location information;

[0008] The multiple physical lanes are divided into multiple target sub-lanes according to the first number and the load of tasks to be executed corresponding to each operating point, so that the number of target sub-lanes is the first number, and when a physical lane includes at least two target sub-lanes, the first difference between the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is less than the average load of tasks to be executed, and the sum of the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is greater than the average load of tasks to be executed, wherein the operating points in the target sub-lanes are continuous and belong to the same physical lane, and the average load of tasks to be executed is the ratio of the total load of tasks to be executed in the storage area to the first number.

[0009] In some embodiments, when there is only one target sub-lane in a physical lane, the total load of tasks to be executed in the physical lane is less than twice the average load of the tasks to be executed.

[0010] In some embodiments, the load of tasks to be performed is the number of tasks to be performed or the time cost of tasks to be performed.

[0011] In some embodiments, the load of tasks to be executed includes the time cost of the tasks to be executed, and the counting of the load of tasks to be executed corresponding to each operation point in the storage area includes:

[0012] Determine the execution order of at least one task to be executed corresponding to the operation point;

[0013] The time cost of the task to be executed corresponding to each operation point is calculated according to the height of each task to be executed and the execution order.

[0014] In some embodiments, dividing the plurality of physical lanes into a plurality of target sub-lanes according to the first number and the to-be-performed task load corresponding to each operation point includes:

[0015] Converting the two-dimensional planes corresponding to the multiple physical lanes into a one-dimensional sequence, wherein each operation point in the one-dimensional sequence includes a physical lane identifier and index information of the operation point;

[0016] Dividing the one-dimensional sequence into at least two set schemes according to the to-be-executed task load corresponding to each operating point, each set scheme includes the first number of sets, wherein the operating points in each set in each set scheme are continuous and belong to the same physical lane;

[0017] A target solution in the at least two set solutions is determined according to an optimization target, and the target solution is used to indicate dividing the multiple physical lanes into the multiple target sub-lanes.

[0018] In some embodiments, the optimization goal is to minimize the binormal cumulative sum of the second difference values ​​corresponding to the set scheme, wherein the second difference value is the difference between the total load of tasks to be executed of each set in the set scheme and the mean load of the tasks to be executed.

[0019] In some embodiments, determining a target solution from among the at least two set solutions according to an optimization target includes:

[0020] Calculating a second difference between the total load of tasks to be executed in each set in the set scheme and the mean load of the tasks to be executed;

[0021] Accumulate the second difference value corresponding to each set in the set solution to obtain an accumulated sum;

[0022] The set solution with the smallest cumulative sum among the at least two set solutions is determined as the target solution.

[0023] In some embodiments, dividing the plurality of physical lanes into a plurality of target sub-lanes according to the first number and the to-be-performed task load corresponding to each operation point includes:

[0024] Dividing the plurality of physical lanes into a plurality of sub-lanes according to each operation point;

[0025] The divided multiple sub-lanes are merged into the multiple target sub-lanes according to the first number and the to-be-executed task load corresponding to each operation point, so that the number of the target sub-lanes is the first number, wherein the operation points in the target sub-lanes are continuous and belong to the same physical lane.

[0026] In some embodiments, after dividing the plurality of physical lanes into a plurality of target sub-lanes according to the first number and the to-be-performed task load corresponding to each operation point, the method further includes:

[0027] One of the robots is allocated in each of the target sub-lanes, so that the robot performs the task of picking up and placing goods in the corresponding target sub-lane.

[0028] In a second aspect, the present application further provides a storage partitioning device, the device is applied to a storage system, the storage system includes a plurality of physical lanes, and the device includes:

[0029] An acquisition module, used for acquiring a first number of robots in a usable state in a storage area;

[0030] A statistics module, used to count the load of tasks to be executed corresponding to each operation point in the storage area, wherein the operation point includes spatial location information;

[0031] A division module is used to divide the multiple physical lanes into multiple target sub-lanes according to the first number and the load of tasks to be executed corresponding to each operation point, so that the number of the target sub-lanes is the first number, and when a physical lane includes at least two target sub-lanes, the first difference between the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is less than the average load of tasks to be executed, and the sum of the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is greater than the average load of tasks to be executed, wherein the operation points in the target sub-lanes are continuous and belong to the same physical lane, and the average load of tasks to be executed is the ratio of the total load of tasks to be executed in the storage area to the first number.

[0032] In a third aspect, the present application further provides an electronic device, the electronic device comprising:

[0033] at least one processor; and

[0034] a memory communicatively connected to the at least one processor; wherein,

[0035] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method provided by the first aspect and any embodiment of the first aspect.

[0036] In a fourth aspect, the present application also provides a warehousing system, comprising: a robot, an electronic device as described in the third aspect above, and a plurality of columns of shelves arranged in a storage area, wherein two columns of the shelves form a physical lane, and the electronic device is used to control the robot to perform handling operations in the physical lane, and the robot moves in the physical lane and handles the goods in the shelves on both sides of the physical lane.

[0037] In a fifth aspect, the present application provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the method provided in the first aspect and any embodiment of the first aspect.

[0038] In a sixth aspect, the present application provides a computer program product, comprising a computer program / instruction, which, when executed by a processor, implements the method provided in the first aspect and any embodiment of the first aspect.

[0039] Through the warehouse partitioning method, device, equipment and warehouse system provided by the present application, multiple physical lanes are rationally and dynamically divided into multiple target sub-lanes, so that the load of tasks to be executed in each target sub-lane is more balanced. Therefore, when the robot performs warehouse tasks, it can effectively avoid the robot's own long-distance picking and placing of material boxes and interference in the movement routes between robots, balance the number of tasks assigned to each robot, improve the robot's handling operation efficiency, and shorten the order fulfillment time.

[0040] Other features and advantages of the present application will be described in detail in the subsequent detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] The accompanying drawings constituting a part of the present application are used to provide a further understanding of the present application, and the schematic implementation modes and descriptions of the present application are used to explain the present application. In the accompanying drawings:

[0042] Figure 1 A schematic diagram of the process flow of the storage partitioning method provided in the embodiment of the present application;

[0043] Figure 2 A schematic diagram of a storage partitioning scenario provided in an embodiment of the present application;

[0044] Figure 3A schematic diagram of a flow chart of a method for dividing multiple target sub-lanes provided in an embodiment of the present application;

[0045] Figure 4 A schematic diagram of the structure of a storage partition device provided in an embodiment of the present application;

[0046] Figure 5 A schematic diagram of the structure of an electronic device according to a preferred embodiment of the present invention. DETAILED DESCRIPTION

[0047] In order to make the purpose, technical solutions and advantages of this application clearer, the technical solutions in this application will be clearly and completely described below in conjunction with the drawings in this application. Obviously, the described embodiments are part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0048] In the warehousing system, automated operations such as storage, picking and handling of goods can be realized through automated equipment such as robots. The warehousing system includes at least a robot, which is set on multiple shelves in the storage area, wherein a physical lane is formed between two shelves. The robot moves in the physical lane and handles the goods on the shelves on both sides of the physical lane. The physical lane includes multiple operation points for the robot to handle goods. Each shelf is designed with multiple layers and multiple columns. Each shelf can store multiple columns of goods to be handled. Each operation point corresponds to two opposite columns of multi-layer goods on the shelves on both sides. The robot is used to move to the operation point to move the goods on the upper storage position to the lower cache position to complete the handling operation.

[0049] Based on this, the present application proposes a warehouse partitioning method, device, equipment and warehouse system, which can dynamically partition the physical lanes, balance the number of tasks assigned to each robot, and improve the robot's handling efficiency.

[0050] Figure 1 A flowchart of a storage partitioning method provided in an embodiment of the present application is applied to the application scenario of the above storage system, such as Figure 1 As shown, the method of this embodiment includes the following steps 110-130.

[0051] Step 110, obtaining a first number of robots in a usable state in the storage area;

[0052] Specifically, in actual applications, the robots in the storage system's warehouse area will inevitably be in a state of charging or maintenance, which will cause these robots to be unavailable during a certain period of time. Therefore, when dynamically partitioning according to the tasks to be executed, this application only obtains the first number of available robots within the target period, and excludes robots that are unusable within the target period, making the storage partitioning more reasonable, and the subsequent allocation of storage tasks more reasonable.

[0053] The target period may be the current moment, for example, obtaining the first number of available robots at the current moment to partition the warehouse immediately and assign tasks to the robots. Alternatively, the target period may be an interval period at a preset frequency, for example, dynamically obtaining the first number of available robots at a preset frequency to dynamically partition the warehouse at a preset frequency. Alternatively, the target period may also be a certain period in the future, for example, obtaining the first number of available robots in a certain period in the future according to the robot maintenance or charging plan to formulate warehouse partitions in advance.

[0054] Step 120, counting the load of tasks to be executed corresponding to each operation point in the storage area;

[0055] Specifically, each operation point includes spatial position information to mark its own spatial position in the physical aisle of the warehouse. Each operation point in the present application may correspond to a task load to be executed. For example, when there are tasks to be executed on the shelf column corresponding to the operation point (i.e., there are goods that need to be moved), the task load to be executed corresponding to the operation point is calculated based on the tasks to be executed corresponding to the operation point. Alternatively, when there are no tasks to be executed on the shelf column corresponding to the operation point, the task load to be executed corresponding to the operation point is determined to be 0, or the operation point has no corresponding task load to be executed.

[0056] Among them, the load of pending tasks is the number of pending tasks in the operation point or the time cost of pending tasks. The number of pending tasks can be understood as the number of all tasks that the robot needs to complete in the current operation point. The time cost of pending tasks can be understood as the time required for the robot to complete all tasks in the current operation point. If the load of pending tasks is the number of pending tasks, the load of pending tasks corresponding to each operation point in the storage area is counted, that is, the number of all pending tasks corresponding to each operation point in the storage area is counted. If the load of pending tasks is the time cost of pending tasks, the step of counting the load of pending tasks corresponding to each operation point in the storage area includes: determining the execution order of at least one pending task corresponding to the operation point, and then calculating the time cost of pending tasks corresponding to each operation point according to the height and execution order of each pending task.

[0057] Moreover, as new storage tasks are continuously put into use and old storage tasks are completed, when the present application counts the load of tasks to be executed corresponding to each operation point in the warehouse area, it can be consistent with the above-mentioned step 110, and dynamically count according to the preset frequency, so that the subsequent allocation of storage partitions and storage tasks can be more reasonable.

[0058] Step 130, dividing the plurality of physical lanes into a plurality of target sub-lanes according to the first number and the to-be-performed task load corresponding to each operation point;

[0059] Specifically, when all physical lanes in the warehouse area are divided, the number of physical lanes divided is equal to the first number of robots in the warehouse area that are in a usable state, so that the number of target sub-lanes obtained is the first number, and each target sub-lane corresponds to a robot that performs the task in the target sub-lane.

[0060] Moreover, when dividing the physical lanes, it is also necessary to make the operation points in the target sub-lane continuous and belong to the same physical lane according to the spatial position information of the operation points. This is because each target sub-lane corresponds to a robot. When a long physical lane is divided into multiple target sub-lanes, multiple robots in a long physical lane need to perform the box moving task in parallel, and the task routes of each robot do not interfere with each other and can be adjusted dynamically. Furthermore, the target sub-lanes belong to the same physical lane, which means that the robot does not need to cross lanes when performing the task corresponding to the target sub-lane, which is conducive to improving the efficiency of task execution.

[0061] The above determines the number of target sub-lanes divided and the position requirements of the operation points in the target sub-lanes. Under the position requirements and the first number requirements, in order to achieve a more reasonable "grouping" of the operation points in the physical lanes, the load of pending tasks between the target sub-lanes needs to be "as balanced as possible". Among them, the load of pending tasks for each operation point in the target sub-lane includes the total load of pending tasks at the corresponding positions on the shelves on both sides of the physical lane corresponding to the operation point.

[0062] Regarding the above-mentioned "balanced" load of pending tasks, this application measures whether the load of pending tasks between each target sub-lane is "as balanced as possible" according to the average load of pending tasks. The average load of pending tasks here is the ratio between the total load of pending tasks in the warehouse area and the first number.

[0063] When a physical lane includes at least two target sub-lanes, in order to ensure that the load of pending tasks between the target sub-lanes is "as balanced as possible", the first difference between the load of pending tasks corresponding to any two target sub-lanes in the same physical lane must be smaller than the average load of pending tasks, and the sum of the load of pending tasks corresponding to any two target sub-lanes in the same physical lane must be greater than the average load of pending tasks.

[0064] It can be understood that if the first difference between the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is not less than the average load of tasks to be executed, or the sum of the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is not greater than the average load of tasks to be executed, then the loads of tasks to be executed between the target sub-lanes in the same physical lane must be very different.

[0065] In a Figure 2 In the specific embodiment shown, for example, there are three rows of shelves in the warehouse, and two opposite shelves in the three rows of shelves form two physical lanes, namely "physical lane 1" and "physical lane 2", and each physical lane includes operation points corresponding to the goods on the shelves on both sides, such as "A1...J1, A2...J2" shown in the figure. Among them, the value of the task load to be executed corresponding to each operation point is as follows: Figure 2 As shown, the load of pending tasks at the operation point "A1" is "1", the load of pending tasks at the operation point "A2" is "8", and so on. Moreover, the first number of robots in the usable state in the warehouse obtained by statistics is "5", that is, the two physical lanes need to be divided into five target sub-lanes in total, and the total load of pending tasks of all operation points in the two physical lanes is "100", and the average load of pending tasks is "20". In "Division Scheme X", the division method belongs to the existing method of average division according to the length of physical lanes. In "Physical Lane 1", the values ​​of the task loads to be executed from the first target sub-lane to the third target sub-lane are "3", "13", and "36", respectively. It can be calculated that the first difference between the task loads to be executed corresponding to the first target sub-lane and the third target sub-lane is "33", and the first difference between the task loads to be executed corresponding to the second target sub-lane and the third target sub-lane is "23", both of which are greater than the average value of the task loads to be executed "20", and the sum of the task loads to be executed corresponding to the first target sub-lane and the second target sub-lane is "16", which is less than the average value of the task loads to be executed "20", which are all manifestations of "unbalanced" distribution of task loads. In "Division Scheme Y" and "Division Scheme Z", the above situation does not exist, and it can be regarded as a relatively "balanced" distribution of task loads.

[0066] In addition, when there is only one target sub-lane in a physical lane, the total load of tasks to be executed in the physical lane is less than twice the average load of tasks to be executed. It can be understood that if the total load of tasks to be executed in a physical lane is not less than twice the average load of tasks to be executed, then this physical lane should be divided into at least two target sub-lanes to achieve "balanced" distribution of task loads in the warehouse area.

[0067] The above descriptions of the cases where a physical lane contains only one target sub-lane and the cases where it contains multiple target sub-lanes are separate because the operation points in a target sub-lane must be continuous and belong to the same physical lane, in order to improve the robot's task execution efficiency. Figure 2 In the specific embodiment shown, the operation point "A1" in the "physical lane 1" and the operation point "A2" in the "physical lane 2" will not be merged into the same target sub-lane, so when allocating warehousing tasks, the task loads to be executed of the operation points "A1" and "A2" will not be combined for consideration.

[0068] More specifically, Figure 3 As shown, multiple physical lanes are divided into multiple target sub-lanes according to the first number and the to-be-performed task load corresponding to each operation point, including steps 310-330.

[0069] Step 310, converting the two-dimensional planes corresponding to the multiple physical lanes into a one-dimensional sequence;

[0070] Specifically, the physical lanes in the two-dimensional plane are connected end to end to convert the physical lanes into a one-dimensional sequence. The one-dimensional sequence includes the operation points in the physical lanes, and each operation point includes a physical lane identifier for representing each physical lane, and index information of the operation point for identifying the operation point itself, and the index information of the operation point may be, for example, an identification number of the operation point.

[0071] Step 320, dividing the one-dimensional sequence into at least two set schemes according to the to-be-executed task load corresponding to each operating point;

[0072] Specifically, it has been explained above that when the storage is partitioned, at least two allocation results may be obtained, and each allocation result includes a first number of target sub-lanes. Among them, one allocation result corresponds to a set scheme, and one target sub-lane corresponds to a set, that is, each set scheme includes a first number of sets. According to the physical lane identifier, the index information of the operation point and the value of the first number, the operation points in the one-dimensional sequence are correspondingly allocated to the first number of sets, so that the operation points in each target sub-lane are continuous and belong to the same physical lane.

[0073] Step 330, determining a target solution from at least two set solutions according to the optimization target;

[0074] Specifically, by formulating an optimization goal, an optimal target solution for indicating that multiple physical lanes are divided into multiple target sub-lanes can be determined from the obtained multiple set solutions. The optimization goal is to minimize the two-normal form cumulative sum of the second differences corresponding to the set solutions. Among them, the second difference is the difference between the total load of the tasks to be executed and the mean load of the tasks to be executed of each set in a set solution. The two-normal form cumulative sum of the second differences can be understood as: accumulating the two-normal form of the second differences of each set in a set solution. And determining the target solution in at least two set solutions according to the optimization goal can be understood as: in at least two set solutions, determining the solution with the smallest two-normal form cumulative sum of the second differences as the target solution.

[0075] As described above, there will be at least two set schemes for dividing a one-dimensional sequence, and each set scheme includes a first number of sets. When determining the scheme with the smallest two-paradigm cumulative sum of the second difference as the target scheme, it can be specifically as follows: first calculate the second difference between the total load of the tasks to be executed and the mean load of the tasks to be executed of each set in each set scheme, where the second difference is an absolute value, and then add up the second differences corresponding to each set to obtain the cumulative sum of each set scheme, and finally determine the set scheme with the smallest cumulative sum among at least two set schemes as the target scheme.

[0076] For example Figure 2 In the specific embodiment shown, "partitioning scheme Y" and "partitioning scheme Z" are two of the multiple set schemes, and a target sub-lane represents a set in a set scheme, and the average load of the tasks to be executed is "20". In "partitioning scheme Y", the total load of the tasks to be executed in each set of the set scheme is "10", "24", "18", "32", and "16", respectively, and the cumulative sum of the second differences of the set scheme is "32". In "partitioning scheme Z", the total load of the tasks to be executed in each set of the set scheme is "16", "18", "18", "24", and "24", respectively, and the cumulative sum of the second differences of the set scheme is "16". It can be seen that the cumulative sum of the second differences of "partitioning scheme Z" is less than the cumulative sum of the second differences of "partitioning scheme Y", so "partitioning scheme Z" is a better set scheme than "partitioning scheme Y". Moreover, compared with other unshown partitioning schemes that meet the requirements of the number of partitions and the position of the operating points, the cumulative sum of "partitioning scheme Z" is the smallest, so "partitioning scheme Z" is the target scheme.

[0077] In a specific embodiment, the above steps can be implemented using a dynamic programming algorithm (DP). The problem dealt with by dynamic programming is a multi-stage decision problem, starting from an initial state and reaching an end state through the selection of intermediate stage decisions. The specific framework of the dynamic programming algorithm includes steps such as defining states, initialization, and state transition equations, which can be specifically set as:

[0078] In the define state step, dp[n][j] is defined, where n is the first number, j is used to represent the division position in the one-dimensional sequence. As mentioned above, the one-dimensional sequence is composed of "operation points", so the elements of the one-dimensional sequence are "operation points", and dp[n][j] represents the minimum value of the cumulative sum of the second difference second normal form corresponding to when the j-th element of the one-dimensional sequence is divided into n sets.

[0079] In the initialization step, dp[n][j] is initialized to dp[1][j]. For all elements j, dp[1][j] represents the second normal form value of the second difference when the first j elements are taken as a set, that is:

[0080] dp[1][j]=(nums[:j]-averageNum)**2 (Formula 1).

[0081] Among them, nums[:j] represents the load of tasks to be executed in the collection, averageNum represents the average load of tasks to be executed, and **2 represents the power operation.

[0082] In the state transfer step, define the equation:

[0083] dp[n][j]=min{dp[n-1][ji]+cost(ji,j)|n-1<=i<=j} (Formula 2).

[0084] Among them, i represents the number of elements crossed when reaching the current state (dp[n][j]) from the state (dp[n-1][ji]), cost(ji,j) represents the transfer cost or price from position ji to position j, min{} represents the minimum value of the second normal form accumulation of the second difference, and the value of the end state can be obtained according to the state transfer equation, that is, a target solution is determined among multiple target solutions.

[0085] Here, reuse Figure 2 The specific embodiments shown summarize the warehouse partitioning process and results in this application.

[0086] Under the conditions that "the number of target sub-lanes is the first number" and "the operation points in the target sub-lanes are continuous and belong to the same physical lane", multiple schemes including "division scheme X", "division scheme Y", and "division scheme Z" can be obtained. Under the further condition that "the first difference between the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is less than the average load of tasks to be executed, and the sum of the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is greater than the average load of tasks to be executed", "division scheme X" is excluded, and the remaining schemes such as "division scheme Y" and "division scheme Z" that meet the above conditions are, therefore, the warehousing system can partition the physical lanes according to division scheme Y or division scheme Z. Further, under the condition of "determining the set scheme with the smallest cumulative sum in at least two set schemes as the target scheme", "division scheme Z" can be determined as the target scheme.

[0087] With respect to the above step 130, in another implementation, first, multiple physical lanes may be divided into multiple sub-lanes according to each operating point, and then, the divided multiple sub-lanes may be merged into multiple target sub-lanes according to the first number and the load of tasks to be performed corresponding to each operating point, so that the number of target sub-lanes is the first number. The operating points in the target sub-lanes are continuous and belong to the same physical lane. Specifically, the specific steps and principles of the process of "merging the divided multiple sub-lanes into multiple target sub-lanes according to the first number and the load of tasks to be performed corresponding to each operating point" can be referred to the description in steps 310-330, which will not be repeated here.

[0088] In addition, after executing step 130, a step of allocating a robot in each target sub-lane may be executed so that the robot performs a picking and placing task in the corresponding target sub-lane.

[0089] Through the warehouse partitioning method provided in this application, multiple physical lanes are reasonably divided into multiple target sub-lanes, so that the load of tasks to be executed in each target sub-lane is more balanced. Therefore, when the robot performs warehouse tasks, it can effectively avoid the robot's own long-distance picking and placing of goods and interference in the moving routes between robots, thereby balancing the warehouse tasks assigned to each robot and improving the robot's handling operation efficiency.

[0090] Figure 4 A schematic diagram of a storage partition device provided in one embodiment of the present application is shown in FIG. Figure 4 As shown, the device of this embodiment includes: an acquisition module 410, a statistics module 420 and a division module 430.

[0091] An acquisition module 410 is used to acquire a first number of robots in a usable state in a storage area;

[0092] A statistics module 420 is used to count the load of tasks to be executed corresponding to each operation point in the storage area, and the operation point includes spatial location information;

[0093] The division module 430 is used to divide multiple physical lanes into multiple target sub-lanes according to the first number and the load of pending tasks corresponding to each operation point, so that the number of target sub-lanes is the first number, and when a physical lane includes at least two target sub-lanes, the first difference between the loads of pending tasks corresponding to any two target sub-lanes in the same physical lane is less than the average load of pending tasks, and the sum of the loads of pending tasks corresponding to any two target sub-lanes in the same physical lane is greater than the average load of pending tasks, wherein the operation points in the target sub-lanes are continuous and belong to the same physical lane, and the average load of pending tasks is the ratio of the total load of pending tasks in the storage area to the first number.

[0094] Figure 5 A schematic diagram of the structure of an electronic device provided in one embodiment of the present application is shown in FIG. Figure 5 As shown, the electronic device 500 of this embodiment may include: a memory 501 and a processor 502 .

[0095] The processor 502 may be a central processing unit (CPU). , A CPU) or other form of processing unit with data processing capability and / or instruction execution capability, and can control other components in the electronic device 500 to perform desired functions.

[0096] The memory 501 may include one or more computer program products, and the computer program product may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may include, for example, a random access memory (RAM) and / or a cache memory (cache), etc. The non-volatile memory may include, for example, a read-only memory (ROM), a hard disk, a flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium, and the processor 502 may run the program instructions to implement the various embodiments of the present application described above and / or other desired functions. Various contents such as input signals, signal components, noise components, etc. may also be stored in the computer-readable storage medium.

[0097] In one example, the electronic device 500 may further include: an input device 503 and an output device 504 , and these components are interconnected via a bus system and / or other forms of connection mechanisms (not shown).

[0098] The input device 503 may include, for example, a keyboard, a mouse, etc.

[0099] The output device 504 can output various information to the outside, including the determined distance information, direction information, etc. The output device 504 can include, for example, a display, a speaker, a printer, a communication network and a remote output device connected thereto, and the like.

[0100] Of course, to simplify, Figure 5 Only some of the components related to the present application in the electronic device 500 are shown, and components such as a bus, an input / output interface, etc. are omitted. In addition, according to specific application situations, the electronic device 500 may also include any other appropriate components.

[0101] The present application also proposes a warehousing system, comprising: shelves, storage lanes arranged next to the shelves, robots that carry goods in the shelves in the storage lanes, and the above-mentioned electronic equipment for controlling the robots to carry out the carrying operations.

[0102] The other preferred embodiments, specific descriptions, technical problems that can be solved, and effects that can be brought about by the storage partition device, electronic device, and storage system disclosed in this application are the same as the above-mentioned storage partition method, and will not be repeated here. In addition, this application also provides a computer-readable storage medium, on which computer program instructions are stored, and when the computer program instructions are executed by a processor, the processor executes the steps in the various embodiments of the method according to the present application described in the above-mentioned "Exemplary Method" section of this specification.

[0103] The computer readable storage medium can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can include, for example, but is not limited to, a system, device or device of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, 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.

[0104] In addition to the above-mentioned methods, apparatuses, devices and media, the present application also provides a computer program product, which includes computer program instructions, which, when executed by a processor, enable the processor to execute the steps of the methods according to various embodiments of the present application described in the above-mentioned "Exemplary Methods" section of this specification.

[0105] The computer program product may be written in any combination of one or more programming languages ​​to execute program codes for the method of the embodiment of the present application, wherein the programming languages ​​include object-oriented programming languages, such as Java, C++, etc., and conventional procedural programming languages, such as "C" language or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user computing device, as an independent software package, partially on the user computing device and partially on the remote computing device, or entirely on the remote computing device or server.

[0106] The preferred embodiments of the present application are described in detail above; however, the present application is not limited to the specific details in the above embodiments. Within the technical concept of the present application, a variety of simple modifications can be made to the technical solution of the present application, and these simple modifications all fall within the protection scope of the present application.

[0107] It should also be noted that the various specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction. In order to avoid unnecessary repetition, this application will not further describe various possible combinations.

[0108] In addition, the various implementation modes of the present application may be arbitrarily combined, and as long as they do not violate the concept of the present application, they should also be regarded as the contents disclosed by the present invention.

Claims

1. A storage partitioning method, It is characterized in that The method is applied to a storage system, the storage system includes a plurality of physical lanes, and the method includes: Obtaining a first number of robots in a usable state in the storage area; Counting the load of tasks to be executed corresponding to each operation point in the storage area, wherein the operation point includes spatial location information; The multiple physical lanes are divided into multiple target sub-lanes according to the first number and the load of tasks to be executed corresponding to each operating point, so that the number of target sub-lanes is the first number, and when a physical lane includes at least two target sub-lanes, the first difference between the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is less than the average load of tasks to be executed, and the sum of the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is greater than the average load of tasks to be executed, wherein the operating points in the target sub-lanes are continuous and belong to the same physical lane, and the average load of tasks to be executed is the ratio of the total load of tasks to be executed in the storage area to the first number.

2. The method according to claim 1, It is characterized in that When there is only one target sub-lane in a physical lane, the total load of tasks to be executed in the physical lane is less than twice the average load of the tasks to be executed.

3. The method according to claim 1, It is characterized in that The load of tasks to be executed is the number of tasks to be executed or the time cost of tasks to be executed.

4. The method according to claim 3, It is characterized in that The load of tasks to be executed includes the time cost of the tasks to be executed, and the statistics of the load of tasks to be executed corresponding to each operation point in the storage area include: Determine the execution order of at least one task to be executed corresponding to the operation point; The time cost of the task to be executed corresponding to each operation point is calculated according to the height of each task to be executed and the execution order.

5. The method according to claim 1, It is characterized in that The dividing the plurality of physical lanes into a plurality of target sub-lanes according to the first number and the to-be-performed task load corresponding to each operation point includes: Converting the two-dimensional planes corresponding to the multiple physical lanes into a one-dimensional sequence, wherein each operation point in the one-dimensional sequence includes a physical lane identifier and index information of the operation point; Dividing the one-dimensional sequence into at least two set schemes according to the to-be-executed task load corresponding to each operating point, each set scheme includes the first number of sets, wherein the operating points in each set in each set scheme are continuous and belong to the same physical lane; A target solution in the at least two set solutions is determined according to an optimization target, and the target solution is used to indicate dividing the multiple physical lanes into the multiple target sub-lanes.

6. The method according to claim 5, It is characterized in that The optimization goal is to minimize the two-normal form cumulative sum of the second difference values ​​corresponding to the set scheme, wherein the second difference value is the difference between the total load of the tasks to be executed of each set in the set scheme and the mean load of the tasks to be executed.

7. The method according to claim 5 or 6, It is characterized in that Determining a target solution among the at least two set solutions according to the optimization target includes: Calculating a second difference between the total load of tasks to be executed in each set in the set scheme and the mean load of the tasks to be executed; Accumulate the second difference value corresponding to each set in the set solution to obtain an accumulated sum; The set solution with the smallest cumulative sum among the at least two set solutions is determined as the target solution.

8. The method according to claim 1, It is characterized in that The dividing the plurality of physical lanes into a plurality of target sub-lanes according to the first number and the to-be-performed task load corresponding to each operation point includes: Dividing the plurality of physical lanes into a plurality of sub-lanes according to each operation point; The divided multiple sub-lanes are merged into the multiple target sub-lanes according to the first number and the to-be-executed task load corresponding to each operation point, so that the number of the target sub-lanes is the first number, wherein the operation points in the target sub-lanes are continuous and belong to the same physical lane.

9. The method according to any one of claims 1 to 8, It is characterized in that After dividing the plurality of physical lanes into a plurality of target sub-lanes according to the first number and the to-be-performed task load corresponding to each operation point, the method further includes: One of the robots is allocated in each of the target sub-lanes, so that the robot performs the task of picking up and placing goods in the corresponding target sub-lane.

10. A storage partition device, It is characterized in that The device is applied to a storage system, the storage system includes a plurality of physical lanes, and the device includes: An acquisition module, used for acquiring a first number of robots in a usable state in a storage area; A statistics module, used to count the load of tasks to be executed corresponding to each operation point in the storage area, wherein the operation point includes spatial location information; A division module is used to divide the multiple physical lanes into multiple target sub-lanes according to the first number and the load of tasks to be executed corresponding to each operation point, so that the number of the target sub-lanes is the first number, and when a physical lane includes at least two target sub-lanes, the first difference between the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is less than the average load of tasks to be executed, and the sum of the loads of tasks to be executed corresponding to any two target sub-lanes in the same physical lane is greater than the average load of tasks to be executed, wherein the operation points in the target sub-lanes are continuous and belong to the same physical lane, and the average load of tasks to be executed is the ratio of the total load of tasks to be executed in the storage area to the first number.

11. An electronic device, It is characterized in that include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 9.

12. A storage system, It is characterized in that The system includes: a robot, an electronic device as described in claim 11, and a plurality of rows of shelves arranged in a storage area, wherein a physical lane is formed relative to two rows of the shelves, and the electronic device is used to control the robot to perform handling operations in the physical lane, and the robot moves in the physical lane and carries goods in the shelves on both sides of the physical lane.

13. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores computer-executable instructions. When a processor executes the computer-executable instructions, the method according to any one of claims 1 to 9 is implemented.

14. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

Citation Information

Patent Citations

  • Three-dimensional warehouse management method and device, electronic equipment and computer readable storage medium

    CN114022088A

  • Storage system control method, device and equipment and computer readable storage medium

    CN114595907A

  • Goods allocation allocation optimization method for multi-roadway stereoscopic warehouse

    CN115303689A

  • Goods warehouse-in and warehouse-out method and device and electronic equipment

    CN116534471A

  • Warehouse for storing goods, warehousing method, device, equipment and medium

    CN116692342A

Cited By

  • Warehouse zoning method and apparatus, and device and warehousing system

    WO2026066750A1