Warehouse space dynamic allocation system, warehouse space dynamic allocation method and electronic device

Abstract

The present disclosure is a warehouse space dynamic allocation system, a warehouse space dynamic allocation method and an electronic device. The warehouse space dynamic allocation system comprises a first system and a second system. The first system generates a handling instruction to make an object be handled from a source location to a destination location. The second system generates a handling task according to the handling instruction. After receiving the handling instruction, the second system judges whether the destination location in the handling instruction meets a change condition. When the change condition is met, an adaptation degree of each spare area in the warehouse equipment and the source location is calculated respectively. According to the calculation result, one of the spare areas is selected as a new destination location. The handling task is re-planned according to the new destination location, so that the object is changed from the source location to the new destination location.

Description

Technical Field

[0001] This invention relates to a distribution system, and more particularly to a dynamic distribution system, method and electronic device for dynamic distribution of storage space in warehousing equipment. Background Technology

[0002] In the current semiconductor manufacturing process, multiple process equipment, multiple manufacturing steps and multiple types of work-in-process (WIP) are required. Therefore, multiple temporary storage areas need to be provided in various locations within the factory to store WIP. These temporary storage areas can buffer the different time requirements between multiple manufacturing steps.

[0003] However, this manufacturing process is typically managed through a Manufacturing Execution System (MES) and a Material Control System (MCS). The MES optimizes scheduling calculations to determine how work-in-process (WIP) materials are moved and can transmit moving instructions to the MCS for execution. However, the production floor is constantly changing, causing previously issued moving instructions to become inadequate for the latest production demands, thus impacting production efficiency. Summary of the Invention

[0004] To address the aforementioned technical problems, this invention provides a dynamic warehouse space allocation system, a dynamic warehouse space allocation method, and an electronic device, overcoming the shortcomings of existing technologies.

[0005] This invention provides a dynamic allocation system for warehouse space, including a first system and a second system. The first system generates a handling instruction to move an object from a source location to a destination location. The second system is connected to the first system. Upon receiving the handling instruction, the second system generates a handling task based on the instruction, enabling a handling equipment control system and a warehouse equipment control system to control the operation of at least one handling device and at least one warehouse equipment according to the handling task. The warehouse equipment has multiple storage areas, one of which is the destination location, and at least one of the storage areas is a spare area. The handling equipment control system controls the handling device carrying the object to move along a path to move the object from the source location to the destination location. The second system is configured to perform the following: upon receiving the handling instruction, determine whether the destination location in the handling instruction meets the change conditions; if the change conditions are met, calculate the fit between each spare area and the source location; based on the result of the fit calculation, select one of the spare areas as a new destination location; and re-plan the handling task based on the new destination location, so that the handling equipment control system controls the object to be moved from the source location to the new destination location.

[0006] This invention provides a method for dynamically allocating warehouse space, comprising: a second system receiving a handling instruction generated by a first system to move an object from a source location to a destination location; the second system generating a handling task based on the handling instruction, so that a handling equipment control system and a warehouse equipment control system control the operation of at least one handling device and at least one warehouse equipment according to the handling task; the warehouse equipment having multiple storage areas, one of which is the destination location, and at least one of the multiple storage areas being a spare area; the handling equipment control system controlling the handling device carrying the object to move along a path, so that the object moves from the source location to the destination location. The second system generating the handling task includes: after receiving the handling instruction, determining whether the destination location in the handling instruction meets a change condition; when the change condition is met, calculating a fit degree between each spare area and the source location; selecting one of the spare areas as a new destination location based on the fit degree calculation result; and replanning the handling task based on the new destination location, so that the handling equipment control system controls the object to be moved from the source location to the new destination location.

[0007] This invention provides an electronic device, including a memory and a processor, wherein the processor executes instructions stored in the memory to implement a method for dynamically allocating storage space.

[0008] In summary, the dynamic allocation system, method, and electronic equipment for warehouse space provided in this embodiment of the invention determine whether the destination location needs to be changed in advance, and determine which spare area can be used as the new destination location through dynamic calculation of adaptability. This can effectively avoid the problem of excessive concentration of inventory and handling areas, thereby improving production efficiency.

[0009] To further understand the features and technical content of the present invention, please refer to the following detailed description and drawings of the present invention. However, the drawings provided are for reference and illustration only and are not intended to limit the present invention. Attached Figure Description

[0010] Figure 1 This is a schematic diagram of the architecture of a dynamic allocation system for warehouse space provided in an embodiment of the present invention.

[0011] Figure 2 A three-dimensional schematic diagram of the storage equipment is provided for embodiments of the present invention.

[0012] Figure 3 A schematic diagram of the usage status of the storage equipment is provided for an embodiment of the present invention.

[0013] Figure 4 A control flowchart for a dynamic allocation method of storage equipment is provided for embodiments of the present invention.

[0014] Figure 5 A control flowchart for determining whether the destination location needs to be changed is provided for embodiments of the present invention.

[0015] Figure 6 A three-dimensional schematic diagram of the storage capacity of the storage area is provided for embodiments of the present invention.

[0016] Figure 7 This diagram illustrates multiple real-time information pointers and their corresponding path cost values ​​for embodiments of the present invention.

[0017] Figure 8 This diagram illustrates multiple weight values ​​and corresponding path cost values ​​for embodiments of the present invention.

[0018] Figure 9 This invention provides a schematic diagram of the first action of a dynamic allocation system for warehouse space, as shown in the embodiments of the present invention.

[0019] Figure 10 This invention provides a schematic diagram of the second action of a dynamic allocation system for warehouse space, as shown in the embodiments of the present invention.

[0020] Figure 11 A schematic diagram of the third action of the dynamic allocation system for warehouse space is provided for embodiments of the present invention.

[0021] Figure 12 This invention provides a schematic diagram of the fourth action of a dynamic allocation system for warehouse space, as shown in the embodiments of the present invention.

[0022] Figure 13 A schematic diagram of the fifth action of the dynamic allocation system for warehouse space provided in this embodiment of the invention.

[0023] Figure 14 A schematic diagram of the sixth action of the dynamic allocation system for warehouse space provided in this embodiment of the invention.

[0024] Figure 15 A schematic diagram of the architecture of an electronic device is provided for embodiments of the present invention. Detailed Implementation

[0025] The following specific embodiments illustrate the implementation of the present invention. Those skilled in the art can understand the advantages and effects of the present invention from the content provided in this specification. The present invention can be implemented or applied through other different specific embodiments, and various details in this specification can also be modified and changed based on different viewpoints and applications without departing from the concept of the present invention. Furthermore, the accompanying drawings of the present invention are for simple illustrative purposes only and are not depictions of actual dimensions; this is stated in advance. The following embodiments will further describe the relevant technical content of the present invention in detail, but the content provided is not intended to limit the scope of protection of the present invention.

[0026] It should be understood that while terms such as "first," "second," and "third" may be used in this document to describe various components or signals, these components or signals should not be limited by these terms. These terms are primarily used to distinguish one component from another, or one signal from another. Furthermore, the term "or" as used herein should be interpreted to include, as appropriate, any combination of one or more of the related listed items.

[0027] This invention provides a dynamic storage space allocation system, a dynamic storage space allocation method, and an electronic device. The dynamic storage space allocation system dynamically manages the storage areas used in warehousing equipment. Compared to the traditional method of moving objects to the next priority storage area only when the storage area in the warehousing equipment is full, this system flexibly selects the most suitable storage area based on the transport path and the real-time operating information of the on-site equipment. This avoids the problem of excessive concentration of inventory and transport areas, thereby reducing equipment idle time and improving storage efficiency and production smoothness.

[0028] [Example of the architecture for a dynamic warehouse space allocation system]

[0029] Please see Figure 1 , Figure 1 This is a schematic diagram of the architecture of a dynamic storage space allocation system provided in an embodiment of the present invention. The dynamic storage space allocation system 14 described in this embodiment includes, for example, a first system 141 and a second system 142, with the first system 141 connected to the second system 142. The first system 141 can generate a handling instruction for the second system 142, whereby the handling instruction refers to controlling the movement of an object from a source location to a destination location. The second system 142 generates a handling task based on the received handling instruction. The second system 142 controls the handling equipment control system 16 and the storage equipment control system 18 respectively according to the handling instruction, causing the handling equipment control system 16 and the storage equipment control system 18 to control the operation of at least one handling device 161 and at least one storage device 181 according to the handling task.

[0030] It should be noted that the handling equipment control system 16 can control one or more handling equipment 161. For example, the handling equipment control system 16 can control the handling equipment 161 carrying objects to move along the path in the transport area, so that the objects are transported from the source location to the destination location according to the handling instructions. The storage equipment control system 18 can control one or more storage equipment 181. The storage equipment 181 has multiple storage areas for storing one or more objects. One of the multiple storage areas can be used as the destination location, and at least one of the multiple storage areas can be used as a spare area. The objects can be any combination of carriers and work-in-process (WIT). The carrier can be a cassette, but is not limited to this. In other embodiments, the carrier can be a pallet or other container for carrying objects, depending on the usage context. In addition, carriers and WIT can be classified and managed according to their size, weight, and processing priority. The system will automatically select the optimal handling path and storage location according to the characteristics of the objects, and can also quickly adjust the storage configuration and handling process according to new product specifications.

[0031] In one embodiment, the machine automation control system 12 can control the first system 141 to issue handling instructions to the second system 142 according to the production needs of the process equipment 10. The first system 141 may be a manufacturing execution system (MES), and the second system 142 may be a material control system (MCS).

[0032] Please see Figure 2 and Figure 3 , Figure 2 A three-dimensional schematic diagram of the storage equipment is provided for embodiments of the present invention. Figure 3 A schematic diagram of the usage status of the storage equipment is provided for an embodiment of the present invention.

[0033] Figure 2 and Figure 3 The storage equipment 181 shown includes multiple storage areas zn, and the capacity of each storage area zn can be the same or different. Figure 3Taking a first storage area zn1 and a second storage area zn2 as examples, each storage area zn can be formed by multiple physical storage cells (Shelves) SH, and each physical storage cell SH is the smallest basic storage unit that can store objects CA. Objects CA stored in a physical storage cell SH in the storage equipment 181 can be moved to another physical storage cell SH for storage via the control of the handling equipment 1811. The other physical storage cell SH can be in the same storage area or a different storage area. In other embodiments, the handling equipment 1811 in the storage equipment 181 can also move objects CA transported by the handling equipment 161 in the transport area to one of the physical storage cells SH in the storage equipment 181, or the handling equipment 1811 can also remove objects CA from one of the physical storage cells SH in the storage equipment 181 and move them to the handling equipment 161 for transport to another location.

[0034] In one embodiment, the handling equipment 161 of the handling equipment control system 16 is a device used as a transport area between multiple storage devices 181. This handling equipment 161 can be, but is not limited to, various types of automated guided vehicles such as OHCV, RGV, or MGV. The storage equipment control system 18 controls the handling equipment 1811 used in the storage devices 181 for retrieving or placing items in each physical storage cell SH. This can be a crane fork or other similar equipment.

[0035] In one embodiment, at least one of the multiple storage areas zn can be used as a backup area. For example, one or more storage areas zn in the same storage device 181 can be designated as backup areas, or at least one storage area zn in multiple different storage devices 181 can be designated as a backup area.

[0036] In one embodiment, the second system 142 can obtain the latest operating status of each handling device 161 through the handling equipment control system 16, such as the location of the handling device 161 and whether there is a carrying object CA. The second system 142 can also obtain the latest operating status of each storage area zn in each storage device 181 through the storage equipment control system 18, such as the number of physical storage cells SH occupied in the storage area zn.

[0037] It should be noted that when the second system 142 receives a handling instruction, it will generate a corresponding handling task based on real-time operational information. For example, the second system 142 can obtain the latest operating status of the handling equipment control system 16 and the storage equipment control system 18. Through this latest operating status, it can obtain real-time operational information and thus determine whether the storage area zn where the object CA is to be stored needs to be changed. If no change is needed, the object CA will be directly moved to the original storage area zn at the destination location; if a change is needed, the object CA will be moved to a new destination location, which may be, for example, a spare area within the same storage equipment 181 or a spare area within a different storage equipment 181.

[0038] [An Example of a Dynamic Warehouse Space Allocation Method]

[0039] Please see Figure 4 , Figure 4 A control flowchart for a dynamic allocation method of storage equipment is provided for embodiments of the present invention. Figure 4 The process described includes, for example, the steps described below, and can be used in conjunction with the dynamic allocation system for storage space in the foregoing embodiments.

[0040] Step S401: The second system 142 receives a handling instruction. For example, the first system 141 generates a handling instruction based on the production requirements of the machine automation control system 12 and provides it to the second system 142. After receiving the handling instruction, the second system 142 can dynamically generate the corresponding handling task based on real-time operating information.

[0041] Step S403: Determine if the destination location needs to be changed. When the second system 142 receives the handling instruction, it can know the source location and destination location of the object CA to be handled. At this time, the second system 142 will first determine whether the working status of the storage equipment 181 where the destination location is located meets the change conditions. If step S403 determines that it is yes, proceed to step S405; if step S403 determines that it is no, proceed to step S409.

[0042] Step S405: Calculate the fit. The second system 142 calculates the fit between each backup area and the source location. In one embodiment, the second system 142 obtains multiple real-time information pointers based on real-time operation information, and each real-time information pointer corresponds to a weight value. The second system 142 then calculates a value representing the fit by combining these real-time information pointers and weight values ​​using an expression.

[0043] Step S407: Select the most suitable backup area. The adaptation value of each backup area can be obtained from the execution result of step S405. For the second system 142, a backup area corresponding to one of the multiple adaptation values ​​can be selected, and this selected backup area is used as the new destination location for object relocation. The adaptation value selection method here prioritizes improving production efficiency from multiple adaptation values.

[0044] Step S409: Plan the transport task. For the second system 142, if the destination location determination does not need to be changed, the transport task planned by the second system 142 is to move the controlled object CA from the source location to the destination location. And if the destination location determination needs to be changed, the transport task planned by the second system 142 is to move the controlled object CA from the source location to the new destination location.

[0045] In one embodiment, the second system 142 can repeatedly execute the task before the transport task is actually completed. Figure 4 The method of dynamically allocating storage equipment allows for dynamic adjustment of the most suitable backup area to meet the latest work needs of the factory site in real time.

[0046] Please see Figure 5 , Figure 5 This invention provides a control flowchart for determining whether the destination location needs to be changed. Figure 4 The judgment method for step S403 is described here. Figure 5 Examples are provided, and please refer to them in conjunction with the examples. Figure 6 , Figure 6 A three-dimensional schematic diagram of the storage capacity of the storage area is provided for embodiments of the present invention.

[0047] Figure 6 This is a graph showing the distribution of occupied and available space in storage area zn. For example, the total number of physical shelves SH represents the total amount of usable space T0 in storage area zn. A first setting T1 and a second setting T2 represent the occupied space in storage area zn, respectively. Here, the first setting T1 is greater than the second setting T2, and the first setting T1 can be less than or equal to the total space T0. For instance, the first setting T1 can represent the maximum number of physical shelves SH that can store object CA in storage area zn, and the second setting T2 represents the number of physical shelves SH that can normally store object CA in storage area zn. The second setting T2 is also associated with whether to change the storage area zn as the new destination location.

[0048] Figure 5 The process shown includes, for example, the steps described below.

[0049] Step S4031: Determine whether the handling equipment 1811 at the destination location is operable. The second system 142 can determine whether the handling equipment at the destination location is operable by obtaining real-time operation information. For example, when the handling equipment 1811 of the storage equipment 181 at the destination location is not performing any picking or placing operations on the physical storage cell SH, it can be determined that the handling equipment 1811 at the destination location is in an operable state; conversely, when the handling equipment 1811 of the storage equipment 181 at the destination location is performing picking or placing operations on the physical storage cell SH, it can be determined that the handling equipment 1811 at the destination location is in an inoperable state. If step S4031 determines no, return to Figure 4 If step S409 is executed, then step S4033 is executed if step S4031 is determined to be true.

[0050] Step S4033: Determine whether the space occupied at the destination location is less than the first preset value T1. The second system 142 can determine whether the space occupied at the destination location is less than the first preset value T1 by obtaining real-time operation information. If step S4053 determines that it is not, then return to... Figure 4 If step S405 is executed, then step S4035 is executed if step S4033 is determined to be true.

[0051] Step S4035: Determine whether the space occupied at the destination location is greater than or equal to the second set value T2. The second system 142 can determine whether the space occupied at the destination location is greater than or equal to the second set value T2 by obtaining real-time operation information. If step S4035 determines that it is not, then return to... Figure 4 Step S409 is executed; if step S4035 determines that it is yes, then return to... Figure 4 Step S405 is executed.

[0052] Understandably, when the second system 142 determines that the destination location needs to be changed, the second system 142 will select one of the multiple backup areas as the new destination location, and will determine which one can be used as the new destination location by calculating the adaptability of each backup area. The following example illustrates how the adaptability is calculated.

[0053] Please see Figure 7 , Figure 7This diagram illustrates multiple real-time information pointers and their corresponding path cost values ​​for embodiments of the present invention. In this embodiment, the multiple real-time information pointers are, for example, a first real-time information pointer X1, a second real-time information pointer X2, a third real-time information pointer X3, and a fourth real-time information pointer X4. The first real-time information pointer X1 represents the path cost value of object CA from its current storage location (i.e., the source location) to its new destination location (backup area); the second real-time information pointer X2 represents the remaining space value of the storage area (backup area) at the new destination location; the third real-time information pointer X3 represents the load capacity value of the handling equipment at the new destination location; and the fourth real-time information pointer X4 represents the path cost value from the new destination location (backup area) to the destination location.

[0054] Furthermore, Figure 7 For example, consider a transport instruction that moves object CA from source location A to destination location E, with a spare area of ​​D. Figure 7 In this context, A represents the transport equipment currently at the location of object CA, B represents the transport equipment en route (i.e., the path from A to D), D represents the unfinished transport command of the transport equipment in the backup area, and E represents the transport equipment at the original destination location.

[0055] In one embodiment, the larger the value of the first real-time information pointer X1, the worse the fit; X1 can be regarded as the path cost from A to D. The larger the value of the second real-time information pointer X2, the better the fit; for example, X2 > 1, where X2 = total space - space occupied. The larger the value of the third real-time information pointer X3, the worse the fit; ideally, X3 should be as close to 0 as possible. The larger the value of the fourth real-time information pointer X4, the worse the fit; X4 can be regarded as the path cost from D to E.

[0056] Please see Figure 8 , Figure 8 This diagram illustrates multiple weight values ​​and their corresponding path cost values ​​for embodiments of the present invention. Figure 8 It is aimed at Figure 7 The weight values ​​corresponding to the real-time information pointers are explained below. Multiple weight values ​​are, for example, a first weight value W1, a second weight value W2, a third weight value W3, and a fourth weight value W4. Specifically, the first weight value W1 is the weight value of the path cost to the new destination location; the second weight value W2 is the weight value of the remaining space in the storage area at the new destination location; the third weight value W3 is the weight value of the load capacity of the handling equipment at the new destination location; and the fourth weight value W4 is the weight value of the path cost from the new destination location to the original destination location.

[0057] In one embodiment, the total value of each weight should be less than 100, and the magnitude of each weight is adjusted according to the importance of the real-time information pointer, as illustrated below.

[0058] The recommended value for the first weight value W1 is >= 50, and the maximum limit for W1 is <100 and the minimum limit is 1.

[0059] The suggested value for the second weight value W2 is (total number of spaces / ideal number of spaces) × 100, and the maximum limit for W2 is <100 and the minimum limit is 1.

[0060] The recommended value for the third weight value W3 is the number of exchange points between handling equipment / the number of handling equipment, and the maximum limit for W3 is <100 and the minimum limit is 1.

[0061] The recommended value for the fourth weight, W4, is to be set according to the degree of need to return to the original destination, and the maximum limit of W4 is <100 and the minimum limit is 0.

[0062] In one embodiment, the second system 142 can perform calculations on the first real-time information pointer X1, the second real-time information pointer X2, the third real-time information pointer X3, the fourth real-time information pointer X4, the first weight value W1, the second weight value W2, the third weight value W3, and the fourth weight value W4 according to the expression to obtain the adaptation value of each backup area. The expression is illustrated here using N backup areas as an example, and can be represented by formulas (a) to (b) below, where Zone1 represents the adaptation value of the first backup area, Zone2 represents the adaptation value of the second backup area, Zone3 represents the adaptation value of the third backup area, and ZoneN represents the adaptation value of the Nth backup area.

[0063] Zone1 = f(y1) = X1×W1 - X2×W2 + X3×W3 + X4×W4 ……… Formula (I)

[0064] Zone2=f(y2)=X1×W1-X2×W2+X3×W3+X4×W4………Formula (2)

[0065] Zone3 = f(y3) = X1×W1 - X2×W2 + X3×W3 + X4×W4 ………Formula (III)

[0066] ZoneN=f(yN)=X1×W1-X2×W2+X3×W3+X4×W4………Formula (4)

[0067] In one embodiment, the second system 142 can calculate the adaptation value of each backup area using the above formulas, and determine which backup area has the most suitable adaptation value, for example, the most suitable one is the adaptation value with the lowest value.

[0068] Next, an example will be given to illustrate how the dynamic allocation system for warehouse space determines the degree of fit.

[0069] Please refer to the following first. Figure 9 , Figure 9 This invention provides a schematic diagram of the first action of a dynamic allocation system for warehouse space, as shown in the embodiments of the present invention.

[0070] Figure 9 The storage equipment 181 shown is illustrated using a first storage equipment 181a, a second storage equipment 181b, and a third storage equipment 181c as examples. A first track R1 is provided on one side of the first storage equipment 181a, and a handling device CV1 can move within the handling area of ​​the first track R1. A second track R2 is provided between the first storage equipment 181a, the second storage equipment 181b, and the third storage equipment 181c, and a handling device CV3 can move within the handling area of ​​the second track R2.

[0071] When the second system 142 receives a transport instruction, and the transport instruction is to transport the controlled object CA from the source location S1 to the destination location D1, the destination location D1 is the first storage area zn1 of the second storage equipment 181b, and the second storage area zn2 of the second storage equipment 181b and the third storage area zn3 of the third storage equipment 181c are used as spare areas for the first storage area zn1.

[0072] Furthermore, it is assumed here that the first weight value W1 is 50%, the second weight value W2 is 30%, the third weight value W3 is 20%, and the fourth weight value W4 is 10%. The weight values ​​are set according to the information indicators on site, such as the setting method of the on-site process equipment, the setting of the spare area, and the operating capacity of each handling equipment.

[0073] In one embodiment, after the second system 142 receives the transport instruction, the second system 142 can perform path planning for the source location S1 of the object CA to be transported and the destination location D1 of the object to be transported in the transport instruction. For example, the original main transport instruction is divided into multiple smaller transport instructions to ensure that the object CA can be transported to the correct location by these multiple smaller transport instructions in relay.

[0074] Please see Figure 10 , Figure 10 This invention provides a schematic diagram of the second action of a dynamic allocation system for warehouse space, as shown in the embodiments of the present invention. Figure 10 Positions P1-P7 are used as exchange points, which are the locations where CA (Cardboard Interface) objects are moved between different devices. Furthermore, in this context... Figure 10This section describes the calculation method for the first real-time information pointer X1 in the first storage area zn1. Path L1 involves the transport device CV1 obtaining object CA at position P1 (i.e., source position S1) of the process equipment EQ and transporting it to position P2 of the first storage device 181a. Path L2 involves transporting object CA from position P2 of the first storage device 181a to position P3 of the first storage device 181a via the internal transport device CV2. Path L3 involves transporting object CA from position P3 of the first storage device 181a to position P4 of the second storage device 181b via the transport device CV3 of the second track R2. Path L4 involves transporting object CA from position P4 of the second storage device 181b to the first storage area zn1 (i.e., destination position) of the second storage device 181b via the transport device CV4 of the second storage device 181b.

[0075] Understandable is based on Figure 10 As shown, object CA is moved from source location S1 to the first storage area zn1 through segments via paths L1, L2, L3, L4, etc. Here, the path cost of each path L1, L2, L3, L4 is 10 for example. Therefore, it can be known that the first real-time information pointer X1 of the first storage area zn1 is equal to 40.

[0076] Please see Figure 11 , Figure 11 This provides a schematic diagram of the third action of a dynamic warehouse space allocation system according to an embodiment of the present invention. Further, in this... Figure 11 This section describes the calculation method for the first real-time information pointer X1 in the second storage area zn2. Path L1 involves the transport device CV1 retrieving the object CA from position P1 (i.e., source position S1) of the process equipment EQ and transporting it to position P2 of the first storage device 181a. Path L2 involves transporting the object CA from position P2 of the first storage device 181a to position P3 of the first storage device 181a via the internal transport device CV2. Path L3 involves transporting the object CA from position P3 of the first storage device 181a to position P5 of the second storage device 181b via the transport device CV3 of the second track R2. Path L4 involves transporting the object CA from position P5 of the second storage device 181b to the second storage area zn2 (i.e., the spare area) of the second storage device 181b via the transport device CV4 of the second storage device 181b.

[0077] Understandable is based on Figure 11As shown, the object is moved from the source location S1 to the second storage area zn2 in segments via paths L1, L2, L3, L4, etc. Here, the path cost of each path L1, L2, L3, L4 is 10 for example. Therefore, it can be known that the first real-time information pointer X1 of the second storage area zn2 is equal to 40.

[0078] Please see Figure 12 , Figure 12 This invention provides a schematic diagram of the fourth action of a dynamic warehouse space allocation system, as illustrated in an embodiment of the invention. Further, in this... Figure 12 This section describes the calculation method for the first real-time information pointer X1 in the third storage area zn3. Path L1 involves the transport device CV1 retrieving the object CA from position P1 (i.e., source position S1) of the process equipment EQ and transporting it to position P2 of the first storage device 181a. Path L2 involves transporting the object CA from position P2 of the first storage device 181a to position P3 of the first storage device 181a via the internal transport device CV2. Path L3 involves transporting the object CA from position P3 of the first storage device 181a to position P7 of the third storage device 181c via the transport device CV3 on the second track R2. Path L4 involves transporting the object CA from position P7 of the third storage device 181c to the third storage area zn3 (i.e., the spare area) of the third storage device 181c via the transport device CV5 of the third storage device 181c.

[0079] Understandable is based on Figure 12 As shown, the object CA is moved from the source location S1 to the third storage area zn3 in segments via paths L1, L2, L3, L4, etc. Here, the path cost of each path L1, L2, L3, L4 is 10 for example. Therefore, it can be known that the first real-time information pointer X1 of the third storage area zn3 is equal to 40.

[0080] Please see Figure 13 , Figure 13 This document provides a schematic diagram of the fifth action of a dynamic warehouse space allocation system, as provided in an embodiment of the present invention. Further, in this… Figure 13 This section explains the calculation method for the fourth real-time information pointer X4 in the second storage area zn2, where path L1 involves the transport device CV4 in the second storage device 181b moving the object CA from the second storage area zn2 to the first storage area zn1.

[0081] Understandable is based on Figure 13As shown, object CA is moved from the second storage area zn2 to the first storage area zn1 via path L1, and the path cost of path L1 is illustrated by 10. Therefore, it can be known that the fourth real-time information pointer X4 of the second storage area zn2 is equal to 10.

[0082] Please see Figure 14 , Figure 14 This invention provides a schematic diagram of the sixth action of a dynamic warehouse space allocation system, as illustrated in an embodiment of the present invention. Further, in this... Figure 14 This section explains the calculation method for the fourth real-time information pointer X4 in the third storage area zn3. Path L1 involves the transport device CV5 in the third storage device 181c moving object CA from the third storage area zn3 to position P6. Path L2 involves the transport device CV3 on the second track R2 moving object CA from position P6 to the exchange point P4 in the second storage device 181b. Path L3 involves the transport device CV4 in the second storage device 181b moving object CA from the exchange point P4 to the first storage area zn1 in the second storage device 181b.

[0083] Understandable is based on Figure 14 As shown, the object is moved from the third storage area zn3 of the third storage device 181c to the first storage area zn1 of the second storage device 181b via paths L1, L2, and L3. The path cost of L1, L2, and L3 is illustrated by 10. Therefore, it can be known that the fourth real-time information pointer X4 of the third storage area zn3 is equal to 30.

[0084] It should also be noted that the fourth real-time information pointer X4 of the first storage area zn1 is equal to 0. Since the new destination location of object CA is the same as the original destination location, no additional transportation cost will be incurred.

[0085] Therefore, based on the foregoing Figures 9 to 14 The relevant schematic diagram shows the values ​​of the first real-time information pointer and the fourth real-time information pointer related to the first storage area zn1, the second storage area zn2, and the third storage area zn3. Furthermore, it is assumed that the values ​​of the second real-time information pointer X2 and the third real-time information pointer X3 related to the first storage area zn1, the second storage area zn2, and the third storage area zn3 can be as shown in Table 1 below, where Table 1 also records the first real-time information pointer X1 and the fourth real-time information pointer X4.

[0086] First storage area Second storage area Third storage area X1 40 40 40 X2 2 10 100 X3 5 5 0 X4 0 10 30

[0087] Table 1

[0088] Next, by combining the relevant real-time information pointers recorded in Table 1 with the corresponding weight values, the adaptation values ​​of the first storage area zn1, the second storage area zn2, and the third storage area zn3 can be calculated according to the aforementioned formula. This part of the data can be as described in Table 2 below.

[0089]

[0090] Table 2

[0091] Therefore, for the second system 142, after comparing the fit values ​​of the first storage area zn1, the second storage area zn2, and the third storage area zn3, the fit value is -7, which is the smallest. The storage area corresponding to -7 is the third storage area zn3. Therefore, the second system 142 will select the third storage area zn3 as the most suitable backup area. In other words, the third storage area zn3 is used as the new destination location. The second system 142 will re-plan the handling task based on the new destination location so that the object CA controlled by the handling equipment control system 16 is changed from the source location to the new destination location.

[0092] [Example of an electronic device]

[0093] Please see Figure 15 , Figure 15 This provides a schematic diagram of the architecture of an electronic device according to an embodiment of the present invention. The electronic device 3 includes, but is not limited to, a processor 30 and a memory 32. The processor 30 is selected to execute the dynamic allocation method for storage space. The processor 30 is connected to the memory 32, which stores instructions and can also be used to store other data, such as system parameters and configuration information. The processor 30 executes the dynamic allocation method for storage space according to the instructions stored in the memory 32 as described in the preceding embodiment. Here, the processor 30 can be one or any combination of an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a system-on-a-chip (SoC), and can cooperate with other related circuit components and firmware to implement the above-mentioned functional steps. The memory can be volatile memory or non-volatile memory (NVM). If NVM is used, it can be ensured that data is not lost after power failure.

[0094] It is understood that, for those skilled in the art, the functions described by the various illustrative logic blocks, systems, and algorithmic steps of the foregoing embodiments can be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions described by the various illustrative logic blocks, modules, and steps can be stored or transmitted as one or more instructions or programs on a computer-readable medium, and these instructions can be executed by the processor 30 in the electronic device 3.

[0095] [Beneficial Effects of the Examples]

[0096] The storage space dynamic allocation system, storage space dynamic allocation method and electronic equipment provided by this invention obtain real-time operational information, thereby determining whether the destination location needs to be changed in advance, and determining which spare area can be used as the new destination location through dynamic calculation of adaptability. This can effectively avoid the problem of excessive concentration of inventory and transportation areas, and reduce equipment idle time, thereby improving production efficiency and meeting the dynamic needs of the factory in the production process.

[0097] The above-described contents are merely optional and feasible embodiments of the present invention and are not intended to limit the claims of the present invention. Therefore, all equivalent technical changes made based on the description and drawings of the present invention are included in the claims of the present invention.

Claims

1. A dynamic allocation system for warehouse space, characterized in that, include: A first system generates a transport instruction to move an object from a source location to a destination location; as well as A second system is connected to the first system. After receiving the handling instruction, the second system generates a handling task according to the handling instruction, so that a handling equipment control system and a storage equipment control system control the operation of at least one handling equipment and at least one storage equipment according to the handling task. The storage equipment has multiple storage areas, one of which is the destination location, and at least one of the multiple storage areas is a spare area. The handling equipment control system controls the handling equipment carrying the object to move along a path so that the object is transported from the source location to the destination location. The second system is configured to perform: Upon receiving the transport instruction, determine whether the destination location in the transport instruction meets a change condition; When the change conditions are met, calculate the fit between each of the backup areas and the source location; Based on the results of the fitness calculation, one of the backup areas is selected as a new destination location; The transport task is replanned based on the new destination location, so that the transport equipment control system controls the object to be transported from the source location to the new destination location.

2. The dynamic allocation system for warehouse space as described in claim 1, characterized in that, The change conditions are: determining whether the handling equipment at the destination location can operate normally, determining whether the space occupied by the storage area at the destination location is less than a first set value, and determining whether the space occupied by the storage area at the destination location is greater than or equal to a second set value, wherein the first set value is greater than the second set value.

3. The dynamic allocation system for warehouse space as described in claim 2, characterized in that, When the handling equipment at the destination location is in normal operation, the space occupied by the storage area at the destination location is less than the first set value, and the space occupied by the storage area at the destination location is greater than or equal to the second set value, the second system determines that the change conditions are met.

4. The dynamic allocation system for warehouse space as described in claim 2, characterized in that, When the handling equipment at the destination location is in normal operation and the space occupied by the storage area at the destination location is greater than or equal to the first set value, the second system determines that the change conditions are met.

5. The dynamic allocation system for warehouse space as described in claim 2, characterized in that, When the transport equipment at the destination location is not operating normally, the second system determines that the change conditions are not met, and the transport task generated by the second system is to enable the transport equipment control system to transport the object from the source location to the destination location.

6. The dynamic allocation system for warehouse space as described in claim 2, characterized in that, When the transport equipment at the destination location is in normal operation, the space occupied by the storage area at the destination location is less than the first set value, and the space occupied by the storage area at the destination location is less than the second set value, the second system determines that the change conditions are not met, and the transport task generated by the second system is to enable the transport equipment control system to transport the object from the source location to the destination location.

7. The dynamic allocation system for warehouse space as described in claim 1, characterized in that, The calculation of the fit includes: Obtain X1, X2, X3 and X4, wherein X1 is a first real-time information pointer, X2 is a second real-time information pointer, X3 is a third real-time information pointer and X4 is a fourth real-time information pointer; Obtain W1, W2, W3, and W4, where W1 is a first weight value, W2 is a second weight value, W3 is a third weight value, and W4 is a fourth weight value; and The values ​​X1, X2, X3, X4, W1, W2, W3, and W4 are calculated according to an expression to obtain a suitable value; Wherein, X1 is the path cost value of the object from the source location to the new destination location, X2 is the remaining space value of the storage area of ​​the new destination location, X3 is the load capacity value of the handling equipment at the new destination location, and X4 is the path cost value from the new destination location to the destination location. Wherein, W1 is the weight value of the path cost to the new destination location, W2 is the weight value of the remaining space in the storage area of ​​the new destination location, W3 is the weight value of the load of the handling equipment at the new destination location, and W4 is the weight value of the path cost from the new destination location to the destination location.

8. The dynamic allocation system for warehouse space as described in claim 7, characterized in that, The expression is X1×W1-X2×W2+X3×W3+X4×W4.

9. The dynamic allocation system for warehouse space as described in claim 7, characterized in that, The minimum fit value obtained from the expression is selected as the new destination location, so that the calculated fit between the new destination location and the source location has the minimum fit value.

10. A method for dynamically allocating warehouse space, characterized in that, include: A second system receives a transport instruction generated by a first system to transport an object from a source location to a destination location; The second system generates a handling task according to the handling instruction, so that a handling equipment control system and a storage equipment control system control the operation of at least one handling equipment and at least one storage equipment according to the handling task. The storage equipment has multiple storage areas, one of which is the destination location, and at least one of the multiple storage areas is a spare area. The handling equipment control system controls the handling equipment carrying the object to move along a path so that the object moves from the source location to the destination location. The second system generates the transport task, including: Upon receiving the transport instruction, determine whether the destination location in the transport instruction meets a change condition; When the change conditions are met, calculate the fit between each of the backup areas and the source location; Based on the results of the fit calculation, one of the backup areas is selected as a new destination location; and The transport task is replanned based on the new destination location, so that the transport equipment control system controls the object to be transported from the source location to the new destination location.

11. The method for dynamic allocation of warehouse space as described in claim 10, characterized in that, Determining whether the destination location in the transport instruction meets the change conditions includes: Determine whether the transport equipment at the destination location is operational. Determine whether the space occupied by the storage area at the destination location is less than a first preset value; and Determine whether the space occupied by the storage area at the destination location is greater than or equal to a second preset value, wherein the first preset value is greater than the second preset value.

12. The method for dynamic allocation of warehouse space as described in claim 11, characterized in that, When the handling equipment at the destination location is in normal operation, the space occupied by the storage area at the destination location is less than the first set value, and the space occupied by the storage area at the destination location is greater than or equal to the second set value, the second system determines that the change conditions are met.

13. The method for dynamic allocation of warehouse space as described in claim 11, characterized in that, When the handling equipment at the destination location is in normal operation and the space occupied by the storage area at the destination location is greater than or equal to the first set value, the second system determines that the change conditions are met.

14. The method for dynamic allocation of warehouse space as described in claim 11, characterized in that, When the transport equipment at the destination location is not operating normally, the second system determines that the change conditions are not met, and the transport task generated by the second system is to enable the transport equipment control system to transport the object from the source location to the destination location.

15. The method for dynamic allocation of warehouse space as described in claim 11, characterized in that, When the transport equipment at the destination location is in normal operation, the space occupied by the storage area at the destination location is less than the first set value, and the space occupied by the storage area at the destination location is less than the second set value, the second system determines that the change conditions are not met, and the transport task generated by the second system is to enable the transport equipment control system to transport the object from the source location to the destination location.

16. The method for dynamic allocation of warehouse space as described in claim 10, characterized in that, The calculation of the fit includes: Obtain X1, X2, X3 and X4, wherein X1 is a first real-time information pointer, X2 is a second real-time information pointer, X3 is a third real-time information pointer and X4 is a fourth real-time information pointer; Obtain W1, W2, W3, and W4, where W1 is a first weight value, W2 is a second weight value, W3 is a third weight value, and W4 is a fourth weight value; and The values ​​X1, X2, X3, X4, W1, W2, W3, and W4 are calculated according to an expression to obtain a suitable value; Wherein X1 is the path cost value of the object from the source location to the new destination location, X2 is the remaining space value of the storage area at the new destination location, X3 is the load capacity value of the handling equipment at the new destination location, and X4 is the path cost value from the new destination location to the destination location. Wherein W1 is the weight value of the path cost to the new destination location, W2 is the weight value of the remaining space in the storage area of ​​the new destination location, W3 is the weight value of the load of the handling equipment at the new destination location, and W4 is the weight value of the path cost from the new destination location to the destination location.

17. The method for dynamic allocation of warehouse space as described in claim 16, characterized in that, The expression is X1×W1-X2×W2+X3×W3+X4×W4.

18. The method for dynamic allocation of warehouse space as described in claim 16, characterized in that, The location with the smallest fit value obtained from the expression is selected as the new destination location, so that the calculated fit between the new destination location and the source location has the smallest fit value.

19. An electronic device, characterized in that, It includes a memory and a processor, the processor executing instructions stored in the memory to implement the dynamic allocation method for storage space as described in any one of claims 10 to 18.

Images