CN115293680A - Warehouse management method, electronic device and storage medium - Google Patents

Abstract

The embodiment of the application provides a warehouse management method, electronic equipment and a storage medium, wherein the method comprises the following steps: performing a first sorting operation on a target container set in a target roadway in a target warehouse so that the distribution of the target container set reaches a target distribution, wherein when the distribution of the target container set reaches the target distribution, for any one sub-container set in the target container set, the sub-container set is distributed on a plurality of continuous warehouse positions in the target roadway; and sequentially carrying out ex-warehouse operation on each sub-container set in the target container set according to the target sequence, wherein the ex-warehouse operation comprises the following steps: and sequentially unloading each container in the sub-container set according to the order of the containers in the sub-container set.

Description

Warehouse management method, electronic device and storage medium

technical field

The application relates to the field of logistics, in particular to a warehouse management method, electronic equipment and a storage medium.

Background technique

The outbound link of containers such as pallets for loading goods is a basic link in the management of warehouses such as intensive storage. The outbound link of the container includes: dispatching the robot to move the corresponding container from the corresponding storage location in the corresponding lane to the corresponding warehouse outlet of the lane; loading the corresponding container to the truck parked at the outlet of the corresponding lane superior.

In the outbound link of containers, it is sometimes necessary to stack containers composed of multiple associated containers on corresponding trucks. Centralized stacking of container sets on trucks means that there is no difference between any two containers in the container set. There are other containers, which requires that for any container set, each container included in the container set is sequentially released from the warehouse, so that each container included in the container set arrives at the corresponding exit port in turn. The container set includes Each container is loaded onto the corresponding truck in turn, and the containers are collectively stacked on the corresponding truck.

However, for any container set, when any container of the container set is outbound, if there are other containers between the warehouse location where the container is located and the outbound port, since the other containers will block the For a container, other containers need to be taken out first so as not to block the container, and then the container can be released from the warehouse. For each container set in a large number of container sets, it involves taking out a certain number of other containers that hinder the container being out of the warehouse during the outbound process, and waiting for a long time to load the corresponding container on the truck, resulting in low efficiency.

Contents of the invention

In order to overcome the problems existing in the related technologies, the application provides a warehouse management method, electronic equipment and storage media.

According to an embodiment of the present application, a warehouse management method is provided, including:

performing a first sorting operation on the target container set in the target lane in the target warehouse, so that the distribution of the target container set reaches the target distribution, wherein, when the distribution of the target container set reaches the target distribution, for the target container set Any set of sub-containers in the sub-container set, which is distributed on a plurality of continuous storage locations in the target lane;

Carry out an outbound operation for each sub-container set in the target container set in sequence according to the target order, and the outbound operation includes: sequentially unloading the sub-container sets in the sub-container set according to the order of the containers in the sub-container set Each container is shipped out.

An embodiment of the present application provides an electronic device, including: a memory, a processor, and a computer program stored on the memory, and the processor executes the computer program to implement the above warehouse management method.

An embodiment of the present application provides a computer-readable storage medium on which a computer program/instruction is stored, and when the computer program/instruction is executed by a processor, the above-mentioned warehouse management method is realized.

An embodiment of the present application provides a computer program product, including a computer program/instruction, and when the computer program/instruction is executed by a processor, the above warehouse management method is implemented.

In the warehouse management method provided by the embodiment of the present application, before the target container set is released from the warehouse, the first sorting operation is performed on the target container set in the target lane in the target warehouse. Through the first sorting operation, the target container set Any set of sub-containers in the target lane, all containers belonging to the set of sub-containers in the target lane are distributed on multiple continuous storage locations in the target lane. The outbound operation is sequentially performed on each sub-container set in the target container set according to the target order, and the outbound operation includes: performing outbound operation on each container in the sub-container set in sequence. For the first container in the target container set, that is, the first container in the first sub-container set defined by the target order, before this container, there is no other container blocking this container, and it can be used without moving other containers Next, the container is directly out of the warehouse. For each container after the first container, when the container is out of the warehouse, the previous container of the container has already been out of the warehouse. Before this container, there is no obstacle The other containers of the container can be directly released from the warehouse without moving other containers. When the target container set is loaded out of the warehouse, each container in the target container set is directly loaded out of the warehouse, and the warehouse out efficiency is high.

Description of drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description serve to explain the principles of the application.

Fig. 1 shows the flowchart of the warehouse management method provided by the embodiment of the present application;

Fig. 2 shows a structural block diagram of a warehouse management device provided by an embodiment of the present application.

Detailed ways

The application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain related inventions, rather than to limit the invention. It should also be noted that, for the convenience of description, only the parts related to the related invention are shown in the drawings.

It should be noted that, in the case of no conflict, the embodiments in the present application and the features in the embodiments can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and embodiments.

With the development of intelligent technologies such as the Internet of Things, artificial intelligence, and big data, the demand for using these intelligent technologies to transform and upgrade the traditional logistics industry has become increasingly strong, and intelligent logistics (Intelligent Logistics System) has become a research hotspot in the field of logistics. Smart logistics uses artificial intelligence, big data, various information sensors, radio frequency identification technology, global positioning system (GPS) and other Internet of Things devices and technologies, and is widely used in basic logistics such as material transportation, warehousing, distribution, packaging, loading and unloading, and information services. The activity link realizes the intelligent analysis and decision-making, automatic operation and high-efficiency optimized management of the material management process. The Internet of Things technology includes sensing equipment, RFID technology, laser infrared scanning, infrared induction recognition, etc. The Internet of Things can effectively connect the materials in the logistics with the network, monitor the materials in real time, and sense the humidity and temperature of the warehouse. Data, guarantee the storage environment of materials. Through big data technology, all the data in the logistics can be sensed and collected, uploaded to the data layer of the information platform, and the data can be filtered, mined, analyzed and other operations, and finally the business process (such as transportation, storage, access, picking, packaging, distribution Picking, delivery, inventory, distribution and other links) to provide accurate data support. The application direction of artificial intelligence in logistics can be roughly divided into two types: 1) Unmanned trucks, AGVs, AMRs, forklifts, shuttles, stackers, unmanned delivery vehicles, unmanned aerial vehicles, Smart devices such as service robots, robotic arms, and smart terminals replace part of the labor force; 2) Software such as transportation equipment management systems, warehouse management, equipment scheduling systems, and order distribution systems driven by computer vision, machine learning, and operational optimization technologies or algorithms The system improves labor efficiency. With the research and progress of smart logistics, this technology has been applied in many fields, such as retail and e-commerce, electronic products, tobacco, medicine, industrial manufacturing, shoes and clothing, textiles, food and other fields.

Fig. 1 shows the flowchart of the warehouse management method provided by the embodiment of the present application, the method includes:

Step 101, perform a first sorting operation on the target container set in the target lane.

In this application, the target warehouse may be a dense storage warehouse. The containers used to load the goods in the target warehouse can come from the corresponding warehouse. The target warehouse can be a warehouse dedicated to storing containers, or a cache warehouse of the corresponding warehouse.

In this application, the container may be a pallet, and one storage location in the target lane may store one container. A target container collection is composed of multiple subcontainer collections.

A collection of subcontainers includes associated multiple containers. For example, the set of sub-containers is a plurality of containers used to hold items required by an item order line in an item order or a plurality of containers used to hold items required by an item order.

In this application, the first sorting operation is used to make the distribution of the containers in the target container set reach the target distribution. When the distribution of the containers in the target container set reaches the target distribution, for any sub-container set in the target container set, All containers belonging to the sub-container set in the target lane are distributed on multiple consecutive storage locations in the target lane, and the order of the sub-container sets is the target order.

In the present application, each of the two sides of the target roadway has an entrance and exit. The robot outside the lane enters the target lane through the corresponding entrance and exit, and the robot inside the lane can drive out of the target lane through the corresponding entrance and exit.

The entrance and exit on one side of the target roadway is used as the warehouse exit of the target roadway, the serial number of the i-th storage location in the target roadway is i, and the i-th storage location in the target roadway is relative to the warehouse exit of the target roadway .

For example, there are n storage locations in the target aisle, the first storage location in the target aisle is the storage location closest to the exit of the target aisle, and the nth storage location in the target aisle is the storage location with the target aisle The location with the farthest distance from the port.

If the number of sub-container sets included in the target container set is denoted as n, the target sequence defines the first sub-container set, the second sub-container set...the n-th sub-container set.

In this application, the target order of the sub-container sets in the target container set can be set by the operation and maintenance engineer of the warehouse management system where the warehouse management method provided in the embodiment of the application is applied, or can be set according to the parameters used for sorting of the sub-container sets Sure.

For example, the sorting parameter of the sub-container set is the distance between the container with the closest distance to the exit port of the target aisle in the sub-container set and the exit port of the target aisle. For example, the parameter used for sorting the sub-container set is the average distance between the containers in the sub-container set and the outlet of the target lane. All sub-container sets in the target container set may be sorted according to the sorting parameters of the sub-container sets from low to high to obtain the target order.

In the present application, after the target sequence of the sub-container sets is determined, the location sequence of each sub-container set in the target container set may be determined.

For any location sequence of a sub-container set, the location sequence of the sub-container set consists of multiple consecutive locations, and the number of locations in the location sequence of the sub-container set is equal to the number of containers in the sub-container set quantity.

For the location sequence of any sub-container set, the first location in the location sequence is the closest location to the outlet of the target lane among all the locations in the location sequence, and the location sequence The last storage location in is the storage location farthest from the exit of the target lane among all the storage locations in the storage location sequence.

For the first subcontainer set defined by the target order, the first logistics location in the location sequence of the first subcontainer set is the first logistics location in the target aisle.

For any other sub-container set defined by the target sequence, the last location in the location sequence of the previous sub-container set of the other sub-container set is the mth location, and the location sequence of the other sub-container set is The first storage location is the m+1th storage location, the other sub-container set is a sub-container set that is not the first sub-container set defined by the target order, and the previous sub-container set of the other sub-container set is determined by the target sequence definition.

In the present application, the first sorting operation may include: performing the first sorting sub-operation on each sub-container set based on the location sequence of each sub-container set.

For any storage location in the storage location sequence of any sub-container set, if the storage location is not occupied by the corresponding container in the sub-container set, the storage location is an allocable storage location.

For any set of sub-containers, the first sorting sub-operation for the set of sub-containers may include: determining whether there are containers that need to be moved for the set of sub-containers and the target order, and containers that need to be moved for the set of sub-containers and the target order The container belongs to the sub-container set and the storage location of the container that needs to be moved is not in the location sequence of the sub-container set; if so, for each container that needs to be moved for the sub-container set and target order, random Select an allocatable location from all the allocatable locations in the location sequence of the sub-container set, and assign the selected one to the container that needs to be moved; if a container that does not belong to the sub-container set is placed On the distributable warehouse location assigned to the container that needs to be moved, the control robot, such as a four-way shuttle, takes out the container that does not belong to the sub-container set from the distributable warehouse location assigned to the container that needs to be moved, and the control robot takes the The container that needs to be moved is taken out from the storage location where the container needs to be moved, the allocatable location allocated to the container that needs to be moved is recorded as location i, and the location where the container that needs to be moved is recorded as location j; The container to be moved is placed on location i, and the container that does not belong to the sub-container set is placed on location j.

In step 102, each sub-container set in the target container set is sequentially unloaded according to the target sequence.

For any sub-container set, the outbound operation of the sub-container set includes: according to the order of the containers in the sub-container set, each container in the sub-container set is unloaded sequentially

The order of the containers in the sub-container set can be obtained by sorting all the containers in the sub-container set according to the sequence numbers of the storage locations where the containers are located.

For any storage location in the target aisle, the serial number of the storage location indicates the position of the storage location in all storage locations in the target aisle, and the storage location with serial number i is the i-th of all storage locations in the target aisle location.

For any container, carrying out the storage of the container may include: transporting the container to the storage opening of the target roadway; loading the container on a corresponding truck parked at the storage opening of the target roadway.

For example, the target container set includes: sub-container set 1 , sub-container set 2 , and sub-container set 3 . The first sub-container set defined by the target sequence is sub-container set 1, the second sub-container set defined by the target sequence is sub-container set 2, and the third sub-container set defined by the target sequence is sub-container set 3.

The sub-container set 1 includes: container 1, container 2, and container 3. The first container defined by the order of the containers in the sub-container set 1 is container 1, and the second container defined by the order of the containers in the sub-container set 1 is Container 2, the third container defined by the order of the containers in sub-container set 1 is container 3. Container 1, container 2, and container 3 are distributed in multiple continuous storage locations in the target lane, and the multiple continuous storage locations are composed of the first storage location, the second storage location, and the third storage location. 1 is on location 1, container 2 is on location 2, and container 3 is on location 3.

The sub-container set 2 includes: container 4, container 5, and container 6. The first container defined by the order of the containers in the sub-container set 2 is container 4, and the second container defined by the order of the containers in the sub-container set 2 is Container 5, the third container defined by the order of the containers in sub-container set 2 is container 6. Container 4, container 5, and container 6 are distributed on multiple continuous storage locations in the target lane, and the multiple continuous storage locations are composed of the 4th storage location, the 5th storage location, and the 6th storage location. 4 is on location 4, container 5 is on location 5, and container 6 is on location 6.

The sub-container set 3 includes: container 7, container 8, and container 9. The first container defined by the order of the containers in the sub-container set 3 is container 7, and the second container defined by the order of the containers in the sub-container set 3 is Container 8, the third container defined by the order of the containers in sub-container set 3 is container 9. Container 7, container 8, and container 9 are distributed on multiple continuous storage locations in the target lane, and the multiple continuous storage locations are composed of the 7th storage location, the 8th storage location, and the 9th storage location. 7 is on the 7th location, container 8 is on the 8th location, and container 9 is on the 9th location.

First, the sub-container set 1 is unloaded, then the sub-container set 2 is unloaded, and finally the sub-container set 3 is unloaded.

When the sub-container set 1 is out of the warehouse, container 1, container 2, and container 3 are out of the warehouse in sequence. First, container 1 is out of the warehouse, then container 2 is out of the warehouse, and finally container 3 is out of the warehouse. , container 1, container 2, and container 3 arrive at the outlet in sequence, and container 1, container 2, and container 3 are sequentially loaded onto the corresponding trucks that stop at the outlet of the target roadway. On the corresponding trucks, containers 1, Containers 2 and 3 are stacked together, that is, there are no containers belonging to other sub-container sets between any two containers in sub-container set 1.

When the sub-container set 2 is out of the warehouse, the container 4, the container 5, and the container 6 are out of the warehouse in sequence. First, the container 4 is out of the warehouse, then the container 5 is out of the warehouse, and finally the container 6 is out of the warehouse. , the container 4, the container 5, and the container 6 arrive at the outlet in turn, and the container 4, the container 5, and the container 6 are sequentially loaded onto the corresponding trucks at the outlet of the target roadway, and on the corresponding trucks, the containers 4, The containers 5 and 6 are stacked together, that is, there are no containers belonging to other sub-container sets between any two containers in the sub-container set 2 .

When the sub-container set 3 is out of the warehouse, the container 7, the container 8, and the container 9 are out of the warehouse in sequence. First, the container 7 is out of the warehouse, then the container 8 is out of the warehouse, and finally the container 9 is out of the warehouse. , the container 7, the container 8, and the container 9 arrive at the outbound port successively, and the container 7, the container 8, and the container 9 are sequentially loaded onto corresponding trucks at the outbound port of the stop target roadway, and on the corresponding truck, the device 7, The containers 8 and 9 are stacked together, that is, there are no containers belonging to other sub-container sets between any two containers in the sub-container set 3 .

In this application, before the target container set is shipped out, the first sorting operation is performed on the target container set in the target lane in the target warehouse. Through the first sorting operation, for any sub-container in the target container set A set, all containers belonging to the sub-container set in the target lane are distributed on multiple continuous storage locations in the target lane. The outbound operation is sequentially performed on each sub-container set in the target container set according to the target order, and the outbound operation includes: performing outbound operation on each container in the sub-container set in sequence. For the first container in the target container set, that is, the first container in the first sub-container set defined by the target order, before this container, there is no other container blocking this container, and it can be used without moving other containers Next, the container is directly out of the warehouse. For each container after the first container, when the container is out of the warehouse, the previous container of the container has already been out of the warehouse. Before this container, there is no obstacle The other containers of the container can be directly released from the warehouse without moving other containers. When the target container set is loaded out of the warehouse, each container in the target container set is directly loaded out of the warehouse, and the warehouse out efficiency is high.

In some embodiments, it further includes: calculating a moving amount of each candidate distribution among the plurality of candidate distributions, wherein the moving amount of the candidate distribution indicates that when the second sorting operation related to the candidate distribution is performed on the target container set, The number of containers that need to be moved in the target container set, and the second sorting operation related to the candidate distribution is used to make the distribution of the containers in the target container set reach the candidate distribution; the candidate distribution with the smallest amount of movement is determined as the target distributed.

Each candidate distribution of the plurality of candidate distributions has a candidate order. Candidate orders are possible orders of subcontainer sets in the target container set.

For example, the target container set includes: sub-container set 1 , sub-container set 2 , and sub-container set 3 . There are 6 candidates in total.

The candidate order of candidate distribution 1 is: sub-container set 1, sub-container set 2, and sub-container set 3, that is, the first sub-container set is sub-container set 1, the second sub-container set is sub-container set 2, and the third sub-container set is The collection is subcontainer collection 3.

The candidate order of candidate distribution 2 is: sub-container set 1, sub-container set 3, and sub-container set 2.

The candidate order of candidate distribution 3 is: sub-container set 2, sub-container set 1, and sub-container set 3.

The candidate order of candidate distribution 4 is: sub-container set 2, sub-container set 3, and sub-container set 1.

The candidate order of the candidate distribution 5 is: sub-container set 3, sub-container set 1, and sub-container set 3.

The candidate order of candidate distribution 3 is: sub-container set 3 , sub-container set 2 , and sub-container set 1 .

For any candidate distribution, when the distribution of containers in the target container set reaches the candidate distribution, for any sub-container set, all containers belonging to the sub-container set in the target lane are distributed on multiple consecutive locations in the target lane And the order of the sub-container set is the candidate order of the candidate distribution.

For any candidate distribution, the second sorting operation related to the candidate distribution may include: determining the location sequence of each sub-container set for the candidate order of the candidate distribution; For the location sequence, perform the second sorting sub-operation on each sub-container set for the candidate sequence.

For the first sub-container set defined by any candidate sequence, the first storage location in the location sequence of the first sub-container set is the first storage location in the target lane.

For any other sub-container set defined by any candidate order, the last location in the location sequence of the previous sub-container set of the other sub-container set is the mth location, and the location of the other sub-container set The first storage location in the sequence is the m+1th storage location, the other sub-container set is a sub-container set that is not the first sub-container set defined in the candidate sequence, and the previous sub-container set of the other sub-container set Sets are defined by this candidate order.

For any candidate order and any sub-container set, the second sorting sub-operation for the candidate order of the sub-container set may include: determining whether there is a container that needs to be moved for the sub-container set and the candidate order, for The sub-container set and the container to be moved of the candidate sequence belong to the sub-container set and the location of the container to be moved for the sub-container set and the candidate sequence is not in the location sequence of the sub-container set for the candidate sequence If so, for each container that needs to be moved for the sub-container set and the candidate order, randomly select an allocatable location from all the available locations in the sequence of the sub-container set, and select An allocatable storage location of the container that needs to be moved is allocated to the container that needs to be moved; if a container that does not belong to the sub-container set is placed on the allocatable storage location assigned to the container that needs to be moved, the control robot such as a four-way shuttle will The container that does not belong to the sub-container set is taken out, and at the same time, the control robot will take out the container that needs to be moved, and place the container that does not belong to the sub-container set on the location where the container that needs to be moved is located. The container to be moved is placed on the allocatable storage location assigned to the container to be moved.

In this application, for any sub-container set, the number of containers that need to be moved for the sub-container set and the candidate order may be used as the moving amount of the sub-container set for the candidate order.

The sum of the moving amounts of each sub-container set for the candidate order may be determined as the moving amount of the candidate order.

In the present application, the movement amount of each candidate distribution among multiple candidate distributions can be calculated, and the candidate distribution with the smallest movement amount is determined as the target distribution, which can make the number of containers that need to be moved the least in order to achieve the target distribution, save resources.

In some embodiments, it also includes: based on the number of containers in the set of containers to be put into storage, and the number of remaining storage locations in each of the multiple lanes of the target warehouse, determining the corresponding lane of the set of containers to be put into storage, wherein, The corresponding aisle of the set of containers to be put into storage is used for storing at least a part of the set of containers to be put into storage.

The target warehouse may include multiple floors, and the multiple lanes of the target warehouse may come from the same floor, and the multiple lanes of the target warehouse may refer to all the lanes in the floors from which the multiple lanes come. The floors where the multiple lanes of the target warehouse come from may be randomly selected from the multiple floors of the target warehouse by the warehouse management system where the warehouse management method provided in the embodiment of the present application is applied.

For any storage location, if there is no corresponding container on the storage location and the storage location is not allocated to the corresponding container, the storage location is a remaining storage location.

For any one of the multiple lanes of the target warehouse, the number of remaining storage locations in this lane can be expressed as: the number of remaining storage locations in this lane=the number of storage locations in this lane-the number of occupied storage locations in this lane Quantity - The quantity of the second container in this lane. For any location, if there is a container on the location, then the location is an occupied location. The second container is a container that is in the corresponding lane and waiting to be placed onto the corresponding location of the second container.

When there is currently an aisle that can store a set of containers to be put into storage in the plurality of aisles, if yes, the target first aisle with the least number of remaining storage locations among all the target first aisles in the plurality of aisles may be determined as the waiting to be put in The lanes corresponding to the storage container sets, and the corresponding lanes of the storage container sets can store the storage container sets. When there is currently no laneway that can store the set of containers to be put into storage in the multiple lanes, the laneway with the most remaining storage positions among the multiple lanes is determined as the corresponding laneway of the set of containers to be put into storage, and the set of containers to be put into storage The corresponding aisle can store containers of the number of remaining storage locations of the corresponding aisle in the set of containers to be put into storage.

In this application, based on the number of containers in the set of containers to be put into storage, and the number of remaining locations in each of the multiple lanes of the target warehouse, the corresponding lanes of the set of containers to be put into storage are determined. The corresponding lanes of the set, comprehensively consider the factors related to whether the lanes are suitable as the corresponding lanes of the set of containers to be stored, that is, the number of containers in the set of containers to be put into storage, the remaining number of lanes in each of the multiple lanes of the target warehouse The number of storage locations determines the laneway that is more suitable as the corresponding laneway for the collection of containers to be put into storage.

In some embodiments, based on the number of containers in the set of containers to be put into storage, and the number of remaining storage spaces in each of the multiple lanes of the target warehouse, determining the corresponding aisle of the set of containers to be put into storage includes: When the first container in the storage container set is put into storage and the first lane currently exists in the multiple lanes, based on the number of containers in the storage container set, the remaining location of each lane in the multiple lanes of the target warehouse Quantity, from all the first lanes in the plurality of lanes, determine the corresponding lane of the set of containers to be put into storage, wherein, for any container in the first lane, the container in the first lane of the container On the corresponding storage location; when the first container in the set of containers to be put into storage is put into storage, and the first aisle does not currently exist in the multiple aisles and the second aisle currently exists in the multiple aisles, based on the set of containers to be put into storage The number of containers in the target warehouse, the number of remaining storage locations in each of the multiple lanes of the target warehouse, and determine the corresponding lanes of the collection of containers to be stored from all the second lanes in the multiple lanes, wherein the second lane There is a second container in the corresponding lane, and the second container is a container that is in the corresponding lane and waiting to be placed on the corresponding storage location of the second container.

In this application, the container in the set of containers to be put into storage may be referred to as the first container. When the first container in the set of containers to be put into storage is put into storage and there is currently a first lane in the multiple lanes, if there is currently a first lane in the multiple lanes that can store the set of containers to be put into storage, it can store the set of containers to be put into storage. The first lane of the storage container set is greater than or equal to the number of first containers in the storage container set, and the corresponding lane of the storage storage container set can be randomly selected from all the first lanes that can store the storage container collection. If there is currently no first lane capable of storing the set of containers to be put into storage among the multiple lanes, a lane corresponding to the set of containers to be put into storage may be randomly selected from all first lanes.

When the first container in the set of containers to be put into storage is put into storage, and the first lane does not currently exist in the multiple lanes and the second lane currently exists in the multiple lanes, from all the second lanes in the multiple lanes Determine the corresponding aisle for the set of containers to be put into storage. If there is currently a second aisle that can store the set of containers to be put into storage in multiple lanes, the second aisle that can store the set of containers to be put into storage is greater than or equal to that of the set of containers to be put into storage. The quantity of the first container, the corresponding aisle of the set of containers to be stored can be randomly selected from all the second aisles that can store the set of containers to be put into storage. For the second lane, the lane corresponding to the set of containers to be put into storage can be randomly selected from all the second lanes.

In this application, when the first container in the set of containers to be put into storage is put into storage and the first lane currently exists in the multiple lanes, the container to be put into storage can be determined from all the first lanes in the multiple lanes The corresponding aisle of the collection, the first aisle is preferentially determined as the corresponding aisle of the collection of storage containers. There is no second container in the first lane, and correspondingly, there is no other robot currently placing the corresponding second container into the corresponding storage location in the first lane, which is used to place the first container in the collection of storage containers The robot placed in the corresponding storage location will not be blocked by other robots. When the corresponding lanes of the collection of containers to be stored are determined from all the first lanes in the multiple lanes, the storage of the collection of containers to be stored can be completed quickly. The storage efficiency of at least part of the first containers is relatively high.

In some embodiments, based on the number of containers in the set of containers to be put into storage, and the number of remaining storage spaces in each of the multiple lanes of the target warehouse, it is determined from all the first lanes in the multiple lanes that the waiting to be put in is determined. The corresponding aisle of the storage container set includes: when there is currently a target first aisle among the plurality of aisles, determining the target first aisle with the least number of remaining storage positions among all the target first aisles among the plurality of aisles as the waiting-to-enter The corresponding aisle of the storage container set, wherein, the target first aisle is the first aisle with the number of remaining storage locations greater than or equal to the number of the first containers in the storage container set; when the target first aisle does not currently exist in the plurality of aisles And when the first lane with the largest number of remaining storage locations among all the first lanes among the plurality of lanes can be allocated to the set of containers to be put into storage, the first lane with the largest number of remaining storage locations is determined as the first lane with the largest number of remaining storage locations to be put into storage Corresponding lanes for collections of containers.

When there is currently a target first lane among the plurality of lanes, the target first lane with the least number of remaining storage locations among all the target first lanes among the multiple lanes is determined as the corresponding lane of the container set to be put into storage, with The target first aisle with the least number of remaining storage locations can store the collection of containers to be put into storage.

When the target first lane does not currently exist in the multiple lanes and the first lane with the largest number of remaining storage locations among all the first lanes among the multiple lanes can be allocated to the set of containers to be put into storage, the remaining warehouse that will have The first aisle with the largest number of slots is determined as the corresponding aisle of the set of containers to be put into storage, and the corresponding aisle of the set of containers to be put into storage can store the first containers of the number of remaining locations of the corresponding aisle in the set of containers to be put into storage.

In the present application, when there is currently a target first lane among the multiple lanes, the target first lane with the least number of remaining storage locations among all the target first lanes among the multiple lanes is determined as the set of containers to be put into storage The corresponding lanes can make all the first containers in the set of containers to be put into the warehouse into the warehouse, and it is impossible to start the warehouse-in process again for a part of the first containers in the set of containers to be put into the warehouse. The efficiency of the warehouse-in is high. When multiple lanes When there is currently no target first aisle and the first aisle with the largest number of remaining storage locations among all the first aisles among the multiple aisles that can be allocated to the container set to be put into storage, the one with the largest number of remaining storage locations The first lane is determined as the corresponding lane of the collection of containers to be put into storage, and as many first containers as possible can be put into the warehouse.

In some embodiments, based on the number of containers in the set of containers to be put into storage, and the remaining number of storage slots in each of the multiple lanes of the target warehouse, it is determined from all the second lanes in the plurality of lanes. The corresponding lane of the library container set includes: when there is currently a target second lane in the plurality of lanes, determining the target second lane with the smallest predicted sorting cost among all the target second lanes in the plurality of lanes as the to-be The corresponding aisle of the incoming container set, wherein the target second aisle is the second aisle with the number of remaining storage locations greater than or equal to the number of the first containers in the incoming container set, and the predicted sorting cost of each aisle is used to indicate the When the set of containers to be put into storage is added to the lane, in order to determine the distribution that all the containers in the lane should achieve, it needs to be based on how many container position relationships, and the position relationship of the container indicates the corresponding one of the first The relationship between the position of the container and the position of a corresponding container in the target second lane; when multiple lanes do not include the target second lane and all second When the second lane with the smallest predicted sorting cost among the lanes is selected, the second lane with the smallest predicted sorting cost is determined as the corresponding lane of the set of containers to be put into storage.

For any aisle, the predicted sorting cost of the aisle is used to indicate how many container position relationships need to be based on in order to determine the distribution that all containers in the aisle should achieve when the collection of containers to be put into storage is added to the aisle, The container position relationship indicates the relationship between the position of a corresponding first container in the set of containers to be put into storage and the position of a corresponding container in the target second lane.

For any second lane, in the case of adding the container set to be put into the second lane, in order to determine the distribution that all containers in the second lane should achieve, it is necessary to consider adding the set of containers to be put into the second lane. In the case of the second lane, when adding the collection of containers to be stored into the second lane, the containers in the second lane are combined in pairs to obtain a plurality of container pairs. A container pair includes two containers in the second lane. For any container pair, the container pair includes a container that does not appear in other container pairs. The container position relationship of the two containers in the container pair is in order Considered when determining the distribution that all containers in this second lane should achieve. The resulting number of container pairs is therefore the predicted finishing cost for this second lane.

In the present application, when there is currently a target second lane among the multiple lanes, the target second lane with the smallest predicted sorting cost among all the target second lanes among the multiple lanes is determined as the storage-waiting container The corresponding lane of the collection. When the plurality of lanes does not include the target second lane and the second lane with the smallest predicted collation cost among all second lanes in the plurality of lanes can be assigned to the set of inbound containers, then the The second lane is determined as the corresponding lane of the collection of containers to be put into storage. Therefore, after storing at least a part of the set of containers to be put into storage in the corresponding aisle of the set of containers to be put into storage, if the distribution of all the containers in the second aisle is required, the arrangement cost is minimal.

In some embodiments, it also includes: when there are multiple sets of containers to be shipped out in the target warehouse and the multiple sets of containers to be shipped out involve multiple floors of the target warehouse, handling based on each floor of the multiple floors The number of robots, determine the target set of containers to be delivered from multiple sets of containers to be delivered; add the target set of containers to be delivered to the delivery sequence, where each set of containers to be delivered in the delivery sequence is delivered in order library.

In this application, the target warehouse may include multiple floors, and for any floor, the floor includes multiple lanes. The robot can be a four-way shuttle.

The multiple floors involved in the multiple container sets to be shipped are obtained by deduplicating the corresponding floor sets of the multiple container sets to be shipped, and the corresponding floor sets of the multiple container sets to be shipped are obtained by treating each of the container sets to be shipped. The corresponding floor of a container to be delivered is obtained by aggregation, and the corresponding floor of the container to be delivered is the floor where the container to be delivered is located.

For any one of the floors involved in the multiple sets of containers to be shipped out, the number of robots on the floor is the number of robots on the floor.

When based on the number of robots on each of the multiple floors involved in the multiple sets of containers to be shipped out, the set of containers to be shipped out that can be added to the stock-out sequence is determined from the multiple sets of containers to be shipped out, it can be determined The floor with the largest number of robots among the floors involved in the multiple sets of containers to be shipped out.

If there is one set of containers to be delivered on the floor with the largest number of robots, the set of containers to be delivered on the floor with the largest number of robots can be determined as the set of containers to be delivered that can be added to the delivery sequence collection of containers.

If there are multiple container sets to be shipped out on the floor with the largest number of robots, randomly select a container set to be shipped out from the multiple container sets to be shipped out on the floor with the largest number of robots, A randomly selected set of containers to be shipped out is determined as a set of containers to be shipped out that can be added to the stock out sequence.

In this application, the set of containers to be delivered in the delivery sequence is delivered in order.

The earlier the time when the set of containers to be shipped is added to the stock-out sequence, the earlier the start time of the stock-out of the set of containers to be shipped is.

For a set of containers to be shipped out of the sequence, before the set of containers to be shipped out is shipped out, the set of containers to be shipped out is used as a target container set, and the first sorting operation is performed on the set of containers to be shipped out , and then, unload the set of containers to be unloaded.

In this application, the greater the number of robots on the floor where the collection of containers to be dispatched is, the greater the number of robots that can be dispatched, and the earlier the start time of the dispatch of the collection of containers to be dispatched, the floor with the largest number of robots will be The collection of containers to be shipped out in the warehouse is added to the warehouse-out sequence, and when the collection of containers to be shipped out in the warehouse-out sequence is shipped out, the collection of containers to be shipped out in the warehouse-out sequence can be shipped out as soon as possible, which has a high outbound efficiency.

In some embodiments, the target roadway has a first side entrance corresponding to the first temporary storage area and a second side entrance corresponding to the second temporary storage area, and the first side entrance is the warehouse exit of the target roadway; the first sorting The operation includes: determining whether the distance between the storage location where the first target container is located and the first side entrance is less than or equal to the distance between the storage location where the second target container is and the second side entrance, wherein the first target container is The target container with the closest distance to the first side entrance and exit, the second target container is the target container with the farthest distance from the first side entrance and exit, and the target container satisfies one of the following conditions: the location where the target container is located does not have a In the location sequence of the container set, the target container does not belong to any sub-container set and the location of the target container is in the corresponding location sequence of a sub-container set, the location sequence is defined by the target distribution; A target container is placed in the first temporary storage area, and each third target container is respectively placed in the temporary storage area closest to the third target container, wherein the third target container is placed in a warehouse with a sequence number greater than that of the first library The target container on the storage location of the serial number of the position, the first storage location is the storage location of the first target container; place the corresponding target container in the corresponding temporary storage area on the free storage location assigned to the corresponding target container , wherein the free location is formed by placing the corresponding target container into the corresponding temporary placement area, the free location assigned to the target container belonging to the corresponding sub-container set is in the location sequence of the corresponding sub-container set ; If not, the second target container is placed into the second temporary placement area, and each fourth target container is placed into the temporary placement area closest to the fourth target container, wherein the fourth target container is placed in a The container on the storage location whose serial number is less than the serial number of the second storage location, the second storage location is the storage location where the second target container is located; place the corresponding target container in the corresponding temporary storage area to the corresponding target container on the vacant storage space.

In the present application, each of the two sides of the target roadway has an entrance, and the target roadway has a first side entrance and a second side entrance. The first side entrance and exit of the target roadway is the storage exit of the target roadway.

In this application, for any set of sub-containers, the location sequence of the set of sub-containers is defined by the target distribution.

The first location in the location sequence of the first sub-container set defined by the target sequence is the first location in the target aisle.

For a location sequence of another subcontainer set, the last location in the location sequence of the previous subcontainer set of the other subcontainer set is the mth location, and the location sequence of the other subcontainer set is The first storage location is the m+1th storage location, the other sub-container sets are sub-container sets that are not the first sub-container set, and the previous sub-container set of the other sub-container sets is defined by the target sequence.

In this application, for a container in the target lane, if the container belongs to a set of sub-containers, and the location where the container is located is not in the location sequence of the set of sub-containers to which the container belongs, then the container is a target container .

For a container in the target lane, if the container does not belong to any sub-container set and the location where the container is located is in the corresponding location sequence of a sub-container set, then the container is a target container.

The first target container is the target container with the closest distance to the first side entrance and exit among all target containers. The second target container is the target container that is farthest from the first side entrance and exit among all target containers.

In this application, the first storage location where the first target container is located is recorded as the i1th storage location.

The second storage location where the second target container is located is recorded as the i2th storage location.

The number of containers in the target lane is recorded as n, the last container in the target lane is the nth container, and the storage location where the last container is located is the nth storage location.

The i-th storage location in the target roadway is relative to the first side entrance and exit of the target roadway, that is, the storage exit of the target roadway.

The first storage location in the target aisle is the storage location closest to the first side entrance and exit of the target aisle, and the nth storage location in the target aisle is the storage location farthest from the first side entrance and exit of the target aisle.

For any storage location and any temporary storage area, the distance between the storage location and the outlet corresponding to the temporary storage area may be used as the distance between the storage location and the temporary storage area.

The first temporary storage area is outside the roadway, and the first temporary storage area is near the first side entrance. The second temporary storage area is outside the roadway, and the second temporary storage area is near the second side entrance.

For the i-th storage location, the distance between the i-th storage location and the first-side entrance and exit may be: the number of storage locations before the i1-th storage location*the width of the storage location.

For the i-th storage location, the distance between the i-th storage location and the second-side entrance and exit may be: the number of storage locations behind the i-th storage location*the width of the storage location.

When the distance between the storage location where the first target container is located and the first side entrance is less than or equal to the distance between the storage location where the second target container is and the second side entrance, the first target container is placed on the first side. a temporary storage area, respectively placing each third target container in the temporary storage area closest to the third target container, wherein the third target container is placed on a storage location with a serial number greater than that of the first storage location The target container of , the first location is the location where the first target container is located.

For each third target container, the third target container is placed in the temporary storage area closest to the third target container among the first temporary storage area and the second temporary storage area.

For any target container, after the target container is placed in the corresponding temporary placement area, the storage location where the target container is located before the target container is placed in the corresponding temporary storage area becomes an idle storage location.

After the first target container is placed in the first temporary storage area and each third target container is respectively placed in the temporary storage area closest to the third target container, each target container in the first temporary storage area is allocated A free storage location, assigning a free storage location to each target container in the second temporary storage area.

All free storage locations form a free storage location sequence. For a target container belonging to the corresponding sub-container set in a staging area, randomly select from all free slots in the sequence of free locations of the sub-container set to which the target container belongs and which have not been assigned Select a free storage location and assign a randomly selected free storage location to the target container.

For a target container in a temporary storage area that does not belong to any sub-container set, randomly select a free stock from all the free stock positions in the free stock position sequence that are not in the stock position sequence of the sub-container set and have not been allocated slot, assign a randomly selected free storage slot to the target container.

After allocating a free storage location for each target container, for each set of sub-containers, the set of sub-containers is placed from the corresponding temporary placement area on the free storage location assigned to the target container.

When the distance between the warehouse location where the first target container is located and the first side entrance is less than or equal to the distance between the warehouse location where the second target container is located and the second side entrance, place the second target container on the second side. a temporary storage area, respectively placing each fourth target container in the temporary storage area closest to the fourth target container, wherein the fourth target container is placed on a storage location with a serial number smaller than that of the second storage location The second storage location is the storage location where the second target container is located; the corresponding target container in the corresponding temporary storage area is placed on the free storage location allocated to the corresponding target container.

After the second target container is placed in the second temporary placement area and each fourth target container is respectively placed in the temporary placement area closest to the fourth target container, each target container in the first temporary placement area is allocated A free storage location, assigning a free storage location to each target container in the second temporary storage area.

For a target container belonging to the corresponding sub-container set in a staging area, randomly select from all free slots in the sequence of free locations of the sub-container set to which the target container belongs and which have not been assigned Select a free storage location and assign a randomly selected free storage location to the target container.

For a target container in a temporary storage area that does not belong to any sub-container set, randomly select a free stock from all the free stock positions in the free stock position sequence that are not in the stock position sequence of the sub-container set and have not been allocated slot, assign a randomly selected free storage slot to the target container.

After allocating a free storage location for each target container, for each set of sub-containers, the set of sub-containers is placed from the corresponding temporary placement area on the free storage location assigned to the target container.

In the present application, in the process of performing the first sorting operation, the corresponding target container can be placed in the temporary storage area, and then the corresponding target container can be put back into the corresponding storage position in the target lane, which can avoid the The container is taken out and temporarily placed in the robot passage area in the target lane, obstructing the corresponding robot in the target lane. Each target container is placed in the temporary storage area closest to the target container, and placing the target container in the temporary storage area consumes less resources.

Please refer to FIG. 2 , which shows a structural block diagram of a warehouse management device provided by an embodiment of the present application. The warehouse management device includes: a sorting unit 201 and a warehouse-out unit 202 .

The sorting unit 201 is configured to perform a first sorting operation on the target container set in the target lane in the target warehouse, so that the distribution of the target container set reaches the target distribution, wherein, when the distribution of the target container set reaches the target distribution When , for any sub-container set in the target container set, the sub-container set is distributed on multiple continuous storage locations in the target lane;

The outbound unit 202 is configured to sequentially perform outbound operations on each sub-container set in the target container set according to the target order, and the outbound operation includes: sequentially performing a warehouse-out operation on each sub-container set according to the order of the containers in the sub-container set Each container in the set of sub-containers is delivered from the warehouse.

In some embodiments, the warehouse management device also includes:

a calculation unit configured to calculate a movement amount of each of the plurality of candidate distributions, wherein the movement amount of the candidate distribution indicates that when a second sorting operation related to the candidate distribution is performed on the target container set, The number of containers that need to be moved in the target container set, and the second sorting operation related to the candidate distribution is used to make the distribution of the target container set reach the candidate distribution; the candidate distribution with the smallest amount of movement will be Determined as the target distribution.

In some embodiments, the warehouse management device also includes:

The storage unit is configured to determine the corresponding aisle of the set of containers to be warehousing based on the number of containers in the set of containers to be warehousing and the number of remaining storage locations of each of the plurality of aisles of the target warehouse, Wherein, the corresponding lane of the set of containers to be put into storage is used to store at least a part of the set of containers to be put into storage.

In some embodiments, the warehousing unit is further configured to, when storing the first container in the set of containers to be put into storage and the first lane currently exists in the plurality of lanes, based on the set of containers to be put into storage The number of containers in the target warehouse, the number of remaining storage positions in each of the multiple lanes of the target warehouse, and determine the corresponding lane of the set of containers to be put into storage from all the first lanes in the multiple lanes , wherein, for any container in the first lane, the container is on the corresponding storage position of the container in the first lane; , and when the first lane does not currently exist in the multiple lanes and the second lane currently exists in the multiple lanes, based on the number of containers in the collection of containers to be put into storage, the number of the multiple lanes in the target warehouse The number of remaining storage positions of each lane, determine the corresponding lane of the set of containers to be put into storage from all the second lanes in the plurality of lanes, wherein there is a second container in the second lane, and the second container is The container in the corresponding lane and waiting to be placed on the corresponding location of the second container.

In some embodiments, the storage unit is further configured to, when there is currently a target first aisle in the plurality of aisles, place all the target first aisles in the plurality of aisles with the least number of remaining storage locations The target first aisle is determined as the corresponding aisle of the set of containers to be put into storage, wherein the target first aisle is the first aisle with the number of remaining storage locations greater than or equal to the number of first containers in the set of containers to be put into storage ; When there is currently no target first lane in the plurality of lanes and the first lane with the largest number of remaining storage positions among all the first lanes in the plurality of lanes can be allocated to the set of storage containers , the first lane with the largest number of remaining storage locations is determined as the corresponding lane of the set of containers to be put into storage.

In some embodiments, the storage unit is further configured to, when there is currently a target second lane in the plurality of lanes, the one with the smallest predicted sorting cost among all the target second lanes in the plurality of lanes The target second lane is determined as the corresponding lane of the set of containers to be put into storage, wherein the target second lane is a second lane whose number of remaining storage locations is greater than or equal to the number of first containers in the set of containers to be put into storage, The predicted sorting cost of each aisle is used to indicate how many container position relationships need to be based on in order to determine the distribution that all containers in the aisle should achieve when the set of containers to be put into storage is added to the aisle. The relationship indicates the relationship between the position of a corresponding one of the first containers in the set of storage-to-be containers and the position of a corresponding one of the containers in the target second lane; when the multiple lanes do not include the target second lane and When the second lane with the smallest predicted sorting cost among all the second lanes among the plurality of lanes may be allocated to the set of containers to be put into storage, the second lane with the smallest predicted sorting cost may be determined as The corresponding aisle of the collection of containers to be put into storage.

In some embodiments, it further includes: when there are multiple container sets to be shipped out in the target warehouse and the multiple container sets to be shipped out involve multiple floors of the target warehouse, based on the multiple The number of handling robots on each floor in the floor determines the target container set to be shipped out from the plurality of container sets to be shipped out; the target container set to be shipped out is added to the stock-out sequence, wherein the stock-out Each set of containers to be delivered in the sequence is delivered in sequence.

In some embodiments, the target lane has a first side entrance corresponding to the first temporary storage area and a second side entrance corresponding to the second temporary storage area, and the first side entrance is the exit of the target lane The first sorting operation includes: determining whether the distance between the warehouse location where the first target container is located and the first side entrance is less than or equal to the distance between the warehouse location where the second target container is located and the second side entrance Wherein, the first target container is the target container closest to the first side entrance, the second target container is the target container farthest from the first side entrance, and the target container satisfies one of the following conditions : The location where the target container is located is not in the location sequence of the sub-container set to which the target container belongs, the target container does not belong to any sub-container set, and the location where the target container is located is in the location sequence of a corresponding sub-container set , the location sequence is defined by the target distribution; if so, the first target container is placed in the first temporary storage area, and each third target container is placed in the temporary storage space closest to the third target container. area, wherein the third target container is a target container placed on a storage location with a serial number greater than that of the first storage location, and the first storage location is the storage location where the first target container is located; the corresponding temporary The corresponding target container in the placement area is placed on the free location assigned to the corresponding target container, wherein the free location is formed by placing the corresponding target container into the corresponding temporary placement area, which is assigned to the corresponding sub-container The free location of the target container of the collection is in the location sequence of the corresponding sub-container set; if not, the second target container is placed in the second temporary placement area, and each fourth target container is placed in the same location as the first The temporary storage area where the four target containers are closest, wherein, the fourth target container is a container placed on a storage location with a serial number smaller than that of the second storage location, and the second storage location is where the second target container is located. Storage location; place the corresponding target container in the corresponding staging area on the free storage location assigned to the corresponding target container.

Each functional module or unit in the image processing device of the embodiment of the present application is used to execute the steps of the above-mentioned warehouse management method, for details, please refer to the relevant content of the above-mentioned warehouse management method.

The embodiment of the present application also provides a computer-readable storage medium, on which a computer program/instruction is stored, and when the computer program/instruction is executed by a processor, the above-mentioned warehouse management method is realized.

The embodiment of the present application also provides a computer program product, including a computer program/instruction, and when the computer program/instruction is executed by a processor, the above-mentioned warehouse management method is realized.

In an exemplary embodiment, there is also provided a storage medium including instructions, such as a memory including instructions, which can be executed by an electronic device to implement the above warehouse management method. Alternatively, the storage medium may be a non-transitory computer readable storage medium such as ROM, random access memory (RAM), CD-ROM, magnetic tape, floppy disk, and optical data storage medium. equipment etc.

Other embodiments of the present application will be readily apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any modification, use or adaptation of the application, these modifications, uses or adaptations follow the general principles of the application and include common knowledge or conventional technical means in the technical field not disclosed in the application . The specification and examples are to be considered exemplary only, with a true scope and spirit of the application indicated by the following claims.

It should be understood that the present application is not limited to the precise constructions which have been described above and shown in the accompanying drawings, and various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims (11)

1. A warehouse management method, the method comprising:

performing a first sorting operation on a target container set in a target roadway in a target warehouse so that the distribution of the target container set reaches a target distribution, wherein when the distribution of the target container set reaches the target distribution, for any one sub-container set in the target container set, the sub-container set is distributed on a plurality of continuous positions in the target roadway;

and sequentially carrying out ex-warehouse operation on each sub-container set in the target container set according to the target sequence, wherein the ex-warehouse operation comprises the following steps: and sequentially carrying out ex-warehouse on each container in the sub-container set according to the order of the containers in the sub-container set.

2. The method of claim 1, further comprising:

calculating an amount of movement of each of a plurality of candidate distributions, wherein the amount of movement of a candidate distribution indicates the number of containers in the target container set that need to be moved when a second sorting operation related to the candidate distribution is performed on the target container set, and the second sorting operation related to the candidate distribution is used for enabling the distribution of the target container set to reach the candidate distribution;

determining the candidate distribution having the smallest moving amount as the target distribution.

3. The method according to claim 1 or 2, characterized in that the method further comprises:

and determining a corresponding tunnel of the container set to be warehoused based on the number of the containers in the container set to be warehoused and the number of the remaining warehouse positions of each tunnel of the multiple tunnels of the target warehouse, wherein the corresponding tunnel of the container set to be warehoused is used for storing at least one part of the container set to be warehoused.

4. The method of claim 3, wherein determining a corresponding lane of the set of containers to be warehoused based on the number of containers in the set of containers to be warehoused, the number of remaining inventory positions for each of the plurality of lanes of the target warehouse comprises:

when a first container in the container set to be warehoused is warehoused and a first roadway currently exists in the plurality of roadways, determining a corresponding roadway of the container set to be warehoused from all first roadways in the plurality of roadways based on the number of containers in the container set to be warehoused and the number of remaining positions of each roadway of the plurality of roadways of the target warehouse, wherein for any container in a first roadway, the container is on the corresponding position of the container in the first roadway;

when a first container in the container set to be warehoused is warehoused, a first roadway does not exist in the plurality of roadways at present, and a second roadway exists in the plurality of roadways at present, determining a corresponding roadway of the container set to be warehoused from all second roadways in the plurality of roadways based on the number of containers in the container set to be warehoused and the number of remaining warehouse positions of each roadway of the target warehouse, wherein a second container exists in the second roadway, and the second container is a container which is in a corresponding roadway and waits to be placed on the corresponding warehouse position of the second container.

5. The method of claim 4, wherein determining, from all first lanes of the plurality of lanes, a corresponding lane of the set of containers to be warehoused based on the number of containers in the set of containers to be warehoused and the remaining number of bay bits for each of the plurality of lanes of the target warehouse comprises:

when a target first roadway exists in the plurality of roadways, determining a target first roadway with the least residual stock space number in all target first roadways in the plurality of roadways as a corresponding roadway of the container set to be warehoused, wherein the target first roadway is a first roadway with the residual stock space number larger than or equal to the number of first containers in the container set to be warehoused;

when a target first tunnel does not exist in the plurality of tunnels currently and a first tunnel with the largest number of remaining stock locations in all first tunnels in the plurality of tunnels can be allocated to the container set to be warehoused, determining the first tunnel with the largest number of remaining stock locations as a corresponding tunnel of the container set to be warehoused.

6. The method of claim 4 or 5, wherein determining the corresponding lane of the set of containers to be warehoused from all second lanes of the plurality of lanes based on the number of containers in the set of containers to be warehoused and the remaining number of bay bits for each of the plurality of lanes of the target warehouse comprises:

when a target second roadway exists in the plurality of roadways, determining a target second roadway with the minimum predicted sorting cost in all target second roadways in the plurality of roadways as a corresponding roadway of the container set to be warehoused, wherein the target second roadway is a second roadway of which the number of remaining warehouse locations is greater than or equal to the number of first containers in the container set to be warehoused, and the predicted sorting cost of each roadway is used for indicating how many container position relationships, which indicate the relationship between the position of a corresponding one of the container sets to be warehoused and the position of a corresponding one of the containers in the target second roadway, are needed to be based on in order to determine the distribution that all the containers in the roadway should reach when the container set to be warehoused is added to the roadway;

when the plurality of lanes do not include a target second lane and a second lane having a smallest predicted consolidation cost of all second lanes of the plurality of lanes may be allocated to the set of containers to be warehoused, determining the second lane having the smallest predicted consolidation cost as a corresponding lane of the set of containers to be warehoused.

7. The method according to any one of claims 1-6, further comprising:

when a plurality of container sets to be delivered are in the target warehouse and the plurality of container sets to be delivered relate to a plurality of floors of the target warehouse, determining a target container set to be delivered from the plurality of container sets to be delivered based on the number of transfer robots of each of the plurality of floors;

and adding the target container sets to be delivered into a delivery sequence, wherein each container set to be delivered in the delivery sequence is delivered according to the sequence.

8. The method of any one of claims 1-7, wherein the target roadway has a first side access corresponding to a first temporary placement area and a second side access corresponding to a second temporary placement area, the first side access being an exit of the target roadway; the first sorting operation includes:

determining whether the distance between the storage position where a first target container is located and the first side access is smaller than or equal to the distance between the storage position where a second target container is located and the second side access, wherein the first target container is the target container closest to the first side access, the second target container is the target container farthest from the first side access, and the target containers meet one of the following conditions: the library bit of the target container is not in the library bit sequence of the sub-container set to which the target container belongs, the target container does not belong to any sub-container set, and the library bit of the target container is in the library bit sequence of a corresponding sub-container set, wherein the library bit sequence is defined by the target distribution;

if so, placing the first target container in the first temporary placement area, and respectively placing each third target container in a temporary placement area closest to the third target container, wherein the third target container is a target container placed on a library position with a serial number greater than that of the first library position, and the first library position is the library position where the first target container is located;

placing the respective target container in the respective temporary placement area onto a free bin position allocated to the respective target container, wherein the free bin position is formed as a result of placing the respective target container in the respective temporary placement area, the free bin position allocated to the target container belonging to the respective sub-container set being in a bin position sequence of the respective sub-container set;

if not, placing the second target container in a second temporary placement area, and respectively placing each fourth target container in a temporary placement area closest to the fourth target container, wherein the fourth target container is a container placed on a library position with a sequence number smaller than that of the second library position, and the second library position is the library position where the second target container is located;

and placing the corresponding target container in the corresponding temporary placement area on the free library position allocated to the corresponding target container.

9. An electronic device, comprising: memory, processor and computer program stored on the memory, characterized in that the processor executes the computer program to implement the method of any of claims 1-8.

10. A computer-readable storage medium on which a computer program/instructions are stored, characterized in that the computer program/instructions, when executed by a processor, implement the method of any one of claims 1-8.

11. A computer program product comprising computer programs/instructions, characterized in that the computer programs/instructions, when executed by a processor, implement the method of any of claims 1-8.

Images