Flower bucket distribution method, device, equipment and storage medium

Abstract

The embodiments of the present application disclose a flower bucket allocation method, device, equipment, and storage medium, belonging to the field of warehouse storage technology. The method includes: obtaining first flower bucket information, the first flower bucket information is used to indicate the number and attribute information of flowers contained in the first flower bucket; based on the first flower bucket information, determining the storage lane for the first flower bucket from at least two lanes; based on the first flower bucket information, determining the storage location of the first flower bucket in the storage lane. The present application allocates a corresponding storage location to the first flower bucket through the first flower bucket information, realizes the automated determination of the flower bucket placement location, reduces the consumption of human resources, and is conducive to allocating more human resources to other related processes for flowers, thereby indirectly improving the overall processing efficiency for flowers; the storage location allocation process is gradually refined, which is conducive to improving the accuracy of flower bucket allocation, so that the flower buckets can be placed in the correct and appropriate location.

Description

Technical Field

[0001] The present application relates to the field of warehouse storage technology, and in particular to a flower bucket distribution method, device, equipment and storage medium. Background Art

[0002] At present, with the improvement of people's spiritual needs, the demand for flowers is gradually increasing, and the requirements for the placement of flowers are also gradually increasing.

[0003] In the related art, after the flowers are placed in the flower bucket based on the type and grade of the flowers, the staff determines the corresponding placement position of the flower bucket based on the relevant information of the flowers in the flower bucket, and then transports the flower bucket and places it in the corresponding position.

[0004] However, in the above-mentioned related technologies, it is necessary to manually determine the placement position of the flower barrel, which consumes a lot of human resources. Summary of the Invention

[0005] The embodiments of the present application provide a method, device, equipment, and storage medium for allocating flower buckets, which can reduce the consumption of human resources. The technical solution is as follows:

[0006] In one aspect, an embodiment of the present application provides a method for detecting flower bucket allocation, the method comprising:

[0007] Acquire first flower bucket information, where the first flower bucket information is used to indicate the number and attribute information of flowers contained in the first flower bucket; wherein the first flower bucket includes at least one flower;

[0008] Based on the information of the first flower bucket, determining a storage lane for the first flower bucket from at least two lanes; wherein the storage lane is used to store the first flower bucket, and one lane includes at least one stereoscopic storage;

[0009] Based on the first flower bucket information, the storage location of the first flower bucket in the storage lane is determined; wherein the three-dimensional warehouse includes at least two storage locations, and one storage location is used to place one flower bucket.

[0010] On the other hand, an embodiment of the present application provides a flower bucket dispensing device, which is used to implement the method according to any one of claims 1 to 10, and the device includes:

[0011] An information acquisition module is used to acquire first flower bucket information, where the first flower bucket information is used to indicate the number and attribute information of flowers contained in the first flower bucket; wherein the first flower bucket includes at least one flower;

[0012] A lane allocation module is configured to determine, based on the information of the first flower bucket, a storage lane for the first flower bucket from at least two lanes; wherein the storage lane is used to store the first flower bucket, and one lane includes at least one stereoscopic storage;

[0013] The storage location allocation module is used to determine the storage location of the first flower bucket in the storage lane based on the first flower bucket information; wherein the three-dimensional warehouse includes at least two storage locations, and one storage location is used to place one flower bucket.

[0014] On the other hand, an embodiment of the present application provides a computer device, which includes a processor and a memory, wherein a computer program is stored in the memory, and the computer program is loaded and executed by the processor to implement the above-mentioned flower bucket allocation method.

[0015] On the other hand, an embodiment of the present application provides a non-transitory computer-readable storage medium having a computer program stored thereon, which implements the above-mentioned flower bucket allocation method when executed by a processor.

[0016] On the other hand, an embodiment of the present application provides a computer program product, which, when executed, enables a computer device to execute the above-mentioned flower bucket allocation method.

[0017] Compared with the prior art, the technical solution provided by the embodiments of the present application can bring the following beneficial effects:

[0018] (1) By allocating the corresponding storage location for the first flower bucket through the first flower bucket information, the placement of the flower bucket is automatically determined, which saves manpower and reduces the consumption of human resources. This is conducive to allocating more human resources to other related processes of flowers (such as flower delivery process, grading process, packaging process, etc.), thereby indirectly improving the overall processing efficiency of flowers;

[0019] (2) The first flower bucket information is used to indicate the attribute information of the flowers contained in the first flower bucket. First, a storage lane is allocated to the first flower bucket based on the attribute information, and then a storage location is allocated to the first flower bucket from the storage lane based on the attribute information. The storage location allocation process is gradually refined, which is conducive to improving the accuracy of flower bucket allocation and enabling the flower bucket to be placed in the correct and appropriate location. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The present invention will be further described below with reference to the accompanying drawings and embodiments:

[0021] Figure 1 is a schematic diagram of a flower bucket dispensing system provided by one embodiment of the present application;

[0022] Figure 2 This is a flow chart of a flower bucket allocation method provided by one embodiment of the present application;

[0023] Figure 3 is a flow chart of a flower bucket allocation method provided by another embodiment of the present application;

[0024] Figure 4 This is a flow chart of a flower bucket allocation method provided in yet another embodiment of the present application;

[0025] Figure 5 This is a flow chart of a flower bucket allocation method provided by another embodiment of the present application;

[0026] Figure 6 A schematic diagram of a display interface is exemplarily shown;

[0027] Figure 7 is a block diagram of a flower bucket dispensing device provided by one embodiment of the present application;

[0028] Figure 8 This is a block diagram of a flower bucket dispensing device provided in another embodiment of the present application. DETAILED DESCRIPTION

[0029] The present invention will be described in further detail below with reference to specific embodiments:

[0030] Please refer to Figure 1 , which shows a schematic diagram of a flower bucket distribution system provided by an embodiment of the present application. The flower bucket distribution system may include: a conveying device 10, a stacker 20, a scanning device 30 and a computer device 40.

[0031] The conveying device 10 is a device used to transport flower buckets. For example, the conveying device 10 may transport the flower buckets via a conveyor belt, a transport vehicle, or the like, although this embodiment of the present application is not limited thereto. Optionally, the flower bucket distribution system may include one or more conveying devices 10, although this embodiment of the present application is not limited thereto.

[0032] The stacker 20 is used to pick up and place the flower barrels at the corresponding storage location. Optionally, the flower barrel distribution system may include one or more stackers 20.

[0033] The scanning device 30 is used to obtain flower bucket information. For example, each flower bucket corresponds to an identification information, and the scanning device 30 obtains the corresponding flower bucket information by scanning the identification information. The identification information can be a barcode, a QR code, or a text image, etc., which is not limited in this embodiment of the present application. Optionally, the flower bucket distribution system can include one or more scanning devices 30, which is not limited in this embodiment of the present application. For example, the staff determines the number of scanning devices 30 based on the number of transport ports for which the flower bucket information needs to be obtained.

[0034] The computer device 40 is used to allocate flower barrels to determine the storage location for placing the flower barrels. For example, the computer device 40 can be an electronic device such as a mobile phone, tablet computer, wearable device, backend server, server cluster, or PC (Personal Computer), which is not limited in this embodiment of the present application. In this embodiment of the present application, the conveying device 10 transports the flower barrels to the location of the scanning device 30. The computer device 40 obtains the flower barrel information through the scanning device 30 and then determines the storage location for placing the corresponding flower barrel based on the flower barrel information. Thereafter, the conveying device 10 transports the flower barrels to the corresponding storage entrance. Furthermore, the stacker 20 places the flower barrels in the corresponding storage location. In addition, after the computer device 40 detects an order related to the flower barrels, the stacker 20 removes the flower barrels from the corresponding storage location and ships them out of the warehouse.

[0035] Optionally, the conveying device 10 , the stacker 20 , the scanning device 30 and the computer device 40 communicate with each other via a network.

[0036] Please refer to Figure 2 , which shows a flow chart of a method for allocating flower buckets provided by an embodiment of the present application. Figure 1 The computer device 40 in the flower bucket distribution system shown. The method may include the following steps (201-203):

[0037] Step 201: Obtain information of the first flower bucket.

[0038] A flower bucket is a container for storing flowers, and each flower bucket contains at least one flower. The first flower bucket information indicates the quantity and attribute information of the flowers contained in the first flower bucket. The first flower bucket can be any flower bucket that contains at least one flower. Exemplarily, the attribute information includes the flower variety, flower brand (the supplier's brand), and flower grade. Optionally, flowers contained in the same flower bucket have the same attribute information. That is, in this embodiment of the present application, the flowers contained in the first flower bucket have the same attribute information.

[0039] In the embodiment of the present application, when allocating a storage location corresponding to a flower bucket, the computer device obtains the first flower bucket information. Optionally, the first flower bucket has corresponding identification information, and the computer device scans the identification information corresponding to the first flower bucket using a scanning device to obtain the first flower bucket information.

[0040] In a possible implementation, the flower bucket information is included in the corresponding identification information. Optionally, the computer device calls a scanning device to scan the identification information, and then obtains the first flower bucket information from the scanning result.

[0041] In another possible embodiment, the flower bucket information is pre-stored in an information storage device. For example, after the flower delivery, flower grading and other processes are completed, the corresponding flower bucket information is generated and stored in the information storage device. Among them, the flower delivery process refers to the process of transferring flowers to flower buckets after the supplier provides flowers; the flower grading process refers to the process of determining the grade of flowers based on the flower variety, degree of openness, degree of withering, color and other status information. Optionally, the computer device calls the scanning device to scan the identification information, and then obtains the corresponding index information from the scanning result, and further obtains the first flower bucket information from the information pre-stored in the information storage device based on the index information. For example, the index information can be a character string, a digital code or text, etc., which is not limited in this embodiment of the present application. Optionally, the information storage device and the computer device can be the same device or different devices, which is not limited in this embodiment of the present application.

[0042] Optionally, the above attribute information may also include but is not limited to at least one of the following: supply date, supplier code, supplier base, batch number, batch quantity, etc.

[0043] Step 202: Based on the information of the first flower bucket, determine the storage lane for the first flower bucket from at least two lanes.

[0044] The lane is a warehouse lane. Optionally, in order to increase storage capacity, the warehouse includes at least two lanes. In the embodiment of the present application, one lane includes at least one stereoscopic warehouse. Among them, the stereoscopic warehouse is also called a high-bay warehouse or high-bay warehouse, which is used to store flower buckets. It should be noted that in actual applications, the staff can flexibly set and adjust the number of lanes and the number of stereoscopic warehouses in the lanes according to actual conditions, and the embodiment of the present application does not limit this.

[0045] In this embodiment of the present application, after obtaining the aforementioned first flower bucket information, the computer device determines, based on the first flower bucket information, a storage lane for the first flower bucket from at least two lanes. The storage lane is used to store the first flower bucket. Optionally, the computer device may assign a storage lane to the first flower bucket based on the flower storage information of each lane or based on the workload of each lane.

[0046] In one possible implementation, the computer device assigns a storage lane to the first flower bucket based on flower storage information for each lane. The flower storage information indicates the flower storage status of the lane. Optionally, after obtaining the first flower bucket information, the computer device determines the flower type corresponding to the first flower bucket based on the first flower bucket information. Furthermore, based on the flower storage information, the computer device determines the storage capacity of each flower type in each lane. The lane with the smallest storage capacity is designated as the storage lane for the first flower bucket, ensuring a uniform and abundant storage of flowers in each lane.

[0047] In another possible embodiment, the computer device assigns a storage lane to the first flower bucket based on the task volume of each lane. Optionally, after obtaining the information of the first flower bucket, the computer device obtains the tasks to be executed in each lane respectively, and then determines the task volume corresponding to each lane based on the workload of the tasks to be executed, and determines the lane with the smallest task volume as the storage lane for the first flower bucket, so as to avoid overload of equipment or staff caused by excessive task volume. Optionally, the tasks to be executed include flower bucket shelving tasks and flower bucket unshelving tasks; the flower bucket shelving task is used to place the flower bucket from the storage entrance to the corresponding storage location, such as generating a flower bucket shelving task for the first flower bucket after determining the storage location corresponding to the first flower bucket; the flower bucket unshelving task is generated based on the order, and is used to move the flower bucket from the corresponding storage location to the storage exit, that is, the flower bucket unshelving task is used to realize the outbound delivery of the flower bucket.

[0048] Of course, in other possible implementations, the computer device can also allocate a storage lane to the first flower bucket based on the flower storage information and task volume of the lane, and this embodiment of the application is not limited to this.

[0049] Step 203: Based on the information of the first flower bucket, determine the storage location of the first flower bucket in the storage lane.

[0050] Optionally, the three-dimensional warehouse includes at least two storage locations, one of which is used to place a flower bucket. It should be noted that in actual applications, the staff can flexibly set and adjust the number of storage locations in the three-dimensional warehouse according to actual conditions, and this embodiment of the application does not limit this.

[0051] In this embodiment of the present application, after determining the aforementioned inbound lane, the computer device determines the storage location of the first flower bucket in the inbound lane based on the first flower bucket information. Optionally, the computer device may assign a storage location to the first flower bucket based on pre-demarcated flower storage areas, based on flower buckets already stored in the inbound lane, or based on demand for flowers.

[0052] In one possible implementation, the computer device assigns a storage location to the first flower bucket based on pre-demarcated flower storage areas. Alternatively, the laneway may be pre-demarcated with multiple flower storage areas, each for storing a specific type of flower. After determining the incoming laneway, the computer device determines the flower type corresponding to the first flower bucket based on the first flower bucket information, then determines the flower storage area corresponding to that flower type in the incoming laneway. Within the flower storage area, any empty storage location not containing a flower bucket is assigned as the storage location corresponding to the first flower bucket.

[0053] In another possible implementation, the computer device assigns a storage location to the first flower bucket based on the flower buckets already stored in the incoming lane. Optionally, after determining the incoming lane, the computer device determines the similarity between the information of each second flower bucket and the information of the first flower bucket. The second flower buckets are those already stored in the lane. Furthermore, the computer device assigns a storage location to the first flower bucket based on the storage location corresponding to the second flower bucket with the greatest similarity. The distance between the first and second flower buckets is negatively correlated with the similarity between the first and second flower buckets; that is, the greater the similarity, the closer the distance, while the smaller the similarity, the greater the distance.

[0054] In another possible implementation, the computer device assigns a storage location to the first flower bucket based on flower demand. Optionally, after determining the entry lane, the computer device determines the flower type corresponding to the first flower bucket based on the first flower bucket's information. Furthermore, the computer device determines the predicted demand for that flower type based on historical demand parameters for that flower type, and then assigns a storage location to the first flower bucket based on the predicted demand. The distance between the first flower bucket and the exit is negatively correlated with the predicted demand; that is, the greater the predicted demand, the closer the distance; and the less the predicted demand, the farther the distance.

[0055] It should be noted that the above allocation of storage locations is exemplary and explanatory, and the allocation method can be flexibly configured and adjusted based on actual conditions. For example, the computer device allocates a storage location to the first flower bucket based on the demand for flower buckets and flowers already stored in the incoming lane.

[0056] To sum up, in the technical solution provided by the embodiment of the present application, the first flower bucket information is used to allocate a corresponding storage location to the first flower bucket, thereby realizing the automatic determination of the flower bucket placement position, saving manpower, reducing the consumption of human resources, and being conducive to allocating more human resources to other related processes of flowers (such as flower delivery process, grading process, packaging process, etc.), thereby indirectly improving the overall processing efficiency of flowers; moreover, the first flower bucket information is used to indicate the attribute information of the flowers contained in the first flower bucket, first allocating a storage lane for the first flower bucket based on the attribute information, and then allocating a storage location for the first flower bucket from the storage lane based on the attribute information, and the storage location allocation process is gradually refined, which is conducive to improving the accuracy of flower bucket allocation, so that the flower buckets can be placed in the correct and appropriate positions.

[0057] Below is a detailed introduction to the method of determining the entry lane.

[0058] In an exemplary embodiment, the above step 202 includes the following steps:

[0059] 1. Obtain the flower storage information corresponding to each lane.

[0060] In the embodiment of the present application, when allocating a storage lane to the first flower bucket, the flower storage information corresponding to each lane is obtained.

[0061] Flower storage information indicates the storage status of flower buckets in the lane. Optionally, the flower storage information is obtained based on information about at least one second flower bucket. A second flower bucket is a flower bucket already stored in the lane, and the second flower bucket information indicates the number and attributes of flowers contained in the second flower bucket.

[0062] In one possible embodiment, the flower storage information includes information about at least one second flower bucket. Optionally, after the second flower bucket is placed in a corresponding storage location, the information storage device stores the corresponding second flower bucket information and records the lane and storage location corresponding to the second flower bucket information. Subsequently, the computer device uses the lane number as an index to retrieve information about all second flower buckets corresponding to the lane from the stored information and determines the information about all second flower buckets as the flower storage information.

[0063] In another possible embodiment, the flower storage information is obtained based on statistical processing of at least one second flower bucket information. Optionally, after the second flower bucket is placed in the corresponding storage location, the information storage device stores the corresponding second flower bucket information and records the lane and storage location corresponding to the second flower bucket information. Subsequently, when obtaining the flower storage information, the computer device uses the lane number as an index to obtain all the second flower bucket information corresponding to the lane, and performs statistical processing on all the second flower bucket information to obtain the flower storage information. Exemplarily, the flower storage information is used to identify the types of flowers stored in the lane and the corresponding storage quantities of each type of flower. Optionally, the flower type is used to indicate the variety, brand, and grade of the flower.

[0064] It should be noted that to improve the real-time and accuracy of flower storage information, it is necessary to promptly update the flower storage information when the second flower bucket enters and exits the warehouse. For example, after determining the corresponding storage location for the first flower bucket, the first flower bucket is placed in the corresponding storage location. At this point, the first flower bucket is replaced by the newly placed second flower bucket. The computer device obtains the second flower bucket information based on the newly placed second flower bucket and updates the flower storage information for the entry lane based on the newly obtained second flower bucket information and its corresponding entry lane and storage location.

[0065] 2. Based on the flower storage information and the first flower bucket information, determine at least one first candidate lane corresponding to the first flower bucket from the at least two lanes.

[0066] In an embodiment of the present application, after obtaining the above-mentioned flower storage information, the computer device determines at least one first candidate lane corresponding to the first flower bucket from at least two lanes based on the flower storage information and the first flower bucket information.

[0067] Optionally, when allocating the first candidate lane to the first flower bucket, the computer device determines the flower type corresponding to the first flower bucket based on the first flower bucket information. The flower type corresponding to the first flower bucket is used to indicate the variety, brand, and grade of the flowers contained in the first flower bucket. Exemplarily, the first flower bucket information includes flower variety, flower brand, and flower grade. In one possible embodiment, the computer device directly splices the three information of flower variety, flower brand, and flower grade contained in the first flower bucket information to obtain the flower type corresponding to the first flower bucket. In another possible embodiment, for the first flower bucket information, the computer device determines the variety code based on the flower variety, determines the brand code based on the flower brand, and determines the grade code based on the flower grade, and then splices the variety code, brand code, and grade code to obtain the flower type corresponding to the first flower bucket. At this time, the flower type can be understood as a code used to indicate the flower variety, brand, and grade. It should be noted that the specific splicing order can be flexibly set and adjusted according to actual conditions, and the embodiments of the present application do not limit this.

[0068] Optionally, after obtaining the above-mentioned flower storage information, the computer device determines the storage quantity of the flower type corresponding to the first flower bucket in each lane based on the flower storage information. In one possible embodiment, the flower storage information includes at least one second flower bucket information. The computer device determines the flower types stored in the corresponding lane and the storage quantity corresponding to each flower type based on the second flower bucket information contained in the flower storage information, and then obtains the storage quantity of the flower type corresponding to the first flower bucket in the lane. In another possible embodiment, the flower storage information is used to represent the flower types stored in the lane and the storage quantity corresponding to each flower type. The computer device directly obtains the storage quantity of the flower type corresponding to the first flower bucket in each lane based on the flower storage information.

[0069] Optionally, after determining the storage capacity of each lane for the flower type corresponding to the first flower bucket, the computer device identifies at least one lane from the at least two lanes whose storage capacity is less than a storage threshold as a first candidate lane. In one possible embodiment, the storage threshold is a fixed value. For example, each flower type in a lane has a maximum storage capacity. The computer device determines the maximum storage capacity for that flower type based on the flower type corresponding to the first flower bucket, and uses the maximum storage capacity for that flower type as the storage threshold. The computer device then identifies at least one lane from the at least two lanes whose storage capacity is less than the storage threshold to obtain the first candidate lane. The maximum storage capacity is set by the staff and can be flexibly set and adjusted based on actual circumstances, which is not limited in this embodiment of the present application. In another possible embodiment, the storage threshold is a flexibly variable value. For example, the computer device sorts the lanes from smallest to largest based on the storage capacity of the flower type corresponding to the first flower bucket, determines the storage capacity at the nth position in the sorting order as the storage threshold, and then identifies at least one lane from the at least two lanes whose storage capacity is less than the storage threshold to obtain the first candidate lane. Here, n is an arbitrary value, and the value of n can be flexibly set and adjusted according to actual conditions, and the embodiments of the present application do not limit this.

[0070] 3. Based on the task volume of each candidate lane, determine the entry lane from at least one first candidate lane.

[0071] In an embodiment of the present application, after determining the at least one first candidate lane, the computer device determines an entry lane from the at least one first candidate lane based on the task volume of each candidate lane.

[0072] Optionally, after obtaining at least one first candidate lane, the computer device obtains the tasks to be executed for each first candidate lane. Exemplarily, the tasks to be executed for the lanes are stored in a task management device, and the computer device uses the lane number of the first candidate lane as an index to obtain the tasks to be executed for each first candidate lane from the information stored in the task management device. The task management device and the computer device can be the same device or different devices, and this embodiment of the application does not limit this. Exemplarily, the tasks to be executed include the above-mentioned flower bucket shelving task and the above-mentioned flower bucket unshelving task.

[0073] Optionally, after obtaining the pending tasks for each first candidate lane, the computer device determines the task volume for each first candidate lane based on the workload of the pending tasks. Exemplarily, the pending tasks include currently executing tasks and unexecuted tasks. For currently executing tasks, the computer device obtains the execution progress corresponding to the currently executing tasks and determines the workload corresponding to the unexecuted portion of the currently executing tasks based on the execution progress. For unexecuted tasks, the computer device directly obtains the workload corresponding to the unexecuted tasks. Furthermore, the computer device determines the sum of the workload corresponding to the unexecuted portion of the currently executing tasks and the workload corresponding to the unexecuted tasks as the task volume for the first candidate lane.

[0074] Optionally, after determining the task load of each first candidate lane, the computer device determines the first candidate lane with the smallest task load as the entry lane. It should be noted that if the number of first candidate lanes is one, the computer device directly determines the first candidate lane as the entry lane.

[0075] To sum up, in the technical solution provided in the embodiment of the present application, the flower storage information of the lane is used as a benchmark, combined with the information of the first flower bucket, and the storage lane is allocated to the first flower bucket. That is, the flower storage situation in the lane is taken into consideration when allocating the storage lane, which is conducive to further improving the adaptability between the storage lane and the first flower bucket, and improving the accuracy of flower bucket allocation; moreover, the first candidate lane with the smallest task volume is determined as the storage lane, which is conducive to the even distribution of tasks for the lanes. On the one hand, it tries to avoid low task execution efficiency due to lanes being too busy, and on the other hand, it tries to avoid waste of resources caused by lanes being too idle.

[0076] In addition, through the flower storage information, the lane with the least inventory of the flower type corresponding to the first flower bucket is determined as the first candidate lane, and then the storage lane is determined from the first candidate lanes, and the lane with the smallest inventory of the same type of flowers is preferentially assigned to the first flower bucket as the first candidate lane. This is conducive to achieving uniform distribution of flowers in the lanes based on flower types, thereby increasing the richness of flower types in a single lane. When an order for flowers is received, since the flower types in the lane are rich enough, the flowers required for the order can be found based on one lane, and there is no need to allocate goods for the order from multiple lanes, which is conducive to improving the efficiency of order completion.

[0077] In addition, based on the task volume of the first candidate lane, the first candidate lane with the smallest task volume is determined as the storage lane. The lane with relatively small task volume is used as the storage lane for the first flower bucket. On the one hand, it is beneficial to the even distribution of tasks for the lanes. On the other hand, it reduces the waiting time of the first flower bucket and improves the storage efficiency of the first flower bucket.

[0078] The following is a detailed introduction to how to determine the storage location.

[0079] In an exemplary embodiment, the above step 203 includes the following steps:

[0080] 1. Based on the height of the first flower barrel, determine the number of storage levels of the first flower barrel in the storage lane.

[0081] Because a three-dimensional warehouse includes at least two levels, in this embodiment of the present application, when allocating a storage location to the first flower bucket, the computer device determines the number of the storage location of the first flower bucket in the storage lane based on the height of the first flower bucket. In particular, each level of a three-dimensional warehouse includes at least one storage location.

[0082] The height of the first flower bucket refers to the total height of the first flower bucket and the flowers. In one possible embodiment, the height of the first flower bucket is obtained in real time. Optionally, when the first flower bucket is allocated a storage location, the height of the first flower bucket is measured in real time, and the computer device obtains the height of the first flower bucket. In another possible embodiment, the height of the first flower bucket is obtained in advance. Optionally, after the flowers are stored in the first flower bucket, the height of the first flower bucket is measured and recorded, and the computer device obtains the height of the first flower bucket from the pre-recorded data. Exemplarily, the first flower bucket information includes the height of the first flower bucket.

[0083] Optionally, the heights corresponding to different storage location levels can be the same or different. After obtaining the height of the first flower bucket, the computer device can determine one or more storage location levels. For example, if the height of the first flower bucket is less than or equal to 900, the computer device assigns storage location levels 1 and 2 to the first flower bucket; if the height of the first flower bucket is greater than 900 and less than or equal to 1050, the computer device assigns storage location level 3 to the first flower bucket.

[0084] 2. Based on the number of storage locations, obtain information about at least one second flower bucket.

[0085] In the embodiment of the present application, after obtaining the above-mentioned number of storage locations, the computer device obtains information of at least one second flower bucket based on the number of storage locations.

[0086] A second flower bucket refers to a flower bucket already stored in an incoming lane. Exemplarily, the at least one second flower bucket information refers to the second flower bucket information for all second flower buckets placed on the storage level. Optionally, the computer device uses the lane number and storage level of the incoming lane as an index to retrieve the second flower bucket information for the second flower buckets placed on the storage level from the information stored in the information storage device.

[0087] 3. Based on the first flower bucket information and at least one second flower bucket information, determine the similarity between each second flower bucket and the first flower bucket.

[0088] In this embodiment of the present application, after obtaining the second flower bucket information, the computer device determines the similarity between each second flower bucket and the first flower bucket based on the first flower bucket information and the at least one second flower bucket information. For example, the similarity is used to characterize the degree of similarity between two flower buckets in terms of flower variety, flower brand, and flower grade. The computer device determines the similarity between the first and second flower buckets based on the flower variety, flower brand, and flower grade included in the first flower bucket information and the flower variety, flower brand, and flower grade included in the second flower bucket information.

[0089] Optionally, with respect to the flower varieties, the computer device determines a first similarity parameter between the first flower bucket and the second flower bucket based on the flower varieties included in the first flower bucket information and the flower varieties included in the second flower bucket information. For example, the computer device determines the degree of similarity between the first and second flower buckets in terms of flower variety based on the flower varieties included in the first flower bucket information and the flower varieties included in the second flower bucket information in conjunction with the Engler system, and further determines the first similarity parameter based on the degree of similarity. For example, combined with the "kingdom, phylum, class, order, family, genus, and species" divided by the Engler system, the value of the first similarity parameter is an integer between 0 and 7. When the flower varieties are of the same species, the first similarity parameter between the first flower bucket and the second flower bucket is 7; when the flower varieties are of the same genus but different species, the first similarity parameter between the first flower bucket and the second flower bucket is 6; when the flower varieties are of the same family but different genera, the first similarity parameter between the first flower bucket and the second flower bucket is 5; when the flower varieties are of the same order but different families, the first similarity parameter between the first flower bucket and the second flower bucket is 4; when the flower varieties are of the same class but different orders, the first similarity parameter between the first flower bucket and the second flower bucket is 3; when the flower varieties are of the same phylum but different classes, the first similarity parameter between the first flower bucket and the second flower bucket is 2; when the flower varieties are of the same kingdom but different phylum, the first similarity parameter between the first flower bucket and the second flower bucket is 1; and when the flower varieties are of different kingdoms, the first similarity parameter between the first flower bucket and the second flower bucket is 0.

[0090] Optionally, with respect to flower grade, if the flower varieties included in the first flower bucket information and the flower varieties included in the second flower bucket information are the same, the computer device determines a second similarity parameter between the first and second flower buckets based on the flower grades included in the first and second flower bucket information. Exemplarily, the computer device determines the degree of similarity between the first and second flower buckets in terms of flower grade based on the flower grades included in the first and second flower bucket information, in conjunction with a grade classification standard, and further determines the second similarity parameter based on this degree of similarity. For example, if flower grades are classified into A, B, and C based on the grade classification standard, the second similarity parameter is an integer between 0 and 2. For identical flower grades, the second similarity parameter between the first and second flower buckets is 2; for grades A and B, or B and C, the second similarity parameter between the first and second flower buckets is 1; and for grades A and C, the second similarity parameter between the first and second flower buckets is 0.

[0091] Optionally, for flower brands, the computer device determines a third similarity parameter between the first and second flower buckets based on the flower brand included in the first flower bucket information and the flower brand included in the second flower bucket information. Exemplarily, the computer device determines whether the first and second flower buckets belong to the same flower brand based on the flower brand included in the first flower bucket information and the flower variety included in the second flower bucket information, and further determines the third similarity parameter between the first and second flower buckets. For example, the third similarity parameter can take a value of 0 or 1. If the flower brands are the same, the third similarity parameter between the first and second flower buckets is 1, and if the flower brands are different, the third similarity parameter between the first and second flower buckets is 0.

[0092] Optionally, after obtaining the first, second, and third similarity parameters, the computer device determines the similarity between the first and second flower buckets based on the sum of the first, second, and third similarity parameters. Exemplarily, the computer device directly determines the sum of the first, second, and third similarity parameters as the similarity between the first and second flower buckets. Of course, in other possible implementations, the computer device may also convert the sum of the first, second, and third similarity parameters into a percentage, and use the percentage to represent the similarity between the first and second flower buckets.

[0093] Optionally, in an embodiment of the present application, since the influence of flower variety on similarity is greater than the influence of flower grade on similarity, and the influence of flower grade on similarity is greater than the influence of flower brand on similarity, the maximum value of the first similarity parameter is greater than the maximum value of the second similarity parameter, and the maximum value of the second similarity parameter is greater than the maximum value of the third similarity parameter.

[0094] 4. Based on the location of the second flower bucket with the greatest similarity in the storage lane, determine the location of the first flower bucket in the storage lane.

[0095] In this embodiment of the present application, after obtaining the similarity between the first and second flower buckets, the computer device determines the storage location of the first flower bucket in the storage lane based on the storage location of the second flower bucket with the greatest similarity in the storage lane. The distance between the first and second flower buckets is negatively correlated with the similarity between the first and second flower buckets; that is, the greater the similarity between the first and second flower buckets, the smaller the distance between the first and second flower buckets.

[0096] In one possible embodiment, the distance between the flower buckets is represented by the length of the interval. Optionally, after determining the second flower bucket with the greatest similarity based on the obtained similarities, the computer device uses the flower bucket number of the second flower bucket with the greatest similarity as an index to obtain the storage location of the second flower bucket in the storage lane from the information stored in the above-mentioned information storage device. The computer device then determines the length distance between the first and second flower buckets based on the similarities, and further determines the storage location of the first flower bucket in the storage lane based on the length distance. Exemplarily, the second flower bucket information includes the second flower bucket number.

[0097] In another possible embodiment, the distance between the flower buckets is represented by the number of storage locations between them. Optionally, after determining the second flower bucket with the greatest similarity based on the obtained similarities, the computer device uses the flower bucket number of the second flower bucket with the greatest similarity as an index to obtain the storage location of the second flower bucket in the storage lane from the information stored in the information storage device. Furthermore, the computer device determines the number of storage locations between the first and second flower buckets based on the similarities, and further determines the storage location of the first flower bucket in the storage lane based on the number of storage locations.

[0098] Of course, in other possible implementations, the distance between the flower barrels is also characterized by the length of the interval and the number of interval storage locations. Optionally, after obtaining the storage location of the second flower barrel with the greatest similarity in the storage lane, the computer device determines the number of storage locations between the first flower barrel and the second flower barrel based on the similarity, determines the candidate storage location corresponding to the first flower barrel based on the storage location data, and determines the candidate storage location as the storage location of the first flower barrel in the storage lane if the candidate storage location is empty. If the candidate storage location is not empty, the length distance between the first flower barrel and the second flower barrel is determined based on the similarity, and the storage location of the first flower barrel in the storage lane is determined based on the length distance in different layers. It should be noted that when determining the storage location corresponding to the first flower barrel in different layers, the selection range of the number of layers satisfies the number of storage locations determined based on the height of the first flower barrel.

[0099] Optionally, the computer device may also determine the storage location of the first flower bucket in the storage lane based on the demand for flowers.

[0100] Optionally, in the absence of a similarity greater than a similarity threshold, the computer device obtains the flower type corresponding to the first flower bucket based on the first flower bucket information. The similarity threshold can be an arbitrary value, and the similarity threshold can be flexibly set and adjusted according to actual conditions. Exemplarily, the similarity threshold is determined based on the flower variety and flower grade, and the sum of the maximum value of the above-mentioned first similarity parameter and the maximum value of the above-mentioned second similarity parameter is determined as the similarity threshold. That is, in the absence of a similarity greater than the similarity threshold, the computer device determines that there is no second flower bucket in the storage lane that is the same as the first flower bucket in the two dimensions of flower variety and flower grade, and then subsequently determines the storage location of the first flower bucket in the storage lane based on the demand for flowers.

[0101] Optionally, after obtaining the flower type corresponding to the first flower bucket, the computer device determines the predicted demand for the flower type corresponding to the first flower bucket based on the historical demand parameters of the flower type corresponding to the first flower bucket. The historical demand parameters include the demand for flowers on each day, and the predicted demand refers to the average demand for flowers. Exemplarily, the computer device uses the flower type of the first flower bucket as an index to obtain the historical demand parameters of the flower type from the completed order information. The historical demand parameters include the demand for the flower type on each day within m days. After that, the historical demand parameters are averaged to obtain the predicted demand for the flower type. Wherein, m is an arbitrary value, and the value of m can be flexibly set and adjusted according to actual conditions. This embodiment of the present application does not limit this.

[0102] Optionally, after obtaining the predicted demand for the flower type in the first flower bucket, the computer device determines the storage location of the first flower bucket in the inbound lane based on the predicted demand. The distance between the first flower bucket and the outbound lane is negatively correlated with the predicted demand; that is, the greater the predicted demand, the smaller the distance between the first flower bucket and the outbound lane. Optionally, the distance between the flower bucket and the outbound lane can also be represented by the length of the interval or the number of interval storage locations, which is not limited in this embodiment of the present application.

[0103] Optionally, when there is a similarity less than or equal to a similarity threshold, the computer device determines the storage location of the first flower bucket in the storage lane based on the storage location corresponding to the second flower bucket with the greatest similarity.

[0104] To sum up, in the technical solution provided in the embodiment of the present application, the height of the first flower barrel is used to determine the storage level of the first flower barrel in the storage aisle, and within the range of the storage level, the storage location corresponding to the first flower barrel is determined based on the similarity between the second flower barrel and the first flower barrel. The first flower barrel is placed around the second flower barrel with greater similarity, which is conducive to clustering storage of flower barrels and facilitates the subsequent acquisition of flowers based on orders to avoid the problem of the same or similar flowers being too far apart, resulting in a long time required to complete the order, which is conducive to improving the efficiency of order completion.

[0105] In addition, the first similarity parameter, the second similarity parameter and the third similarity parameter are obtained respectively through the flower variety, flower grade and flower brand, and then the similarity between the flower buckets is determined based on the three similarity parameters, that is, the similarity between the flower buckets is determined based on three different dimensions, which improves the accuracy of the obtained similarity and is conducive to allocating a more accurate and reasonable storage location to the first flower bucket based on accurate similarity.

[0106] In addition, the predicted demand is determined by the historical demand parameters of the flower type, and when the predicted demand is high, the first flower bucket is placed close to the delivery port. This makes it easier for flowers with high demand to be delivered quickly, which is conducive to improving the efficiency of subsequent order completion.

[0107] Please refer to Figure 3 , which shows a flow chart of a flower bucket allocation method provided by another embodiment of the present application. Figure 1 The computer device 40 in the flower bucket distribution system shown. The method may include the following steps (301-305):

[0108] Step 301: Obtain information of the first flower bucket.

[0109] Step 302: Based on the information of the first flower bucket, determine the storage lane for the first flower bucket from at least two lanes.

[0110] Step 303: Based on the information of the first flower bucket, determine the storage location of the first flower bucket in the storage lane.

[0111] The above steps 301-303 are Figure 2 Steps 201-203 in the embodiment are similar, see Figure 2 The embodiments are not described in detail here.

[0112] Step 304: Obtain information of the third flower bucket.

[0113] A third flower bucket refers to a flower bucket not stored in an alley. In this embodiment, the third flower bucket refers to a flower bucket that is allocated after the first flower bucket. The third flower bucket information indicates the number and attributes of flowers contained in the third flower bucket.

[0114] In this embodiment of the present application, after obtaining the first flower bucket information, the computer device obtains the third flower bucket information. Optionally, similar to the first flower bucket information, the third flower bucket has corresponding identification information, and the computer device scans the identification information corresponding to the third flower bucket using a scanning device to obtain the third flower bucket information.

[0115] Step 305: When the information of the third flower bucket is the same as that of the first flower bucket and the adjacent storage location of the first flower bucket is empty, the adjacent storage location is determined as the storage location corresponding to the third flower bucket.

[0116] In this embodiment of the present application, after obtaining the third flower bucket information, if the third flower bucket information is identical to the first flower bucket information and the adjacent storage location of the first flower bucket is empty, the computer device determines the adjacent storage location as the storage location corresponding to the third flower bucket. The number of storage locations between the adjacent storage location and the storage location corresponding to the first flower bucket is zero.

[0117] Optionally, the flower bucket information being identical may be completely identical or partially identical. For example, when the flower variety, flower grade, and flower brand are identical, the computer device may determine that the third flower bucket information is identical to the first flower bucket information.

[0118] Optionally, after determining that the third flower bucket information is the same as the first flower bucket information, the computer device, if determining that the storage location allocation for the first flower bucket has been completed, detects whether an adjacent storage location of the first flower bucket is empty. If the adjacent storage location is empty, it is determined that no flower bucket is placed in the adjacent storage location, and the adjacent storage location is determined as the storage location corresponding to the third flower bucket. Optionally, if determining that the storage location allocation for the first flower bucket is not complete, the computer device waits until the storage location allocation for the first flower bucket is complete before determining whether to determine the adjacent storage location as the storage location corresponding to the third flower bucket.

[0119] Optionally, when the third flower bucket information is different from the first flower bucket information, or the adjacent storage location of the first flower bucket is not empty, the computer device determines the third flower bucket as the new first flower bucket and repeats the above steps 302 and 303 to allocate a storage location to the third flower bucket.

[0120] To sum up, in the technical solution provided by the embodiment of the present application, for the third flower bucket having the same flower bucket information as the first flower bucket, when the adjacent storage location of the first flower bucket is empty, the third flower bucket is determined to follow the first flower bucket into the warehouse, and the adjacent storage location is determined as the storage location corresponding to the third flower bucket, which is beneficial to saving the time required for the overall flower bucket allocation, reducing the amount of calculation for flower bucket allocation, and improving the efficiency of flower bucket storage; moreover, the same flower buckets are marked with flower bucket information, and there is no need to manually place the same flower buckets in adjacent positions, saving human resources.

[0121] Please refer to Figure 4, which shows a flow chart of a flower bucket allocation method provided by another embodiment of the present application. Figure 1 The computer device 40 in the flower bucket distribution system shown. The method may include the following steps (401-406):

[0122] Step 401: Obtain information of the first flower bucket.

[0123] Step 402: Based on the information of the first flower bucket, determine the storage lane for the first flower bucket from at least two lanes.

[0124] Step 403: Based on the information of the first flower bucket, determine the storage location of the first flower bucket in the storage lane.

[0125] The above steps 401-403 are Figure 2 Steps 201-203 in the embodiment are similar, see Figure 2 The embodiments are not described in detail here.

[0126] Step 404: When a target order is detected, the demand information of the target order for flowers is obtained.

[0127] A target order refers to any order. Optionally, the target order is an order generated remotely by the flower demander. In this embodiment of the present application, upon detecting the target order, the computer device obtains the flower demand information for the target order. Exemplarily, the demand information includes the desired flower variety, flower grade, flower brand, and flower quantity.

[0128] Step 405 : Determine at least one lane that meets the requirement information from the at least two lanes as a second candidate lane.

[0129] In an embodiment of the present application, after obtaining demand information corresponding to the target order, the computer device determines at least one lane that meets the demand information from at least two lanes as a second candidate lane.

[0130] Optionally, satisfying the demand information means being able to independently supply flowers for the order, i.e., the lane that satisfies the demand information contains all the flowers required for the target order. Exemplarily, the computer device identifies at least one lane that satisfies the demand information as a second candidate lane based on the flower storage information corresponding to each lane.

[0131] Step 406: The second candidate lane with the smallest task volume is determined as the delivery lane for the target order.

[0132] In this embodiment of the present application, after obtaining the aforementioned second candidate lanes, the computer device determines the second candidate lane with the smallest task load as the delivery lane for the target order. Optionally, the computer device uses the lane number of each second candidate lane as an index to retrieve the pending tasks for each second candidate lane from information stored in the task management device. Based on the pending tasks, the computer device then determines the task load for each second candidate lane and determines the second candidate lane with the smallest task load as the delivery lane for the target order. Exemplarily, the pending tasks include the aforementioned flower bucket shelving task and the aforementioned flower bucket removal task.

[0133] Optionally, the tasks to be executed include tasks currently being executed and tasks not yet executed. When determining the task volume for the second candidate lane, for tasks currently being executed, the computer device obtains the execution progress corresponding to the currently executing task and, based on the execution progress, determines the workload corresponding to the unexecuted portion of the currently executing task. For tasks not yet executed, the computer device directly obtains the workload corresponding to the unexecuted task. Furthermore, the computer device determines the sum of the workload corresponding to the unexecuted portion of the currently executing task and the workload corresponding to the unexecuted task as the task volume for the second candidate lane.

[0134] To sum up, in the technical solution provided in the embodiment of the present application, the target order is allocated an outbound lane based on the demand information of the target order for flowers, and the lane that meets the demand information and has the smallest task volume is determined as the outbound lane of the target order. On the one hand, the flowers required for the target order can be found based on one lane, which is conducive to improving the efficiency of order completion. On the other hand, it is conducive to evenly distributing tasks to the lanes, and trying to avoid waste of resources caused by lanes being too idle.

[0135] Please refer to Figure 5 , which shows a flow chart of a flower bucket allocation method provided by another embodiment of the present application. Figure 1 The computer device 40 in the flower bucket distribution system shown. The method may include the following steps (501-504):

[0136] Step 501: Obtain information of the first flower bucket.

[0137] Step 502: Based on the information of the first flower bucket, determine the storage lane for the first flower bucket from at least two lanes.

[0138] Step 503: Based on the information of the first flower bucket, determine the storage location of the first flower bucket in the storage lane.

[0139] The above steps 501-503 are Figure 2 Steps 201-203 in the embodiment are similar, see Figure 2 The embodiments are not described in detail here.

[0140] Step 504: Generate storage location display information of the incoming lane based on the flower storage information of the incoming lane.

[0141] Optionally, after determining that the first flower bucket has been placed in the corresponding storage location, the first flower bucket is replaced with a newly placed second flower bucket. The computer device obtains second flower bucket information based on the newly placed second flower bucket and updates the flower storage information for the incoming lane based on the newly obtained second flower bucket information and its corresponding incoming lane and storage location. In this embodiment of the present application, the computer device generates storage location display information for the incoming lane based on the flower storage information for the incoming lane.

[0142] The storage location display information is used to display the occupancy status of the storage location. In the embodiment of the present application, the storage location display information includes first display information for indicating whether the storage location is occupied, and second display information for indicating the flower bucket information corresponding to the occupied storage location. For example, Figure 6 As shown, the display interface corresponding to the storage lane includes a plurality of virtual storage locations 61 for representing actual storage locations, and the first display information based on the storage location display information displays the occupancy status of the virtual storage location, which includes occupied, vacant, locked, and disabled. Among them, locked means prohibiting the shelving or unshelving operations of flower buckets for the storage location, and disabled means prohibiting the placement of flower buckets on the storage location. Exemplarily, in response to a touch operation on a certain virtual storage location 61, the flower bucket information 62 corresponding to the virtual storage location 61 is displayed based on the second display information in the storage display information. Exemplarily, the touch operation can be a single-click operation, a double-click operation, a long press operation, etc., which is not limited in this embodiment of the present application. Optionally, the above-mentioned user interface can be displayed on a large screen shared by multiple people, or on a client suitable for a single person, which is not limited in this embodiment of the present application.

[0143] For example, Figure 6 As shown, the user interface may also display task execution information 63 to indicate the task number, task, start location, target location, execution status, etc. For example, each storage location has a specific number.

[0144] To sum up, in the technical solution provided in the embodiment of the present application, storage location display information is generated through flower storage information to display whether the storage location in the storage lane is occupied, as well as the flower bucket information corresponding to the occupied storage location, so as to facilitate more intuitive and accurate grasp of the flower storage situation in the storage lane.

[0145] The following are device embodiments of the present application, which can be used to implement the method embodiments of the present application. For details not disclosed in the device embodiments of the present application, please refer to the method embodiments of the present application.

[0146] Please refer to Figure 7, which shows a block diagram of a flower bucket allocation device provided in one embodiment of the present application. This device implements the aforementioned flower bucket allocation method. This functionality can be implemented in hardware or by hardware executing corresponding software. This device can be the aforementioned computer device or be incorporated into a computer device. The device can include: an information acquisition module 710, a lane allocation module 720, and a storage location allocation module 730.

[0147] The information acquisition module 710 is used to obtain first flower bucket information, where the first flower bucket information is used to indicate the number and attribute information of flowers contained in the first flower bucket; wherein the first flower bucket includes at least one flower.

[0148] The lane allocation module 720 is used to determine the storage lane for the first flower bucket from at least two lanes based on the first flower bucket information; wherein the storage lane is used to store the first flower bucket, and one lane includes at least one stereoscopic storage.

[0149] The storage location allocation module 730 is used to determine the storage location of the first flower bucket in the storage lane based on the first flower bucket information; wherein the three-dimensional warehouse includes at least two storage locations, and one storage location is used to place one flower bucket.

[0150] In an exemplary embodiment, as Figure 8 As shown, the lane allocation module 720 includes: an information acquisition unit 721 , a candidate determination unit 722 and a lane determination unit 723 .

[0151] The information acquisition unit 721 is used to acquire the flower storage information corresponding to each lane.

[0152] The candidate determining unit 722 is configured to determine at least one first candidate lane corresponding to the first flower bucket from the at least two lanes based on the flower storage information and the first flower bucket information.

[0153] The lane determining unit 723 is configured to determine the entry lane from the at least one first candidate lane based on the task volume of each candidate lane.

[0154] In an exemplary embodiment, the candidate determination unit 722 is configured to:

[0155] Determining the flower type corresponding to the first flower bucket based on the first flower bucket information;

[0156] Based on the flower storage information, determining the storage capacity of each lane for the flower type corresponding to the first flower barrel;

[0157] At least one lane having a storage volume less than a storage threshold among the at least two lanes is determined as the first candidate lane.

[0158] In an exemplary embodiment, the lane determining unit 723 is configured to:

[0159] Obtaining tasks to be executed for each of the first candidate lanes;

[0160] Determining the task volume of each of the first candidate lanes based on the workload of the tasks to be performed;

[0161] The first candidate lane with the smallest task volume is determined as the entry lane.

[0162] In an exemplary embodiment, as Figure 8 As shown, the storage location allocation module 730 includes: a layer number determination unit 731, a flower barrel acquisition unit 732, a similarity determination unit 733 and a storage location determination unit 734.

[0163] The layer number determining unit 731 is used to determine the number of storage layers of the first flower barrel in the storage lane based on the height of the first flower barrel.

[0164] The flower bucket obtaining unit 732 is used to obtain information of at least one second flower bucket based on the number of storage locations; wherein the second flower bucket refers to a flower bucket stored in the storage lane.

[0165] The similarity determination unit 733 is configured to determine the similarity between each second flower bucket and the first flower bucket based on the first flower bucket information and the at least one second flower bucket information.

[0166] The storage location determination unit 734 is used to determine the storage location of the first flower bucket in the storage lane based on the storage location of the second flower bucket with the greatest similarity in the storage lane; wherein the distance between the first flower bucket and the second flower bucket is negatively correlated with the similarity between the first flower bucket and the second flower bucket.

[0167] In an exemplary embodiment, the similarity determination unit 733 is configured to:

[0168] determining a first similarity parameter between the first flower bucket and the second flower bucket based on the flower varieties included in the first flower bucket information and the flower varieties included in the second flower bucket information;

[0169] When the flower variety included in the first flower bucket information and the flower variety included in the second flower bucket information are the same, determining a second similarity parameter between the first flower bucket and the second flower bucket based on the flower grade included in the first flower bucket information and the flower grade included in the second flower bucket information;

[0170] determining a third similarity parameter between the first flower bucket and the second flower bucket based on the flower brand included in the first flower bucket information and the flower brand included in the second flower bucket information;

[0171] The similarity between the first flower bucket and the second flower bucket is determined based on the sum of the first similarity parameter, the second similarity parameter, and the third similarity parameter.

[0172] In an exemplary embodiment, as Figure 8 As shown, the storage location allocation module 730 further includes: a type determination unit 735 and a demand forecasting unit 736.

[0173] The type determining unit 735 is configured to obtain the flower type corresponding to the first flower bucket based on the first flower bucket information when there is no similarity greater than a similarity threshold.

[0174] The demand prediction unit 736 is configured to determine a predicted demand for the flower type corresponding to the first flower bucket based on a historical demand parameter of the flower type corresponding to the first flower bucket.

[0175] The storage location determination unit 734 is further used to determine the storage location of the first flower barrel in the storage lane based on the predicted demand; wherein, the distance between the first flower barrel and the storage outlet is negatively correlated with the predicted demand.

[0176] In an exemplary embodiment, the information acquisition module 710 is also used to obtain the information of the third flower bucket; wherein the third flower bucket refers to a flower bucket that is not stored in the alley; the storage location allocation module 730 is also used to determine the adjacent storage location as the storage location corresponding to the third flower bucket when the information of the third flower bucket is the same as the information of the first flower bucket and the adjacent storage location of the first flower bucket is empty.

[0177] In an exemplary embodiment, as Figure 8 As shown, the device further includes: a demand acquisition module 740 , a lane screening module 750 and an order allocation module 760 .

[0178] The demand acquisition module 740 is configured to acquire demand information for flowers of the target order when a target order is detected.

[0179] The lane screening module 750 is configured to determine at least one lane that meets the requirement information from the at least two lanes as a second candidate lane.

[0180] The order allocation module 760 is configured to determine the second candidate lane with the smallest task volume as the outbound lane for the target order.

[0181] In an exemplary embodiment, as Figure 8 As shown, the device further includes: an information generating module 770.

[0182] The information generation module 770 is used to generate the storage location display information of the storage lane based on the flower storage information of the storage lane; wherein the storage location display information includes first display information for indicating whether the storage location is occupied, and second display information for indicating the flower bucket information corresponding to the occupied storage location.

[0183] To sum up, in the technical solution provided by the embodiment of the present application, the first flower bucket information is used to allocate a corresponding storage location to the first flower bucket, thereby realizing the automatic determination of the flower bucket placement position, saving manpower, reducing the consumption of human resources, and being conducive to allocating more human resources to other related processes of flowers (such as flower delivery process, grading process, packaging process, etc.), thereby indirectly improving the overall processing efficiency of flowers; moreover, the first flower bucket information is used to indicate the attribute information of the flowers contained in the first flower bucket, first allocating a storage lane for the first flower bucket based on the attribute information, and then allocating a storage location for the first flower bucket from the storage lane based on the attribute information, and the storage location allocation process is gradually refined, which is conducive to improving the accuracy of flower bucket allocation, so that the flower buckets can be placed in the correct and appropriate positions.

[0184] In an exemplary embodiment, a computer device is further provided. The computer device includes a processor and a memory. A computer program is stored in the memory. The computer program is loaded and executed by the processor to implement the above-mentioned flower bucket allocation method.

[0185] In an exemplary embodiment, a non-transitory computer-readable storage medium is further provided, on which a computer program is stored. When the computer program is executed by a processor, the above-mentioned flower bucket allocation method is implemented.

[0186] In an exemplary embodiment, a computer program product is further provided. When the computer program product is executed, a computer device is enabled to execute the above-mentioned flower bucket allocation method.

[0187] The above embodiments are only for illustrating the technical concept and features of the present invention, and their purpose is to enable people familiar with this technology to understand the content of the present invention and implement it accordingly, and they are not intended to limit the scope of protection of the present invention. For those skilled in the art, it is obvious that the present invention is not limited to the details of the above exemplary embodiments, and the present invention can be implemented in other specific forms without departing from the spirit or basic characteristics of the present invention. Therefore, no matter from which point of view, the embodiments should be regarded as exemplary and non-restrictive. The scope of the present invention is defined by the appended claims rather than the above description, and it is intended that all changes that fall within the meaning and scope of the equivalent elements of the claims are included in the present invention.

Claims

1. A flower bucket distribution method, characterized in that: The method comprises: Acquire first flower bucket information, where the first flower bucket information is used to indicate the number and attribute information of flowers contained in the first flower bucket; wherein the first flower bucket includes at least one flower; Based on the information of the first flower bucket, determining a storage lane for the first flower bucket from at least two lanes; wherein the storage lane is used to store the first flower bucket, and one lane includes at least one stereoscopic storage; Based on the information of the first flower bucket, determining the storage location of the first flower bucket in the storage lane; wherein the three-dimensional storage includes at least two storage locations, one storage location is used to place one flower bucket; Wherein, determining the storage lane for the first flower bucket from at least two lanes based on the first flower bucket information includes: Obtaining flower storage information corresponding to each lane; Based on the flower storage information and the first flower bucket information, determining at least one first candidate lane corresponding to the first flower bucket from the at least two lanes; Determining the entry lane from the at least one first candidate lane based on the task volume of each candidate lane; Wherein, determining the storage location of the first flower bucket in the storage lane based on the first flower bucket information includes: Determining the number of storage levels of the first flower barrel in the storage lane based on the height of the first flower barrel; Based on the number of storage locations, information of at least one second flower bucket is obtained; wherein the second flower bucket refers to a flower bucket stored in the storage lane; Based on the first flower bucket information and the at least one second flower bucket information, respectively determining the similarity between each second flower bucket and the first flower bucket; The position of the first flower barrel in the storage lane is determined based on the position of the second flower barrel with the greatest similarity in the storage lane; wherein the distance between the first flower barrel and the second flower barrel is negatively correlated with the similarity between the first flower barrel and the second flower barrel; The step of respectively obtaining the similarity between each of the second flower bucket information and the first flower bucket information includes: determining a first similarity parameter between the first flower bucket and the second flower bucket based on the flower varieties included in the first flower bucket information and the flower varieties included in the second flower bucket information; When the flower variety included in the first flower bucket information and the flower variety included in the second flower bucket information are the same, determining a second similarity parameter between the first flower bucket and the second flower bucket based on the flower grade included in the first flower bucket information and the flower grade included in the second flower bucket information; determining a third similarity parameter between the first flower bucket and the second flower bucket based on the flower brand included in the first flower bucket information and the flower brand included in the second flower bucket information; The similarity between the first flower bucket and the second flower bucket is determined based on the sum of the first similarity parameter, the second similarity parameter, and the third similarity parameter.

2. The method according to claim 1, characterized in that The determining, based on the flower storage information and the first flower bucket information, at least one first candidate lane corresponding to the first flower bucket from the at least two lanes includes: Determining the flower type corresponding to the first flower bucket based on the first flower bucket information; Based on the flower storage information, determining the storage capacity of each lane for the flower type corresponding to the first flower barrel; At least one lane of the at least two lanes having a storage volume less than a storage threshold is determined as the first candidate lane.

3. The method according to claim 1, characterized in that The determining the entry lane from the at least one first candidate lane based on the task amount of each candidate lane includes: Obtaining tasks to be executed for each of the first candidate lanes; Determining the task volume of each of the first candidate lanes based on the workload of the tasks to be performed; The first candidate lane with the smallest task volume is determined as the entry lane.

4. The method according to claim 1, wherein The method further comprises: When there is no similarity greater than the similarity threshold, obtaining the flower type corresponding to the first flower bucket based on the first flower bucket information; determining a predicted demand for the flower type corresponding to the first flower bucket based on a historical demand parameter for the flower type corresponding to the first flower bucket; Based on the predicted demand, the storage position of the first flower barrel in the storage lane is determined; wherein, the distance between the first flower barrel and the storage outlet is negatively correlated with the predicted demand.

5. The method according to any one of claims 1 to 4, characterized in that The method further comprises: Obtain information about the third flower bucket; wherein the third flower bucket refers to a flower bucket that is not stored in the alley; When the information of the third flower bucket is the same as the information of the first flower bucket and the adjacent storage location of the first flower bucket is empty, the adjacent storage location is determined as the storage location corresponding to the third flower bucket.

6. The method according to any one of claims 1 to 4, characterized in that The method further comprises: When a target order is detected, obtaining demand information for flowers from the target order; determining, from the at least two lanes, at least one lane that meets the requirement information as a second candidate lane; The second candidate lane with the smallest task volume is determined as the outbound lane for the target order.

7. The method according to any one of claims 1 to 4, characterized in that The method further comprises: Based on the flower storage information of the storage lane, generating storage location display information of the storage lane; The storage location display information includes first display information for indicating whether the storage location is occupied, and second display information for indicating the flower bucket information corresponding to the occupied storage location.

8. A flower bucket dispensing device, characterized in that: The flower bucket dispensing device is used to implement the method according to any one of claims 1 to 7, and the device comprises: An information acquisition module is used to acquire first flower bucket information, where the first flower bucket information is used to indicate the number and attribute information of flowers contained in the first flower bucket; wherein the first flower bucket includes at least one flower; A lane allocation module is configured to determine, based on the information of the first flower bucket, a storage lane for the first flower bucket from at least two lanes; wherein the storage lane is used to store the first flower bucket, and one lane includes at least one stereoscopic storage; The storage location allocation module is used to determine the storage location of the first flower bucket in the storage lane based on the first flower bucket information; wherein the three-dimensional warehouse includes at least two storage locations, and one storage location is used to place one flower bucket.

9. A computer device, characterized in that: The computer device includes a processor and a memory, wherein a computer program is stored in the memory, and the computer program is loaded and executed by the processor to implement the method according to any one of claims 1 to 7.

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

Images