WO2023025222A1 - 仓储系统及仓储调度方法 - Google Patents

仓储系统及仓储调度方法 Download PDF

Info

Publication number
WO2023025222A1
WO2023025222A1 PCT/CN2022/114669 CN2022114669W WO2023025222A1 WO 2023025222 A1 WO2023025222 A1 WO 2023025222A1 CN 2022114669 W CN2022114669 W CN 2022114669W WO 2023025222 A1 WO2023025222 A1 WO 2023025222A1
Authority
WO
WIPO (PCT)
Prior art keywords
container
cache
storage
area
buffer
Prior art date
Application number
PCT/CN2022/114669
Other languages
English (en)
French (fr)
Inventor
汪旭
张岩
熊影辉
冯宇
袁李
Original Assignee
北京极智嘉科技股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CN202122054995.8U external-priority patent/CN215709083U/zh
Priority claimed from CN202122055035.3U external-priority patent/CN215709084U/zh
Priority claimed from CN202210590668.0A external-priority patent/CN117163517A/zh
Application filed by 北京极智嘉科技股份有限公司 filed Critical 北京极智嘉科技股份有限公司
Priority to EP22860568.9A priority Critical patent/EP4393842A1/en
Publication of WO2023025222A1 publication Critical patent/WO2023025222A1/zh

Links

Images

Classifications

    • BPERFORMING OPERATIONS; TRANSPORTING
    • B65CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65GTRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G1/00Storing articles, individually or in orderly arrangement, in warehouses or magazines
    • B65G1/02Storage devices
    • B65G1/04Storage devices mechanical
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B65CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65GTRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G1/00Storing articles, individually or in orderly arrangement, in warehouses or magazines
    • B65G1/02Storage devices
    • B65G1/04Storage devices mechanical
    • B65G1/137Storage devices mechanical with arrangements or automatic control means for selecting which articles are to be removed
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management

Definitions

  • the disclosure relates to the field of logistics equipment, in particular to a storage system, a shelf, a transfer robot, a transfer system, a storage scheduling method, a storage scheduling device, a computing device, and a computer-readable A storage medium and a computer program product.
  • transfer robots are used more and more widely, and can replace manual handling, saving manpower and material resources.
  • the existing transfer robot can only be responsible for the transportation of the container, and cannot pick and place the container. It is necessary to manually place the container on the handling robot, and then manually remove the container from the handling robot, and the placement position of the container on the handling robot cannot be adjusted. Accurate definition and positioning, so the automatic operation of the whole process cannot be realized.
  • the present disclosure provides a storage system, a shelf, a transfer robot, a transfer system, a storage scheduling method, a storage scheduling device, a computing device, A computer readable storage medium and a computer program product.
  • a storage system including: a warehouse storage area, the warehouse storage area includes a plurality of shelves arranged in a matrix, and a container buffer area and a container storage area are arranged on the shelves; a work station area, the work station area includes at least one work station, the work station is configured to process the container; the handling robot is configured to be responsible for the deployment of the container in the container buffer area and the container storage area; the transfer robot, The transfer robot is configured to handle the exchange of containers between the container buffer and the workstation.
  • a plurality of transverse passages are formed between a plurality of horizontally arranged shelves, and a plurality of longitudinal passages are formed between a plurality of longitudinally arranged shelves; the plurality of transverse passages and Multiple longitudinal passages are arranged in a staggered manner.
  • the transverse passage is configured for the transfer robot to pass through; the vertical passage is configured for the transfer robot to pass through.
  • the handling robot is configured to swap from one longitudinal channel to another via the transverse channel.
  • the transverse passage is configured to allow different transfer robots to travel simultaneously in both directions.
  • the container buffer area and the container storage area are arranged alternately in the vertical direction of the shelf; or the container buffer area is provided with at least one layer, and at least one layer of the container buffer area is located below the container storage area .
  • the bottom layer of the shelf is a container buffer area
  • the container buffer area includes container buffer positions and buffer area channels that are adjacent to each other and arranged in parallel in the horizontal direction; the transfer robot is configured to be fully loaded Travel in the buffer zone channel when the vehicle is running or unloaded.
  • the buffer channel extends along the longitudinal direction of the shelf to form a longitudinal buffer channel; and/or the buffer channel extends along the transverse direction of the shelf to form a horizontal buffer channel.
  • an unloaded driving passage for the transfer robot to travel when unloaded is formed between the bottom of the container buffer position and the ground.
  • the transfer robot is configured to transfer the containers on the container buffer to the shelf platform of the workstation; and the workstation is configured to process the containers on the shelf platform.
  • the workstation includes at least one processing area and is configured to process containers on a transfer robot located in the processing area.
  • the workstation is configured to send an instruction to the next transfer robot to take the container in the container buffer area after the container on the transfer robot in the processing area has been processed.
  • the work station includes at least one queuing area
  • the transfer robot is configured to line up sequentially in the queuing area when the processing area is occupied.
  • the processing area corresponds to the queuing area, and there are at least two of them respectively.
  • the workstation includes a display configured to display information directed to an operator.
  • the workstation includes a light guide configured to project information to assist an operator in operation.
  • the workstation includes an interaction button configured for interactive confirmation with the system when the operator completes the operation.
  • the workstation includes a cargo container pose detection device, and the cargo container pose detection device is configured to detect the pose of the container on the transfer robot.
  • the workstation includes a safety protection device
  • the safety protection device is a protective door for preventing the transfer robot from entering the workstation.
  • the work station includes a safety protection device and a control unit
  • the safety protection device is a detection sensor; Issue an order to stop entering the station.
  • the workstation includes an identification device configured to obtain information about the container on the transfer robot.
  • the workstation includes a visual recognition device and a control unit, and the recognition device is configured to recognize the type or quantity of commodities in the container; and/or is configured to recognize an operator's operation gesture;
  • the control unit sends out an alarm signal based on the error information obtained by the visual recognition device.
  • a high-speed driving area is set between the warehouse storage area and the workstation area; the transfer robot travels faster in the high-speed driving area than in the warehouse storage area.
  • a rack for use in the storage system according to the first aspect of the present disclosure comprising: a container buffer area; and a container storage area.
  • the container buffer area and the container storage area are arranged alternately in the vertical direction of the shelf; or the container buffer area is provided with at least one layer, and at least one layer of the container buffer area is located below the container storage area .
  • the bottom layer of the shelf is a container buffer area
  • the container buffer area includes container buffer positions and buffer channel channels that are adjacent to each other and arranged in parallel in the horizontal direction.
  • the buffer channel extends along the longitudinal direction of the shelf to form a longitudinal buffer channel; and/or, the buffer channel extends along the lateral direction of the shelf to form a horizontal buffer aisle.
  • a transfer robot which is used in the storage system according to the first aspect of the present disclosure, including: a chassis mechanism; a lifting mechanism, the lifting mechanism is arranged on the On the chassis mechanism; the top plate, the top plate is arranged on the lifting mechanism, and is controlled by the lifting mechanism to drive up or down; the side of the top plate that is used to contact the container is provided with a positioning mechanism that cooperates with the bottom of the container; The top plate is configured for jacking or dropping the container.
  • the positioning mechanism includes a positioning pin or a positioning hole; the positioning pin is arranged on the top plate, and the positioning hole for cooperating with the positioning pin is arranged at the bottom of the container; or the positioning hole is arranged at the bottom of the container On the top plate, positioning pins for cooperating with the positioning holes are arranged at the bottom of the container.
  • At least the top surface of the positioning pin has a conical structure, and the shape of the positioning hole matches the positioning pin.
  • the lifting mechanism further includes a driving assembly and a scissor assembly having at least one scissor unit, the bottom end of the scissor assembly is movably connected to the chassis mechanism, and the top end is movably connected to the top plate, the The driving assembly is used to drive the scissors assembly to move up and down in the vertical direction.
  • the scissors unit includes two cross-arranged and hinged first link assemblies and second link assemblies at the intersections; the top end of the first link assembly in the scissors unit adjacent to the top plate Hinged with the top plate, the top end of the second link assembly moves horizontally relative to the top plate; the bottom end of the first link assembly adjacent to the scissor unit of the chassis mechanism is hinged with the chassis mechanism, and the second link assembly The bottom ends move horizontally relative to the chassis mechanism; two adjacent scissor units are hinged together.
  • the bottom of the top plate is provided with a first guide mechanism extending in the horizontal direction, and the second link assembly in the scissor unit adjacent to the top plate is configured to move horizontally in the first guide mechanism;
  • the chassis The top of the mechanism is provided with a second guide mechanism extending in the horizontal direction, and the second link assembly in the scissor unit adjacent to the chassis mechanism is configured to move horizontally in the second guide mechanism.
  • the end of the second link assembly used to cooperate with the first guide mechanism and the second guide mechanism in the scissor unit is provided with rollers, and the rollers are configured to move along the first guide mechanism.
  • the mechanism and the second guide mechanism are rolling.
  • the scissor assembly includes two scissor units, the upper scissor unit includes a first upper link assembly and a second upper link assembly hingedly connected, and the lower scissor unit
  • the fork unit includes a first lower link assembly and a second lower link assembly hingedly connected; the top end of the first upper link assembly is hinged to the top plate, and the bottom end is hinged to the top end of the first lower link assembly , the top end of the second upper link assembly is supported on the bottom of the top plate and moves horizontally relative to the top plate, and the bottom end is hinged to the top end of the second lower link assembly; the bottom end of the first lower link assembly Hinged with the chassis mechanism, the bottom end of the second lower link assembly is supported on the chassis mechanism and moves horizontally relative to the chassis mechanism.
  • the drive assembly includes a rocker, a drive motor, and a cam connected to the output end of the drive motor, one end of the rocker is hinged to the cam, and the other end is hinged to the scissor assembly;
  • the drive motor is configured to drive the scissors assembly up and down through a rocker.
  • a transfer system comprising the transfer robot according to the third aspect of the present disclosure, at least one shelf, the transfer robot is configured to jack up containers on the shelf, or is configured to To place the containers on the top plate on the shelf.
  • the shelf includes a frame body, and the frame body has a plurality of first container positions arranged in a row, and the first container positions have a support portion for supporting the container, and the support portion is provided with There is an open end for the transfer robot to pass through.
  • the shelf is also provided with a second container position for placing containers, the second container position is set above the first container position, and also includes a handling robot configured to For transferring the container located on the second container position to the first container position.
  • the first container position is provided with at least one layer, which is located at the bottom of the second container position on the frame body.
  • a storage scheduling method is performed using the storage system according to the first aspect of the present disclosure, including: determining the occupancy ratio of cache positions in the container buffer area, wherein , the container cache area includes at least one cache bit; when the occupancy ratio of the cache bit exceeds the set ratio threshold, determine the container score of each cache bit in the container cache area to store the container, wherein the container score is based on the picking task to be performed Determine the number of objects in the container; determine the cache position to be released in the container buffer according to the container score, and generate a return task for the container to be returned in the cache position to be released, wherein the return task is used to indicate that the container to be returned Returns bits from the cache to be freed to the container storage area.
  • determining the occupancy ratio of cache bits in the container cache includes: determining the number of occupied cache bits in the container cache; determining the number of cache bits to be occupied and the number of cache bits to be released according to the current container transfer task ; According to the number of occupied cache bits, the number of cache bits to be occupied and the number of cache bits to be released, determine the occupation ratio of cache bits in the container buffer area.
  • determining the cache bits to be released in the container buffer area according to the container score includes: determining the difference between the occupancy ratio and the set ratio threshold, and determining the number of cache bits to be released according to the difference; The cache bit storage container is sorted by the container score, and according to the sorting result, the number of cache bits to be released is selected.
  • generating the return task for the container to be returned in the cache position to be released includes: determining the target storage position corresponding to the cache position to be released; generating the return task based on the cache position to be released and the target storage position, wherein the return task It is used to return the to-be-returned container stored in the buffer to be released to the target storage location.
  • determining the container score of each cache bit storage container in the container buffer area it also includes: determining the container to be transferred to the container buffer area in the container storage area at a first preset time interval; determining The first cache location corresponding to the container to be transferred in the container buffer; generate a container transfer task for the container to be transferred based on the first storage location and the first cache location, wherein the first storage location is the storage location of the container to be transferred in the container storage area , the container transfer task is used to instruct to transfer the container to be transferred from the first storage location to the first cache location.
  • the storage system includes at least two lanes, and each lane is provided with a container storage area and a container buffer area; determining the first buffer position corresponding to the container to be transferred in the container buffer area includes: determining the first container buffer Whether there is an available cache bit in the area, wherein, the first container cache area and the container storage area where the container to be transferred belong to the same lane; if there is an available cache bit, then determine the first cache bit from the available cache bit; if not If the available buffer position is available, the first buffer position is determined from the second container buffer area, wherein the second container buffer area and the container storage area where the container to be transferred are located do not belong to the same lane.
  • the first cache location and the first storage location belong to the same lane; generating a container transfer task for the container to be transferred based on the first storage location and the first cache location includes: determining whether the first cache location currently stores a container ; If a container is stored, then generate a replacement task for storing the container in the first cache position, wherein the replacement task is used to instruct the handling robot to return the storage container in the first cache position to the container storage area, and transfer the container to be transferred from The first storage location is transported to the first cache location; if no container is stored, a first container handling task for the container to be transferred is generated based on the first storage location and the first cache location, wherein the first container handling task is used to indicate The handling robot transports the container to be transferred from the first storage position to the first buffer position.
  • the first cache location and the first storage location belong to different lanes; generating a container transfer task for the container to be transferred based on the first storage location and the first cache location includes: generating a task for the container to be transferred based on the first storage location The second container handling task, wherein the second container handling task is used to instruct the handling robot to transport the container to be transferred from the first storage position to the second buffer position, and the second buffer position and the first storage position belong to the same lane;
  • a transfer task is generated for the container to be transferred based on the second cache location and the first cache location, wherein the transfer task is used to instruct the transfer robot to transfer the container to be transferred from the second cache location to First cache bit.
  • generating a transshipment task for the container to be transferred based on the second cache location and the first cache location includes: determining whether the first cache location currently stores a container; The third container handling task for storing containers, wherein the third container handling task is used to instruct the handling robot to move the storage container in the first cache position from the first cache position to the second storage position, and the first cache position and the second storage position In the same lane or in different lanes; in the case that the storage container in the first cache position is transported out of the first cache position, a transfer task is generated for the container to be transferred based on the second cache position and the first cache position.
  • each cache bit storage container in the container cache area before determining the container score of each cache bit storage container in the container cache area, it also includes: determining the number of picking tasks matched by at least one target object group in the first container, wherein the first container is a container cache For any container stored in the container storage area and the container storage area, the objects with the same target identification form a target object group; according to the number of picking tasks matched by at least one target object group, determine the heat value of the first container; determine the first container’s The container type, and according to the container type, determine the basic score of the first container; according to the heat value and the basic score, determine the container score of the first container.
  • determining the base score of the first container according to the container type includes: determining the base score of the first container as a first set value when the container type of the first container is a hit container, Among them, the hit container refers to the container selected to perform the picking task, and the first set value is the lower boundary value of the first score range; the container type in the first container is a non-hit container, and it is the container buffer in the container cache.
  • the basic score of the first container is determined to be the second set value, wherein the second set value is the lower boundary value of the second score range;
  • the container type of the first container is a non-hit container, and is
  • the base score of the first container is determined to be a third set value, wherein the third set value is the lower boundary value of the third score range; wherein, the first score range, The second range of scores and the third range of scores are obtained based on division of container scores, the first set value is higher than the second set value, and the second set value is higher than the third set value.
  • a warehouse scheduling device including: a first determination module configured to determine the occupancy ratio of the buffer slots in the container buffer area, wherein the container buffer area includes at least one buffer slot; the second The determination module is configured to determine the container score of each cache storage container in the container buffer area when the occupancy ratio of the cache location exceeds the set ratio threshold, wherein the container score is based on the sorting task to be performed and the target in the container The number of objects is determined; the generation module is configured to determine the cache position to be released in the container buffer area according to the container score, and generate a return task for the container to be returned in the cache position to be released, wherein the return task is used to indicate that the cache position to be released will be The return container is returned to the container storage area from the buffer to be freed.
  • a computing device including: a memory and a processor; the memory is used to store computer-executable instructions, and the processor is used to execute the computer-executable instructions to implement the steps of the warehouse scheduling method above.
  • a computer-readable storage medium which stores computer-executable instructions, and when the instructions are executed by a processor, the steps of the above warehouse scheduling method are implemented.
  • a computer program product including a computer program, and when the computer program is executed by a processor, the steps of the above warehouse scheduling method are implemented.
  • the beneficial effect of the present disclosure is that the transfer robot can realize the lifting of the container, and the positioning mechanism on the top plate can cooperate with the container to accurately locate the position of the container.
  • the transfer robot can pick and place the container on the shelf by itself. It saves labor, and can accurately locate the position of the container through the positioning mechanism, which improves the accuracy and stability of the container position.
  • the transfer robot can not only transport the container, but also pick and place the container by itself, realizing the whole process. Automatic operation.
  • the storage system of the present disclosure does not need a conveying line device, greatly improves the flexibility of the scheme, facilitates rapid construction, and has the advantages of dynamically increasing or decreasing robots.
  • the storage scheduling method determines the occupancy ratio of the cache bits in the container buffer area, wherein the container buffer area includes at least one cache bit; when the occupancy ratio of the cache bits exceeds the set ratio threshold, determine the Each cache bit stores the container score of the container, where the container score is determined based on the sorting task to be performed and the number of objects in the container; according to the container score, the cache bit to be released in the container buffer area is determined, and a cache bit to be released is generated.
  • the return task of the container to be returned in the bit wherein the return task is used to indicate that the container to be returned is returned from the cache bit to be released to the container storage area.
  • the occupancy ratio of the cache bits in the container cache can be determined. If the occupancy ratio of the cache bits exceeds the set ratio threshold, it means that too many containers are stored in the container cache, which is used to perform container handover. The cache space may be insufficient. At this time, based on the container score of each cache space in the container cache, determine the cache space to be released in the container cache, and generate a corresponding return task. The container is returned to the container storage area, thereby dynamically controlling the occupancy ratio of the cache bits in the container cache area to ensure that there are sufficient cache bits in the container cache area for container handover.
  • the container buffer area can also be used for container storage, that is, after the container is picked at the workstation, the transfer robot does not need to send the container back to the container buffer area after the transfer robot returns the container from the workstation
  • the container can be directly stored in the cache area, and then based on the occupation ratio of the cache bits in the container cache area, the transfer of the container in the cache area is dynamically controlled, and the container can be stored in the container cache area, which improves the container reuse rate, thereby improving It improves the efficiency of container outbound and object picking, and greatly saves the transportation resources of robots.
  • FIG. 1 is a schematic diagram of the overall structure of a transfer robot according to an embodiment of the present disclosure.
  • Fig. 2 is a schematic structural diagram of a container according to an embodiment of the present disclosure.
  • Fig. 3 is a schematic structural view of the top plate of the transfer robot according to the embodiment of the present disclosure.
  • Fig. 4 is an enlarged view of part A in Fig. 3 .
  • Fig. 5 is a cross-sectional view of the top plate of the transfer robot according to the embodiment of the present disclosure.
  • Fig. 6 is a schematic structural diagram of a lifting mechanism of a transfer robot according to an embodiment of the present disclosure.
  • Fig. 7 is a schematic diagram of the overall structure of a container transfer system according to an embodiment of the present disclosure.
  • Fig. 8 is an overall distribution diagram of the storage system of the embodiment of the present disclosure.
  • Fig. 9 is a structural schematic diagram of two adjacent shelves in Fig. 8 .
  • Fig. 10 is a top view of part of the shelves in Fig. 8 .
  • Fig. 11 is a structural layout diagram of a workstation according to an embodiment of the present disclosure.
  • Fig. 12A is a schematic structural diagram of a warehouse system according to an embodiment of the present disclosure.
  • Fig. 12B is a processing flowchart of a container transfer method in warehouse scheduling according to an embodiment of the present disclosure
  • Fig. 12C is a processing flowchart of the storage scheduling method of the embodiment of the present disclosure.
  • Fig. 13 is a flow chart of a warehouse scheduling method according to an embodiment of the present disclosure.
  • Fig. 14A is a schematic diagram of the execution process of the container handling task in the same roadway according to the embodiment of the present disclosure
  • Fig. 14B is a schematic diagram of the execution process of the same-lane container replacement task according to the embodiment of the present disclosure.
  • Fig. 14C is a schematic diagram of the execution process of the cross-lane container handling task of the embodiment of the present disclosure.
  • Fig. 14D is a schematic diagram of the execution process of the container replacement task across the same lane according to the embodiment of the present disclosure
  • Fig. 15 is a schematic structural diagram of a storage scheduling device according to an embodiment of the present disclosure.
  • FIG. 16 is a structural block diagram of a computing device according to an embodiment of the present disclosure.
  • the present disclosure provides a transfer robot, as shown in Figures 1 to 6, including a chassis mechanism 1, a lifting mechanism 2 and a top plate 3, the lifting mechanism 2 is set above the chassis mechanism 1, and the top plate 3 is set on the lifting mechanism 2 At the top, the top plate 3 is controlled by the lifting mechanism 2 to drive up or down.
  • the top plate 3 is used to carry the container 6 , and the top plate 3 is configured to lift or drop the container 6 .
  • the side of the top plate 3 that is in contact with the container 6 is provided with a positioning mechanism 4 that cooperates with the bottom of the container 6 to realize precise positioning of the position of the container 6 .
  • the positioning mechanism 4 includes positioning pins 41 or positioning holes 42 that cooperate with each other.
  • the positioning pin 41 is disposed on the top plate 3
  • the positioning hole 42 for cooperating with the positioning pin 41 is disposed at the bottom of the container 6 .
  • the positioning hole 42 is provided on the top plate 3
  • the positioning pin 41 for cooperating with the positioning hole 42 is provided at the bottom of the container 6 .
  • One or at least two positioning pins 41 or positioning holes 42 may be provided respectively.
  • the positioning pin 41 can be a protrusion protruding from the top plate 3 or the surface of the container 6 , and specifically can be a flat cylindrical, conical or spherical structure, and the shape of the positioning hole 42 matches the positioning pin 41 .
  • At least the top surface of the positioning pin 41 has a conical structure, so that the positioning pin 41 can enter the positioning hole 42 smoothly.
  • a specific structure of the positioning pin 41 is arranged in a flat cylindrical shape, and the end away from the connecting top plate 3 or the container 6 is arranged in a conical structure.
  • Positioning pin 41 and top plate 3 or container 6 surface can be non-detachable fixed connections, such as connection modes such as one-piece molding, welding, bonding; It can be set as an elastic telescopic structure, which protrudes from the bottom surface of the top plate 3 or the container 6 in a free state, and can shrink into the top plate 3 or the container 6 when subjected to an external force.
  • the top plate 3 or the surface of the container 6 is provided with a mounting hole 43, and an elastic member 44 is arranged in the mounting hole 43, and the positioning pin 41 is connected to the elastic member 44 for positioning.
  • the pin 41 can compress the elastic member 44 and shrink into the installation hole 43 under the action of external force.
  • the elastic positioning pin 41 is arranged on the top plate 3
  • the top plate 3 can be used to transport common containers.
  • the positioning pin 41 can be pressed back in the mounting hole 43, so that the common container can be placed stably.
  • the elastic positioning pin 41 is arranged at the bottom of the container 6 , the container 6 can be placed on a flat plane stably, and the positioning pin 41 shrinks into the installation hole 43 under the pressure of the plane.
  • the chassis mechanism 1 has a walking component, which can walk along a specific track or be controlled by a control system.
  • the walking component can receive instructions and walk according to a specified path, and transport the container 6 at a specified location to another specified location.
  • Sensors can be arranged on the chassis mechanism 1, and the sensors include multiple types, such as visual sensors, laser ranging sensors, infrared sensors, laser sensors, etc., which can detect their own positions and the positions of other targets such as shelves, containers 6, obstacles, etc. And send the position signal to the intelligent control system.
  • the transfer robot can be configured with a navigation system, which can plan the walking route according to its own position, the actual position of the target and the specified position of the target.
  • Lifting mechanism 2 can adopt as scissor lift mechanism, linear drive or the like.
  • the lifting mechanism 2 includes a drive assembly and at least one scissor assembly with a scissor unit, and the bottom end of the scissor assembly is connected to the chassis mechanism 1
  • the flexible connection, the flexible connection between the top and the top plate 3, the driving assembly is used to drive the scissors assembly to lift in the vertical direction, and the driving assembly can be controlled by the control system.
  • the scissors unit includes two first link assemblies 210 and second link assemblies 220 arranged crosswise and hinged at the intersections.
  • the uppermost scissor unit is adjacent to the top plate 3 , the top end of the first link assembly 210 of the scissor unit is hinged to the top plate 3 , and the second link assembly 220 can move horizontally relative to the top plate 3 .
  • the lowermost scissor unit is adjacent to the chassis mechanism 1 , the bottom end of the first link assembly 210 of the scissor unit is hinged to the chassis mechanism 1 , and the second link assembly 220 can move horizontally relative to the chassis mechanism 1 . Any two adjacent scissor units are hinged together. When the scissor assembly has only one scissor unit, the uppermost scissor unit adjacent to the top plate 3 and the lowermost scissor unit adjacent to the chassis mechanism 1 are the same scissor unit.
  • the first connecting rod 2101 and the second connecting rod 2201 of each scissor unit rotate relatively at the same time, and the top heights of the first connecting rod 2101 and the second connecting rod 2201 can be synchronously raised and lowered, thereby stabilizing The rise or fall of the top plate3.
  • the first connecting rod assembly 210 includes two first connecting rods 2101 arranged in parallel, and a first beam 2102 connected between the two first connecting rods 2101 .
  • the second connecting rod assembly 220 includes two second connecting rods 2201 parallel to each other, and a second beam 2202 connected between the two second connecting rods 2201 .
  • the upper and lower two first connecting rods 2101 on the same side are hinged, and the upper and lower two second connecting rods 2201 on the same side are hinged.
  • the upper ends of the two first connecting rods 2101 are hinged to the top plate 3, and the upper ends of the two second connecting rods 2201 can move in the horizontal direction relative to the top plate 3; in the scissor unit adjacent to the chassis mechanism 1 Among them, the lower ends of the two first connecting rods 2101 are hinged with the chassis mechanism 1 , and the lower ends of the two second connecting rods 2201 can move relative to the chassis mechanism 1 in the horizontal direction.
  • the bottom of the top plate 3 is provided with a first guide mechanism 230 extending in the horizontal direction, and the second linkage assembly 220 in the scissor unit adjacent to the top plate 3 is configured to move horizontally in the first guide mechanism 230 .
  • the top of the chassis mechanism 1 is provided with a second guiding mechanism 240 extending in the horizontal direction, and the second link assembly 220 adjacent to the chassis mechanism 1 is configured to move horizontally in the second guiding mechanism 240 .
  • the two second link assemblies 220 move in the horizontal direction along the first guide mechanism 230 and the second guide mechanism 240 respectively relative to the top plate and the chassis mechanism 1 , so as to ensure the lifting stability of the scissor assembly.
  • the end of the second connecting rod 2201 used to cooperate with the first guide mechanism 230 and the second guide mechanism 240 in the scissor unit is provided with a roller 250, and the roller 250 is configured to roll along the first guide mechanism 230 and the second guide mechanism 240 .
  • the friction force between the roller 250 and the first guide mechanism 230 and the second guide mechanism 240 is small, which can reduce wear.
  • first guiding mechanisms 230 corresponding to the two second connecting rods 2201 of the second connecting rod assembly 220 adjacent to the top plate 3; two second guiding mechanisms 240 are also provided, corresponding to the adjacent chassis mechanisms Two second connecting rods 2201 of the second connecting rod assembly 220 of 1.
  • the ends of the two second connecting rods 2201 of the second connecting rod assembly 220 adjacent to the top plate 3 are all provided with rollers 250 that roll along the first guide mechanism 230 , and the two second connecting rods 220 of the second connecting rod assembly 220 adjacent to the chassis mechanism 1
  • Both ends of the connecting rod 2201 are provided with rollers 250 that roll along the second guide mechanism 240 .
  • the first guide mechanism 230 and the second guide mechanism 240 can be made of angle steel, one of the sides of the angle steel is fixedly connected to the surface of the top plate 3 or the chassis mechanism 1, and forms a guide groove structure with the surface of the top plate 3 and the chassis mechanism 1 respectively .
  • the roller 250 rolls in the guide groove formed by the angle steel and the top plate 3 or the surface of the chassis mechanism 1 .
  • the scissor assembly includes two scissor units, the first link assembly 210 of the upper scissor unit is the first upper link assembly 211, and the second link assembly 220 is The second upper link assembly 212 , the first link assembly 210 of the lower scissor unit is the first lower link assembly 221 , and the second link assembly 220 is the second lower link assembly 222 .
  • the bottom of the top plate 3 and the chassis mechanism 1 are provided with hinged seats, the top of the first upper link assembly 211 is hinged with the hinged seat at the bottom of the top plate 3, and the bottom end of the first upper link assembly 211 is connected with the first lower link assembly.
  • the top end of 221 is hinged, and the bottom end of the first lower link assembly 221 is hinged with the hinge seat on the chassis mechanism 1 .
  • the top of the second upper link assembly 212 is supported on the bottom of the top plate 3 and moves horizontally relative to the top plate 3, the bottom end of the second upper link assembly 212 is hinged with the top of the second lower link assembly 222, and the second lower link assembly
  • the bottom end of 222 is supported on the chassis mechanism 1 and moves horizontally relative to the chassis mechanism 1 .
  • the bottom of the top plate 3 is provided with a first guide mechanism 230, the top of the second upper link assembly 212 is provided with a roller 250 walking in the first guide mechanism 230; the chassis mechanism 1 is provided with a second guide mechanism 240, the second lower The bottom end of the link assembly 222 is provided with a roller 250 running in the second guide mechanism 240 .
  • the drive assembly includes a rocker 260, a drive motor 270 and a cam 280 connected to the output end of the drive motor 270.
  • One end of the rocker 260 is hinged to the cam 280, and the other end is hinged to the scissor assembly.
  • the driving motor 270 is fixed on the chassis mechanism 1 and is configured to drive the scissor assembly up and down through the rocker 260 .
  • the drive cam 280 rotates, and one end of the rocking bar 260 hinged with the cam 280 rotates around the cam 280 under the drive of the cam 280, and the other end of the rocking bar 260 drives the first connecting rod 2101 and the second connecting rod of the scissor assembly.
  • the rod 2201 rotates relatively, so as to drive the scissors assembly up and down.
  • the drive component can also be a drive such as a linear motor or a hydraulic cylinder.
  • one end of the driver is hinged on the top plate 3 or the chassis mechanism 1, and the other end is hinged on the scissor assembly.
  • both ends of the driver are hinged on the scissor assembly.
  • both ends of the driver can be hinged on different scissor units, or both ends of the driver can be hinged on the same scissor unit. on the first connecting rod 2101 and the second connecting rod 2201.
  • the present disclosure also provides a container transfer system, as shown in FIG. 7 , including the above-mentioned transfer robot and the rack 5 .
  • the transfer robot is configured to lift up the container 6 on the shelf 5 , or to place the container 6 on the top plate 3 on the shelf 5 .
  • the shelf 5 includes a rack body, which has a plurality of first container positions 51 arranged in rows, the first container positions 51 are used to place the containers 6, and the plurality of first container positions 51 are located at the bottom of the shelf 5.
  • the first container positions 51 has a support portion 511 for supporting the container 6 .
  • the support part 511 is provided with an open end 5111 for the transfer mechanism of the container 6 to pass through, and there is a height allowing the transfer robot to pass between the first container position 51 and the bottom end of the frame body.
  • the support part 511 can be a U-shaped support beam forming one open end 5111 , or it can be two support beams supported on opposite sides of the container 6 to form two opposite open ends 5111 .
  • a plurality of second container positions 52 can also be arranged on the frame body, and the plurality of second container positions 52 are arranged in a row above the first container position 51 , and can be arranged in multiple layers above the first container position 51 .
  • the container transfer system further includes a transfer robot configured to transfer the container 6 located on the second container position 52 to the first container position 51 .
  • the transfer robot may adopt existing technologies.
  • a transfer robot is provided below and its specific structure and working principle are introduced.
  • the handling robot has a lifting mechanism and a container retrieval mechanism.
  • the lifting mechanism is used to drive the container retrieval mechanism to move up and down.
  • the container retrieval mechanism includes a bottom plate and two telescopic arms.
  • the two telescopic arms are configured to be able to hook or push the container 6 .
  • the container 6 located at the second container position 52 can be hooked to the bottom plate, and then the lifting mechanism lowers the container 6 to the height of the first container position 51, and then pushes the container 6 through the two telescopic arms To the first container position 51.
  • the handling robot can also be configured to transfer the container 6 located at the first container position 51 to the second container position 52 .
  • the transfer robot After receiving the command, the transfer robot lowers the top plate 3 below the first container position 51 through the lifting mechanism 2; then walks to the first container on the shelf 5 where the designated container 6 is located through the chassis mechanism 1 Below the position 51, the top plate 3 is lifted from the opening end 5111 of the support portion 511 of the first container position 51 through the lifting mechanism 2, and the container 6 is lifted, and the positioning mechanism 4 can accurately position the container 6 at the same time; lift the container 6, the transfer robot leaves from the open end 5111 of the support part 511, thereby taking away the container 6. After the container 6 at the first container position 51 is taken away, the handling robot can move the container 6 at the second container position 52 to the first container position 51 .
  • the transfer robot After receiving the command, the transfer robot raises the container 6 on the top plate 3 through the lifting mechanism 2, so that the container 6 is higher than the support portion 511 of the first container position 51 of the shelf 5; The mechanism 1 travels to the opening end 5111 of the designated first container position 51 , and then lowers the container 6 through the lifting mechanism 2 , and places the container 6 on the support portion 511 of the designated first container position 51 .
  • the handling robot can transfer the container 6 placed on the first container position 51 to the second container position 52 .
  • the container transfer system realizes the work of the transfer robot to pick and place the container 6 on the shelf 5 by itself, saves labor, and can accurately locate the position of the container through the positioning mechanism, which improves the accuracy and stability of the container position.
  • the transfer robot can both The transport container can also be picked and placed by itself, realizing the automatic operation of the whole process.
  • the handling robot completes the automated picking by taking out the container from the warehouse and sending it directly to the workstation, and returning it to the warehouse after completing the picking.
  • the workstation is in the form of a conveyor line or directly completes the picking on the robot, all the actions are performed by the same robot.
  • the handling robot itself is relatively tall and runs relatively slowly; at the same time, the cost is high, which inevitably brings defects such as low efficiency and low cost performance.
  • a series of optimized solutions have emerged in the industry, such as using third-party equipment to quickly remove and replenish the containers on the robot, thereby shortening the waiting time for handover and improving the utilization rate of the robot.
  • the transfer of the container between the first container position and the second container position is realized by the transfer robot, and the flow of the container between the first container position and the workstation is completed by the transfer robot.
  • the transfer robot can take one container or two containers, regardless of its overall height, running speed and cost, it is superior to the handling robot, which can greatly improve the working efficiency of the storage system.
  • FIG. 7 shows a schematic structural diagram of one layer of first container locations 51 and three layers of second container locations 52 .
  • the first container position 51 is located below the second container position 52 , which is convenient for the transfer robot to transfer the containers located on the first container position 51 .
  • the first container position 51 may also be provided with two, three or more layers, and the first container positions 51 of multiple layers are located below the second container position 52 .
  • the shelf starts from the bottom, the first layer is the first container position, the second layer is the first container position, the third layer is the second container position, and the fourth layer is the second container position.
  • the transshipment robot When the transshipment robot is performing transshipment, it can first transfer the containers located at the first container position 51 on the bottom layer, and then transfer the containers at the first container position 51 on the upper layer according to the actual situation, and complete the first container positions on different layers in turn. Transshipment of container position 51.
  • the first container position 51 and the second container position 52 may also be arranged alternately in the vertical direction.
  • the bottom layer of the shelf can be the first container position 51, the second container position 52 above it, and the optional first container position 51 above it, and so on. It can also be that the bottom layer of the shelf can be the first container position 51, the second to the nth layer is the second container position 52, the n+1th layer is the first container position, and the n+2th to the 2nth layer is the second container position.
  • the container position can also be that the bottommost layer is the second container position 52, the first container position 51 is above it, and the optional second container position 52 is again above it, and examples are not given one by one here.
  • the structure of the first container position 51 can also be redesigned, for example, a conveying mechanism controlled by a drive mechanism can be selected as the first container position 51, and the container positioned on the first container position 51 can be transported outwards by driving the drive mechanism. In this way, a robot with a simpler structure and faster running speed can be selected to complete the action of taking and placing containers on the first container position 51 . It is also possible that a walkable platform is provided below the first container position 51, and the transfer robot can walk to the platform via a slope to pick and place the containers on the first container position 51 above the platform.
  • the first container location 51 of the present disclosure is used as a buffer area
  • the second container location 52 is used as a container storage area.
  • the transfer robot completes the exchange of containers between the buffer area and the container storage area.
  • the transfer robot transports the containers in the buffer area to the workstation, and returns to the buffer area after completing the sorting.
  • the transfer robot continues to complete the container storage in the buffer area and container storage area. exchange between districts, thereby completing the selection.
  • the transfer robot takes the container and completes the picking, it can also choose not to send it back to the buffer area, and send it to another location for storage.
  • the transfer method adopted, the transfer robot and the transfer robot have a clear division of labor, and each performs its duties.
  • the operating speed of the transfer robot is generally much higher than that of the transfer robot, which greatly improves the efficiency of container sorting.
  • FIG. 10 schematically shows a warehouse system of the present disclosure, which includes a warehouse storage area 7 , a high-speed driving area 73 and a workstation area 8 .
  • the warehouse storage area 7 is provided with a plurality of shelves 70 arranged in a matrix, and the shelves 70 may adopt the shelf structure in the above-mentioned embodiments.
  • a plurality of racks 70 are arranged together, a transverse channel 71 is formed in the warehouse storage area 7 between the plurality of racks 70 arranged horizontally, and a longitudinal channel 72 is formed in the warehouse storage area 7 between the plurality of racks 70 arranged vertically.
  • the passage 71 and the longitudinal passage 72 intersect together to form a space for the transfer robot and the transfer robot to walk. Based on this, the walking routes for transfer robots and handling robots can be reasonably arranged. For example, in view of the different task assignments of the transfer robot and the transfer robot, it can be configured so that the transfer robot can only pass through the longitudinal passage 72 , and it can be configured so that the transfer robot can pass through the transverse passage 71 .
  • longitudinal channel 72 may be a one-way channel and transverse channel 71 may be a two-way channel. This is because the longitudinal aisle 72 is only assigned to the transfer robot, and the horizontal aisle can be assigned to the transfer robot. Since in the storage system, there are multiple transfer robots, multiple transfer robots need to be in the warehouse storage area 7 and the workstation area 8 at the same time. Therefore, the horizontal passage is set as a two-way passage, so that multiple transfer robots can travel in both directions on the horizontal passage at the same time, which is conducive to improving the transfer speed of the transfer robots and avoiding mutual yielding between them.
  • the transverse channel 71 can also be assigned to the transfer robot and the transfer robot at the same time. This makes the handling robot can work in different longitudinal passages 72 by means of the transverse passage 71, so that the handling robot can be responsible for the exchange of containers on multiple rows of shelves between the buffer area and the container storage area at the same time.
  • the transfer robot or the transfer robot can be selected to give way according to a prefabricated processing strategy.
  • the buffer area not only includes a container buffer position (the first container position), but also includes a buffer area channel for the transfer robot to walk.
  • Figure 9 shows a schematic diagram of this structure, in the part of the warehouse storage area 7 shown in Figure 9, including the first shelf 70a, the second shelf 70b, the structure of the first shelf 70a and the second shelf 70b can be consistent .
  • the bottom layer of the first shelf 70a is a buffer area
  • the upper layer of the buffer area is a container storage area.
  • the buffer area includes a first container buffer location 700 (which can also be understood as the above-mentioned first container location) and a buffer channel 702 which are arranged adjacently.
  • the buffer channel 702 can run through the entire first shelf 70a, so that the transfer robot can take or put containers on the first container buffer position 700 adjacent to it through the buffer channel 702 .
  • the transfer robot may also travel to the positions of other shelves in the buffer channel 702, or travel to other transverse channels. Selecting to make the transfer robot operate on the container on the first container buffer position 700 in the buffer area channel 702 can prevent the transfer robot from occupying the horizontal channel for a long time, improve the fluency of the horizontal channel, and avoid multiple transfer robots in the horizontal channel. congestion.
  • the channel 702 in the buffer area can also be used as a channel for a fully loaded transfer robot, that is, it is mainly used for the transfer robot to pass through after picking up the container. This is because after the container is positioned on the transfer robot, its overall height increases, so it needs to pass through the buffer channel 702 . At this time, the unloaded transfer robot can pass directly under the first container buffer position 700 until it reaches a suitable container position, and after the container is removed from a corresponding first container position, it is transferred to the buffer channel 702 pass.
  • the unloaded transfer robot can also pass through the buffer channel 702 , which depends on specific actual needs and path planning, and will not be described in detail here.
  • the bottom layer is provided with two longitudinally extending first container buffer positions 700 and two longitudinally arranged buffer channels 702, and each buffer channel 702 corresponds to a respective first container buffer position 700.
  • Two buffer channels 702 are arranged in the middle of the first rack 70a, and two longitudinally arranged first container buffer positions 700 are arranged outside the first rack 70a.
  • the number of the first container buffer positions and the buffer channel 702 on the first shelf 70a is not limited, and may be more or less, which will not be described in detail here.
  • a first container storage location 701 (which can also be understood as the above-mentioned second container location) serving as a container storage area is set above the first container buffer location 700 .
  • a longitudinal channel 72 for the transfer robot 9 to pass is formed between the first shelf 70 a and the second shelf 70 b.
  • the handling robot 9 can realize the exchange of containers between the first container buffer position 700 and the first container storage position 701 through its lifting component and the retrieving container component, that is, the container located on the first container storage position 701 is transferred to the first container cache location 700, or transfer the container located on the first container cache location 700 to the first container storage location 701.
  • the rack may only include a first container buffer position 700 extending longitudinally and a buffer channel 702 arranged vertically, that is, the rack may only include half of the first rack 70a shown in FIG. 9 .
  • Such a shelf can be placed when there is not enough space to place the first shelf 70a shown in FIG. 9 , or when needed in other scenarios, so as to further improve the storage rate of the warehouse.
  • the handling robot 9 can exchange containers in the container storage area and buffer area of the same shelf. It can also be that a plurality of shelves share the container storage area and the buffer area, that is, the handling robot 9 can transfer the container on the container storage area of a shelf to the buffer area of another shelf; or, transfer the container on the shelf buffer area to in the container storage area on another shelf.
  • the handling robot is responsible for the transfer of containers between areas. For example, it is responsible for the mutual transfer of containers between the container storage area and the buffer area, so as to overall arrange the distribution of containers among different regions. It is also possible to transfer between different locations in the same area, for example, transfer between different container cache locations in the buffer area, or transfer between different container storage locations in the container storage area, so as to overall allocate containers in the same area distribution at different locations.
  • the handling robot is configured to complete the exchange of containers in the picking buffer area and the container storage area, and arrange the distribution of containers in different areas.
  • the allocation of each container in different areas can be determined by multiple factors. In one embodiment, it can be determined by four factors: whether the container is hit by a task, the algorithm score of the container, the storage limit of different areas, the area or the area The rationality of the distribution, etc.
  • the handling robot is configured to exchange containers between a pick buffer and a container storage area based on task assignments.
  • a container is hit by a task, that is, after the system assigns a picking task to the container, the current state of the container determines its subsequent operations. That is, if the container is currently located in the buffer area (the first container position or the container buffer position), the transfer robot will directly carry it to the destination pointed by the task. If the container is currently located in the container storage area (the second container location or the container storage location), the transfer robot will transfer it to the buffer area, and then the transfer robot will transfer it to the destination pointed by the task.
  • each container will be scored according to the goods inside, and the probability of the goods being loaded is relatively high, so the score of the goods is higher; the scores of all the goods in a container are weighted Added together, you get the total score for a container.
  • the type of goods contained in the container can be considered. Some goods have a high proportion of scores, while others are relatively low. The scores of corresponding goods will be pre-stored in the system . If the goods contained in the container have a high score, the container's score will be relatively high.
  • the score of the goods can also be calculated according to the probability of the goods leaving the warehouse. For example, the probability of goods leaving the warehouse within a predetermined time can be counted. high, and vice versa. For example, it counts the number of shipments of all goods within a month, and calculates the probability of shipment of goods within a month, which can also be called the popularity of goods.
  • the total score of the container will optionally be normalized and become the score of each container; the score of the container will change with the change of the inventory or the expected change of the outbound quantity.
  • the score of the container is not fixed, but is calculated periodically or triggered by an event of inventory change to update the score of the container.
  • containers When containers are allocated, they tend to place containers with relatively low scores in the container storage area, and containers with relatively high scores in the cache area. This will relatively reduce the number of operations of the handling robot and improve the efficiency of picking.
  • the handling robot transfers containers with high scores from the container storage area to the buffer area, or transfers containers with low scores from the buffer area to the container storage area.
  • the handling robot is configured to transfer the containers between the buffer area and the container storage area based on the storage ratio of the container storage area or the buffer area.
  • the adjustment of the container is triggered. For example, when the container storage in the cache area exceeds a certain ratio, it is necessary to transfer some containers from the cache area to the container storage area. And/or, when the container storage in the buffer area is below a certain ratio, it is necessary to transfer some containers from the container storage area to the buffer area.
  • the transfer rule will refer to the scoring and hit status of the container, and the container with a lower score or no hit will be transferred back to the container storage area; on the contrary, if the container storage area exceeds the set threshold, some containers need to be transferred from the container
  • the storage area is adjusted to the cache area, and the transfer rules are similar. Containers with higher scores or hits are prioritized to be adjusted to the cache area.
  • the different distribution of containers within or between regions will affect the efficiency of the robot's pick-and-place.
  • the distribution is unreasonable and the robot's pick-and-place is too concentrated or too scattered, it will trigger the adjustment of the position of the container to adjust the robot's pick-and-place.
  • the rationality of the path and concentration of handling in different areas will affect the efficiency of the robot's pick-and-place.
  • the buffer channel 702 may extend along the longitudinal direction of the rack to form a longitudinal buffer channel, or may extend along the transverse direction of the rack to form a horizontal buffer channel.
  • the longitudinal buffer channel and the horizontal buffer channel are distributed in different shelves, so that the transfer robot can shuttle in the warehouse storage area by means of the horizontal buffer channel and the longitudinal buffer channel, which is conducive to the path planning of the transfer robot and improves improve the efficiency of the storage system.
  • the arrangement direction of the buffer bits of the first container adjacent to the buffer channel 702 may be arranged vertically or horizontally.
  • the transfer robot needs to drive to the bottom of the first container buffer for picking and unloading operations. Therefore, the bottom of the first container buffer and the ground form an empty space for the transfer robot to pass through when it is unloaded.
  • the empty running channel 703 may extend longitudinally or laterally, which is related to the arrangement of the first container buffer positions.
  • the empty-load transfer robot can pass along the bottom of the first container buffer position arranged vertically in the longitudinal direction, and can also pass along the bottom of the first container buffer position arranged horizontally in the transverse direction, which enriches the path planning of the robot , improving the efficiency of container circulation.
  • the horizontal channel can be a one-way channel or a two-way channel , regardless of whether the transfer robot is fully loaded or unloaded.
  • the unloaded driving channel 703 is the longitudinal channel of the unloaded transfer robot (the unloaded driving channel 703 ), which can only be used for the passage of the unloaded transfer robot, and above the channel is the first container buffer position.
  • the transverse channel of the empty-load transfer robot can be formed on a single shelf, or can be formed by a plurality of shelves arranged together.
  • 5 is the horizontal channel of the transfer robot (referred to by the label 71 above), which can be used for the passage of full-load and empty-load transfer robots, and there is no first container buffer position above the channel.
  • 6. is the longitudinal channel of the transport robot (referred to by the label 72 above), used for the transport robot to pass through different positions in the same roadway, according to the actual situation, it can be bidirectional or unidirectional.
  • the above-mentioned channels can not only be used alone, but also can be used in combination.
  • the high-speed driving area 73 is arranged between the warehouse storage area 7 and the workstation area 8, and the driving speed of the transfer robot in the high-speed driving area 73 is greater than its operating speed in the warehouse storage area, thus allowing the transfer robot to pass quickly in the high-speed driving area.
  • the transfer between the warehouse storage area 7 and the workstation area 8 is completed.
  • the high-speed driving area 73 is not necessary in the present disclosure, and in some application scenarios, the high-speed driving area may not be set, which will not be described in detail here.
  • the workstation area 8 includes at least one workstation, and FIG. 8 schematically shows a workstation area with four workstations.
  • the transfer robot removes the container from the first container position, it can be transferred to the corresponding workstation, and the container is processed at the workstation. This processing includes putting the item into the container for shelf storage, or taking the item out of the container, or are other processing steps, which are not limited here.
  • the transfer robot may transfer the containers on the first container buffer position to the shelf platform of the workstation. That is to say, the workstation is equipped with a shelf platform. After the transfer robot moves to the workstation with the container, it needs to place the container on the shelf platform, and then process the container on the shelf platform at the workstation. Correspondingly, after the container is processed, the container is removed from the shelf platform by the transfer robot and transferred to the first container buffer position, waiting for the transfer robot to transfer it to the first container buffer position for storage.
  • the shelf platform in this embodiment can adopt the same or similar structure as the above-mentioned first container buffer position, as long as the docking with the transfer robot can be realized.
  • the transfer robot can quickly put the container into the shelf platform, or remove the container from the shelf platform, so the transfer robot does not need to line up at the workstation, and can quickly enter and exit.
  • the shelf platform can be a layer structure or multi-layer.
  • a transfer robot can place containers on different levels or remove them from different levels.
  • the transfer robot After the transfer robot sends the container to the workstation, it will actively adjust the container to a suitable height and posture for the operator to operate conveniently; it can also be manually or mechanically removed from the robot, and then put it back after the specified operation robot, and then carry out subsequent handling work.
  • the workstation includes at least one processing area 88, and the transfer robot lifts up the container on the first container buffer position and moves it to the processing area 88 of the workstation;
  • the containers on the robot are processed. That is to say, after the transfer robot brings the container to the processing area 88, it will not unload the container, and the workstation directly processes the container on the transfer robot. After the processing is completed, the transfer robot will send it to the first container buffer position.
  • the workstation is configured to send an instruction to the next transfer robot to take the container in the buffer area after the container on the transfer robot in the processing area 88 has been processed, and the next transfer robot will drive after receiving the corresponding instruction. After going to the buffer area to pick up the container, take the container and drive to the processing area of the workstation to continue processing.
  • the workstation further includes at least one queuing area 89 based on the fact that the processing of the containers by the workstation takes time, and the transfer robots are configured to line up sequentially in the queuing area 89 when the processing area is occupied.
  • the transfer robots are configured to line up sequentially in the queuing area 89 when the processing area is occupied.
  • a queuing area 89 can be understood as a queue for a transfer robot. It can also be understood that a plurality of transfer robots can be queued, and at this time, the queue area 89 corresponds to the processing area 88 .
  • a workstation includes two processing areas 88, two queuing areas 89 are correspondingly set up corresponding to the respective processing areas 88. In detail, for example, it includes the first processing area and its corresponding first queuing area, as well as the second processing area and its corresponding second queuing area, and the transfer robot on the first queuing area will move to the first processing area accordingly After processing, the transfer robot on the second queuing area will move to the second processing area accordingly.
  • the transfer robots on the two queuing areas 89 move to the processing area 88 in an alternate manner in turn for processing, It can also be selected according to time sequence or other predetermined strategies.
  • the above method can also be understood as different processing areas can share the queuing area.
  • the workstation also includes a display 80 for guiding the operator or displaying information.
  • the display 80 can provide the operator with various auxiliary information, such as information such as the type and quantity of the picked items, or prompt the operator to perform corresponding operations.
  • the workstation may further include a light guiding device 81 , which guides corresponding operations in the form of lights or projections emitted by the light guiding device 81 , and projects information for assisting operators in operation.
  • a light guiding device 81 which guides corresponding operations in the form of lights or projections emitted by the light guiding device 81 , and projects information for assisting operators in operation.
  • the light guiding device 81 can emit light to shine on the corresponding container or on the corresponding item, prompting the operator to make the corresponding action of picking .
  • the light guiding device 81 can project the types and quantities of commodities to the corresponding positions, and the operators operate according to these information.
  • the workstation may also include an interaction button 82 that may be configured as a confirmation to interact with the system after completing an operation. For example, after the operator finishes picking the corresponding container at the workstation, he can press the interaction button 82 to complete the interactive confirmation with the system. After the system confirms, it can issue an operation instruction to the transfer robot for the next transfer; and/or send an operation instruction to the next transfer robot to enter the station, etc.
  • an interaction button 82 may be configured as a confirmation to interact with the system after completing an operation. For example, after the operator finishes picking the corresponding container at the workstation, he can press the interaction button 82 to complete the interactive confirmation with the system. After the system confirms, it can issue an operation instruction to the transfer robot for the next transfer; and/or send an operation instruction to the next transfer robot to enter the station, etc.
  • the workstation may further include a container pose detection device 83, which may be a sensor, or a detection device such as a camera, for detecting the pose of the container on the robot.
  • a container pose detection device 83 can issue an alarm; notify the operator to straighten the container, or use an automatic device to straighten the container.
  • the workstation may also include a safety protection device 84 for protecting the personal safety of the operator during operation.
  • the safety protection device 84 can be a guardrail or other devices that can protect the operator to protect the personal safety of the operator during the operation.
  • guardrails can prevent the container robot from hitting the operator due to incorrect instructions or other malfunctions.
  • the safety protection device 84 may be a protective door for preventing the transfer robot from entering the workstation. Only when the protective door is opened, the transfer robot can enter the processing area of the workstation, which can protect the operator and prevent the transfer robot from colliding with the operator.
  • the workstation includes a safety protection device 84 and a control unit 87
  • the safety protection device 84 is a detection sensor
  • the control unit sends a stop to the transfer robot based on the electrical signal detected by the detection sensor that enters the processing area of the workstation by mistake. station instructions.
  • the detection sensor detects that there is an obstacle in the processing area
  • the control unit 87 sends an instruction to the transfer robot to stop entering the station based on the electrical signal of the detection sensor, so as to prevent the transfer robot from colliding with the goods.
  • It can also be, for example, when a certain body part of the operator protrudes into the processing area, it can also be detected by the detection sensor, thereby preventing the container robot from colliding with the operator and protecting the personal safety of the operator.
  • the workstation may further include an identification device 85, which may be a barcode or chip reading device, for identifying and verifying container information.
  • an identification device 85 which may be a barcode or chip reading device, for identifying and verifying container information.
  • the workstation may also include a visual recognition device 86 and a control unit 87.
  • the visual recognition device 86 is used to recognize the commodity or quantity in the container, or to recognize the actions of the operator.
  • the control unit 87 can obtain information based on the visual recognition device 86.
  • the error message sends out an alarm signal.
  • the visual recognition device 86 can be a camera, for example.
  • the visual recognition device 86 can identify the type, quantity and other information of the commodities in the container by visually taking pictures. If it is found that the type and quantity of the goods in the container do not match the pre-stored information in the system, a warning message can be issued.
  • the visual recognition device 86 can also be used to recognize the actions of the operator, and if it is recognized that the actions of the operator are wrong, the control unit 87 will also send a corresponding warning message.
  • the shelves are divided into different areas in the vertical direction, corresponding to different robot operations.
  • the handling robot is responsible for adjusting the position of the container between areas or within the same area, and the transfer robot is responsible for transporting the container from the buffer area to the operation destination for operation.
  • the storage system disclosed in the present disclosure well solves a series of defects of low efficiency and low cost performance caused by the traditional handling robot needing to directly transport the container to the operation point, and it is completed by the cooperation of two robots.
  • the system can also place containers with a higher delivery probability into the buffer area.
  • the container When the container is operated, it only needs to be transported by the transfer robot, which greatly reduces the slow and costly operation of the transfer robot. It can also place containers with a high probability of being out of the warehouse in the buffer area closer to the workstation, further reducing the handling time and improving work efficiency.
  • the storage system does not need a conveyor line device, which greatly improves the flexibility of the scheme, facilitates rapid construction, and has the advantages of dynamically adding or subtracting robots.
  • the present disclosure provides multiple embodiments, and the above multiple embodiments can be implemented independently or in combination with each other.
  • the transfer in each embodiment can be completed by the transfer robot of the present disclosure, or can be completed by other robots that can achieve similar transfer capabilities.
  • the channels in the above embodiments can be set independently, or can be combined with each other to enrich the path planning of the robot.
  • the structure of the above-mentioned first container position and the second container position can be applied to the buffer area and container storage area of the transfer system or storage system.
  • other suitable structures can also be used in the buffer area and the container storage area, as long as It is enough to realize the fast transfer of the transfer robot in the buffer area to take and deliver the container.
  • the container transfer system and the storage system of the present disclosure are all controlled by the control system, for example, the detection unit and the control unit in the control system complete the corresponding operations on the transfer robot and the transfer robot, which will not be described in detail here.
  • Fig. 12A is a schematic structural diagram of a storage system according to an embodiment of the present disclosure.
  • the storage system includes a warehouse storage area, which includes a plurality of shelves arranged in a matrix, and the container buffer area and container storage area are arranged on the shelves. area; the storage system also includes a workstation area, and the workstation area includes at least one workstation configured to perform picking processing on containers.
  • the RS+P container-to-person solution can be used, which is a high-storage, high-flexibility, and high-efficiency storage scheduling solution.
  • the RS robot i.e., the handling robot
  • the P robot i.e., the transfer robot
  • the RS+P container-to-person solution adopts 5-8m single-deep or double-deep storage to maximize storage capacity, and can match RS robots in a variety of container forms, and use P robots to achieve highly flexible picking without conveyor lines.
  • SKUs Stock Keeping Units, inventory units
  • high flexibility requirements for container-to-person dismantling and picking scenarios retail MFC scenarios, etc.
  • the retail MFC scenario refers to the retail management system created based on MFC (Microsoft Foundation Classes, basic class library).
  • FIG. 12B is a processing flowchart of a container transfer method in warehouse scheduling according to an embodiment of the present disclosure. As shown in FIG. 12B , the container will be repeatedly executed as a transfer operation of storage location-cache location-workstation-cache location-storage location.
  • the cache can also undertake the function of storing some containers.
  • the above-mentioned high-value container is sent back to the cache after the first order is completed, it can be temporarily stored in the cache. , so that part of the capacity resources of RS robots can be liberated and efficiency can be improved.
  • the container is temporarily stored in the cache, which makes it very easy to occupy the cache resource, and requires a corresponding scheduling management method to regulate the cache resource.
  • an embodiment of the present disclosure provides a warehouse scheduling method.
  • the cache bit not only undertakes the container handover function, but also undertakes the container storage function. According to the occupation ratio of the cache bit in the container buffer area and Each cache bit stores the container score of the container, automatically generates the container return task, and automatically regulates the occupation ratio of the cache bit in the container cache area.
  • Fig. 12C is a processing flowchart of the storage scheduling method of the embodiment of the present disclosure. As shown in Fig. 12C, the container is moved from the storage location to the cache location, and then transferred to the workstation.
  • the container After the container is used, it is sent back to the cache location, that is, the process End; Then, introduce the occupancy ratio of the cache bit, mobilize the automatic return task according to the occupancy ratio of the cache bit and the value of the container, and return the container to the high-level storage bit. Because the container returns to the end of the cache bit process, the cache bit will be The occupancy ratio is always increasing, so there must be a function of automatically returning the container to the container storage area, so as to control the occupancy ratio balance of the cache bit.
  • a storage scheduling method is provided, and the disclosure also relates to a storage scheduling device, a computing device, and a computer-readable storage medium, which will be described in detail in the following embodiments one by one.
  • FIG. 13 shows a flow chart of a warehouse scheduling method according to an embodiment of the present disclosure.
  • the warehouse scheduling method is performed using the above warehouse system, and specifically includes the following steps 1302 , 1304 and 1306 .
  • Step 1302 Determine the occupancy ratio of cache bits in the container buffer area, where the container buffer area includes at least one cache bit.
  • the warehousing system includes a warehouse storage area.
  • the warehouse storage area includes a plurality of shelves arranged in a matrix.
  • a container buffer area and a container storage area are arranged on the shelf.
  • the container buffer area is located on the lower layer of the shelf, providing container transfer functions and container storage functions. ;
  • the container storage area is located on the upper level of the shelf, providing the storage function of the container. That is, the container storage area is located above the container buffer area, such as the bottom layer of the shelf is used as the container buffer area, and the other layers in the shelf except the bottom layer are all used as the container storage area.
  • the container cache area may include at least one cache bit, and each cache bit may cache a container.
  • the container refers to a structure for storing objects, and the objects may be items that need to be picked. At this time, the container may be a storage The crate for the item.
  • the storage system further includes a work station area including at least one work station, and the work station is configured for picking containers.
  • Containers are generally stored in the container storage area.
  • a handling robot When the containers are transferred from the warehouse storage area to the workstation for picking and processing, that is, when the containers in the container storage area leave the warehouse, a handling robot must first be used to transport the container from the container storage area to the container cache.
  • the transfer robot goes to the buffer position and relays the container to the workstation.
  • the picking is completed, the container is sent back from the workstation to the buffer position and stored in the buffer position, so as to free up part of the transportation resources of the transfer robot and realize the outbound of the container.
  • Efficiency is improved, but the container is stored in the cache, and it is very easy to occupy the cache resource. Therefore, the occupancy ratio of the cache in the container cache can be determined, and the occupancy of the cache can be dynamically adjusted based on the occupancy ratio, ensuring that it is used for container handover The task has enough cache bits.
  • the occupation ratio of cache bits in the container cache refers to the ratio of occupied cache bits in the container cache to the total cache bits, which can be obtained by dividing the number of occupied cache bits in the container cache by the total number of cache bits The occupancy ratio. Therefore, during specific implementation, the number of occupied cache bits in the container buffer area may be determined first, and based on the number of occupied cache bits combined with the total number of cache bits, the occupation ratio of cache bits in the container buffer area is determined.
  • the occupied cache bits in the container buffer area change dynamically, so determining the occupation ratio of the cache bits in the container buffer area can be specifically implemented through the following steps:
  • the occupation ratio of cache bits in the container buffer area is determined.
  • the cache bits in the container buffer area can be divided into four categories, currently occupied, currently vacant, about to be occupied, and about to be released.
  • Currently occupied refers to the cache slots that currently store containers in the container cache
  • currently vacant refers to the cache slots that do not currently store containers in the container cache
  • about to be occupied refers to the fact that no containers are currently stored in the container cache and will soon be available.
  • the cache bit transferred in by the container is about to be released refers to the cache bit where the container is currently stored in the container buffer, but the stored container is about to be returned to the container storage area.
  • the number of occupied cache bits refers to the number of currently occupied cache bits.
  • the number of occupied cache bits can be determined by directly reading the cache bits currently storing containers in each cache bit and counting the number; the number of cache bits to be occupied Refers to the number of cache bits to be occupied; the number of cache bits to be released refers to the number of cache bits to be released.
  • the storage scheduling platform can generate the container transfer task.
  • the container transfer task is sent to the robot. After receiving the task, the robot executes each task in turn, transferring the container from the container storage area to the cache location or returning the container in the cache location to the container storage area.
  • the number of cache bits to be occupied and the number of cache bits to be released can be determined according to the current container transfer task.
  • the warehouse scheduling platform can store the pending and executing container transfer tasks.
  • Each container transfer task carries a transfer start position and end position. For each container transfer task, if the transfer start position is a cache location , then add 1 to the number of cache bits to be released. If the transfer start location is the container storage area, add 1 to the number of cache bits to be occupied, and traverse each container transfer task in turn to determine the number of cache bits to be occupied and the number of cache bits to be released .
  • the sum of the number of occupied cache bits and the number of cache bits to be occupied can be determined first , and then subtract the number of cache bits to be released to determine the update occupancy number of cache bits in the container buffer area, and divide the update occupancy number by the total number of cache bits to obtain the occupancy of cache bits in the container buffer area Proportion.
  • the number of cache bits to be occupied and the number of cache bits to be released can be determined according to the current container transfer task, and then the container cache can be determined by combining the number of occupied cache bits, the number of cache bits to be occupied, and the number of cache bits to be released. Occupancy ratio of cache bits in the region. In this way, when determining the occupation ratio of the cache bits in the container buffer area, the dynamic changes of the cache bits in the container buffer area are considered, so that the occupation ratio of the cache bits in the container buffer area is more accurate, fits the actual application scenario, and ensures that the container Accuracy and real-time performance of dynamic regulation of cache bits in the cache area.
  • Step 1304 When the occupancy ratio of the cache space exceeds the set ratio threshold, determine the container score of each cache space in the container cache, where the container score is determined based on the sorting task to be performed and the number of objects in the container .
  • the set ratio threshold refers to the set water level, which is used to ensure that the occupied buffer space in the container buffer area will not be too much.
  • the set ratio threshold can be 60%, 70%, 80%, etc.
  • a pending picking task refers to a task waiting to pick objects from a container, and the number of objects in a container refers to the inventory of the container.
  • the container score can represent the value of the container, that is, the probability that the container may be frequently hit by the picking task.
  • the container score is obtained by scoring the container. It is considered that the value of the container is high. After sending it back to the cache from the workstation, if the container has a high score, it should stay in the cache as much as possible, that is, the container with a higher container score is stored in the container cache. Containers with lower storage container scores.
  • the storage scheduling platform can score the container according to the matching degree of the container's own inventory and the real-time picking task, that is, if the container can supply multiple picking tasks, the container will have a higher score.
  • the container score of the high-heat container on the container cache area is higher than the container score of the high-heat container on the container storage area to ensure that the high-heat container on the container cache area is not replaced; the container score of the high-heat container on the container storage area is higher than that of the container.
  • the high-heat container refers to the container whose temperature is higher than the set threshold
  • the container temperature refers to the number of times the container may be matched and used to perform the picking task to be performed, that is, the number of times the container may be transported.
  • the container score can make the cache bit in the container cache become a dynamic scarce resource, which is scrambled by the container, and the container with more matching tasks to be executed can stay in the container cache for a longer period of time.
  • the container score of each cache position storage container in the container buffer area can be determined. The container score is determined based on the picking task to be performed and the number of objects in the container, which can be expressed as The matching program between the container and the picking task to be executed identifies the value of the container. Therefore, the container score of the container stored in each cache bit in the container cache can be used to determine the cache bit to be released in the container cache, so that the cache to be released The returned containers in the slot are returned to the container storage area.
  • the container score of each container in the warehouse storage area can be determined regularly, that is, the container score can be updated regularly based on the current picking task to be performed and the current number of objects in the container.
  • the container score can be divided into the basic score and the heat value, that is, before determining the container score of each cache bit in the container cache area to store the container, it can also include:
  • a container score for the first container is determined based on the heat value and the base score.
  • the containers are stored in the container storage area or the container buffer area, and the transfer robot can only transfer the containers located in the container buffer area.
  • the containers stored in the container buffer area have a high turnover rate, that is, the container cache
  • the containers stored in the area can be hit by the sorting tasks to be executed multiple times and transferred by the transfer robot multiple times. Therefore, scoring the containers is to give high scores to the containers that have the potential to be used multiple times and place them in the container buffer area in advance.
  • For the objects in the container no matter how many objects (such as 1 or 10) are needed for the picking task, if they all match a container, the container will be transferred once, and there is no difference between the robot and the container. , so the importance of a container can be judged by the number of times it is potentially matched by the currently unexecuted picking tasks, that is, the container may match several picking tasks to be executed, rather than several commodities.
  • each target with the same target identifier in the first container can be defined as a target group, and the number of targets in a container can be regarded as composed of several target groups, that is, , a container includes at least one target group, a target group includes at least one target, and the target identifiers of the included targets are the same.
  • the container For any target group in the container, it is possible to calculate the inventory of the target group to meet the needs of the picking tasks to be executed, count the number of picking tasks matching the target group, and the number of picking tasks can represent the target group
  • the potential access times of the first container are added to the number of picking tasks of each target object group in the first container to obtain the potential access count of the first container, and then the heat value of the first container is determined based on the potential access count.
  • the heat value of each container can be determined.
  • the target identification refers to information such as characters/codes used to identify the target.
  • Targets with the same target identification indicate that they belong to a target group, and targets with different target identifications indicate that they belong to different target groups.
  • the target object identifier can be the commodity code (skuCode) and the batch code (batchCode). Commodities with the same commodity code (skuCode) and batch code (batchCode) belong to a commodity group, and the commodity code (skuCode) and batch code Commodities with different sub-numbers (batchCode) belong to different commodity groups.
  • the picking task count of the picking task to be executed is: 0.5*(8/10); if the inventory of the target object group meets the demand of the picking task to be executed, then the picking task to be executed is determined The count is 1. In this way, each picking task to be executed is traversed, and the final counting result is the number of picking tasks matched by the target object group.
  • different picking tasks to be executed can have different priorities, and each priority corresponds to a priority coefficient.
  • the counting results of each picking task to be executed can also be multiplied by The corresponding priority coefficients are then summed to obtain the number of picking tasks matching the target object group.
  • some sorting tasks to be executed may have determined which container to obtain the target object from.
  • the target object group in which the target object is located in the container is a pre-hit, thus determining each target in the first container
  • the potential access count can be mapped to a set fourth score range, and the upper and lower boundaries of the fourth score range are the first score range The difference between the upper and lower boundaries of .
  • the potential access count of the first container may be divided by the maximum potential access count of each container, and then multiplied by the difference between the upper and lower bounds of the fourth score range to obtain the heat value of the first container.
  • the fourth score ranges from 0 to 20, assuming that the maximum value of the potential access count of each container is 38, then the potential access count of the first container is T/38*20, and the heat value of the first container can be obtained.
  • the container score can be divided into three ranges, including the first score range, the second score range and the third score range, and the first score range is higher than the second score range and higher than the third score range. range of values.
  • the three score ranges can be used to determine base scores for different types of containers.
  • the container score can be divided into container heat value and basic score, and different types of containers can be set with different basic score, and then add the heat value that matches the picking task to the basic score, so as to determine The container score has improved the accuracy of determining the container score.
  • the corresponding basic score can be preset for different container types, that is, the basic score of the first container can be determined according to the container type.
  • the specific implementation process can be as follows:
  • the container type of the first container is a hit container
  • the basic score of the first container is determined to be the first set value, wherein the hit container refers to the container selected to perform the picking task, and the first set value is the first set value.
  • the container type of the first container is a non-hit container and is a container in the container cache area, determine that the basic score of the first container is a second set value, wherein the second set value is the second score the lower bound value of the range;
  • the container type of the first container is a non-hit container and is a container in the container storage area, determine that the basic score of the first container is a third set value, wherein the third set value is a third set value the lower bound value of the range;
  • the first score range, the second score range and the third score range are obtained based on the division of container scores, the first set value is higher than the second set value, and the second set value is higher than the third set value set value.
  • picking tasks to be performed may have determined which container to obtain the target object from.
  • the container type of a container is a hit container
  • the basic score of the first container is determined to be a first set value.
  • the corresponding base score can be set according to the storage location.
  • determine that the base score of the first container is the second set value; in the case that the container type of the first container is a container in the container storage area, determine The base score of the first container is a third set value.
  • the first set value is higher than the second set value and higher than the third set value.
  • the first score range is the container score range of the hit container
  • the second score range is the container score range of the container in the container cache area
  • the third score range is the container score range of the container in the container storage area.
  • the first score range is 80-100, and the first setting value is 80
  • the second score range is 60-80, and the second setting value is 60
  • the third score range is 40-60, and the third Set the value to 40.
  • the warehouse storage area calculate the number of picking tasks associated with the target group (that is, how many picking tasks to be executed have requirements for this target group), and associate The more, the more important the target group is, and the follow-up calculations start polling from the most important target group.
  • polling starts from the most important target object group. For each target object group, there are a series of available container candidates that can meet the picking task requirements of the target object group. From the container The container with the highest heat value (that is, the highest matching degree with the picking task to be executed) in the buffer area starts to be taken until the picking task requirement of the target object group is met (that is, the demand of each picking task to be executed for the target object group), or use Containers that can meet the picking task requirements of the target object group in the container buffer area.
  • the basic score of this container is set to the second set value (such as 60 points), and the container score of this container is the basic score of 60 points and the The sum of the heat values corresponding to the containers.
  • the remaining demand for the picking tasks of the target object group is updated, and the remaining demand can be satisfied by the containers in the container storage area.
  • the picking task requirements of some target object groups can already be met by the containers in the container buffer area (that is, the inventory of the target object group stored in the container buffer area is sufficient), and some If the demand of some target object groups cannot be satisfied by the containers in the container buffer area (that is, the inventory of the target object group stored in the container in the container buffer area is insufficient), it is necessary to continue to obtain from the container in the container storage area.
  • the target object group starts polling from the most important target group, if the picking task requirement of the target group has been satisfied by the container in the container buffer, then skip; if the picking task requirement of the target group is not satisfied by the container in the container buffer , the target object group also has available container candidates in the container storage area, similar to the process of the container buffer area, starting from the container with the highest heat value in the container storage area until the picking task requirements of the target object group are met, or using Finished container storage area that can satisfy the picking task requirements of the object group.
  • the basic score of this container is set to the third set value (such as 40 points), and the container score of this container is the basic score of 40 points and the The sum of the heat values corresponding to the containers.
  • the remaining demand for the picking tasks of the target object group is updated. No longer processed.
  • scoring is based on a fourth score range.
  • its basic score can be set to the fourth set value (such as 20 points), and for the unselected remaining containers in the container storage area, its basic score can be set to Set to the fifth set value (such as 0 points).
  • the first score range is higher than the second score range is higher than the third score range is higher than the fourth score range, these four score ranges constitute the interval of the container score; the first set value is higher than The second set value is higher than the third set value, higher than the fourth set value, higher than the fifth set value, and the fourth set value and the fifth set value are values within the fourth score range, such as the first The fourth set value is the middle value of the fourth score range, and the fifth set value is the lower boundary value of the fourth score range.
  • the first score range is 80-100, and the first setting value is 80; the second score range is 60-80, and the second setting value is 60; the third score range is 40-60, and the third The set value is 40; the range of the fourth score is 0-40, the fourth set value is 20, and the fifth set value is 0.
  • the handling robot has determined to carry it, that is, the hit container is not necessarily a relatively high-heat container, but the hit container is determined to have hit a picking task to be executed, and it will definitely be picked up later.
  • Containers for transport to workstations Therefore, no matter whether the hit container is located in the storage area or the cache area, the score of the hit container should be set larger, so as to ensure that the hit container can be in the cache area (or be transported to the cache area), and then be transported to the workstation by the robot.
  • a score of more than 80 points is given, which satisfies the consistency with the actual situation, but the score is not very meaningful, so the hit container is transported to the workstation to perform the picking task, and after being sent back to the buffer area, it still needs to be scored again , to determine whether to keep it in the cache or send it back to storage.
  • the high scores of matching orders on the container storage area are distributed between 40-60 points.
  • these containers When these containers are to be moved to the buffer area, if there is no empty space in the buffer area, they should not replace the more frequent containers on the buffer area (60- 80 points), and can replace relatively low-frequency containers (20-40 points).
  • two identical containers in the buffer area because the former one matches the order demand, but the latter one does not match the order demand.
  • the popularity value is 15. According to the above logic, it may be divided into 75 and 35 respectively. This situation represents The meaning of the physical world is that too many containers containing a certain object may be moved to the cache area, and some of them need to be moved back to the storage area, or it may be that the algorithm does not reserve redundant space.
  • Step 1306 According to the container score, determine the cache position to be released in the container cache area, and generate a return task for the container to be returned in the cache position to be released, wherein the return task is used to indicate that the container to be returned is transferred from the cache position to be released Return to container storage area.
  • the container score can represent the value of the container, so the cache bit to be released in the container buffer area can be determined according to the container score value, and the cache bit with a lower container score among the various cache bits in the container buffer area can be used as To release the cache bit, release the container in it.
  • the warehouse scheduling platform can generate The return task of the container, the return task can be issued to the handling robot, and the handling robot will return the container to be returned from the cache position to be released to the container storage area.
  • the specific implementation process can be as follows:
  • the difference between the occupation ratio and the set ratio threshold may represent the number of over-occupied cache bits in the container cache, and thus the number of cache bits to be released may be determined according to the difference.
  • the difference can be directly multiplied by the total number of cache bits as the number of cache bits to be released, that is, the number of more occupied cache bits is the number of cache bits to be released; or, in order to avoid frequent release of cache bits container, the difference can also be multiplied by the set value and the total number of cache bits as the number of cache bits to be released, that is, some more cache bits are released at one time.
  • the container scores of each cache bit storage container can be sorted from high to low (or from low to high), and the ones with the lower (or higher) sorting can be selected.
  • the cache bit corresponding to the number container score is used as the cache bit to be released. In this way, when the occupancy ratio of the cache space in the container cache exceeds the set ratio threshold, the container with a lower container score in the container cache can be returned to the container storage area, so as to release the container cache space in the container cache .
  • the number of cache bits to be released can be obtained as 2.
  • 6 of the highest container scores in the container cache area can be reserved, and the cache bits of the containers corresponding to the lowest 2 container scores are used as the cache to be released place to return the 2 lowest container score containers to container storage.
  • the destination location can be carried in the return task, that is, a return task for the container to be returned in the cache position to be released can be generated.
  • the specific implementation process can be as follows:
  • a return task is generated based on the cache to be released and the target storage, wherein the return task is used to return the container to be returned stored in the cache to be released to the target storage.
  • the target storage location may be any storage location in the container storage area of each lane in the warehouse storage area, that is, the container to be returned in the cache location to be released may be returned to any storage location in the container storage area .
  • a free storage location can be randomly selected from the container storage area of each lane in the warehouse storage area as the target storage location, and the storage location in the same lane as the cache location to be released is preferentially selected.
  • a storage in a different lane from the buffer space to be released may be selected as the target storage space.
  • the return task is generated based on the buffer position to be released and the target storage position, that is, the position identification of the cache position to be released and the target storage position is carried in the return task.
  • the robot can release the The container to be returned stored in the cache location is returned to the target storage location, so as to release the container cache location in the container buffer area, thereby dynamically adjusting the occupation ratio of the cache location in the container buffer area.
  • the storage system (that is, the warehouse storage area) includes at least two lanes, and each lane is provided with a container storage area and a container buffer area.
  • the mechanism of automatically returning containers it can basically ensure that the probability of high-scoring containers remaining in the cache is higher than that of low-scoring containers.
  • the way that high-scoring containers are left in the cache may make the proportion of high-scoring containers in the cache not high, and it may also appear that a certain lane is full of high-scoring containers, while another lane is full of low-scoring containers. Therefore, this disclosure
  • the high-scoring containers in the container storage area may also be transferred to the container buffer area.
  • the transfer tasks of transferring high-scoring containers in the container storage area to the container cache area can be roughly divided into two categories, namely, single-box transfer tasks and replacement tasks, which are implemented as follows Examples are discussed one by one.
  • the storage scheduling method in addition to regularly determining the occupancy ratio of cache bits in the container buffer area so as to return the low-scoring containers in the container buffer area to the container storage area, it is also possible to regularly determine the high-score container in the container storage area Container, transfer the high-score container in the container storage area to the container buffer area. That is, the storage scheduling method also includes:
  • the container transfer task of the container to be transferred is generated based on the first storage location and the first cache location, wherein the first storage location is the storage location of the container to be transferred in the container storage area, and the container transfer task is used to instruct the container to be transferred from the first The storage bit is transferred to the first cache bit.
  • the container to be transferred in the container storage area to be transferred to the container buffer area is regularly determined at intervals of a first preset time period. Specifically, when determining the containers to be transferred from the container storage area to the container buffer area, the preset maximum number of containers that can be transferred to the container buffer area during each update process can be obtained first, and the maximum number of containers can be determined Finally, select the maximum number of containers with the highest container score from each storage location in the container storage area, and the selected container is the container to be transferred, which can be transferred to the container buffer area.
  • each candidate container whose container score is higher than the score threshold can also be selected from each storage location in the container storage area first. If the number of candidate containers is greater than the maximum number of containers, then the candidate container with the highest score is selected from each candidate container. The maximum number of containers is candidate containers, and the selected candidate container is the container to be transferred. If the number of candidate containers is not greater than the maximum number of containers, each candidate container is directly used as a container to be transferred.
  • 20 containers in the container storage area can be transferred to the container buffer area for storage every 5 minutes, so the 20 containers with the highest score can be selected from each container in the container storage area as the containers to be transferred.
  • the score threshold combined with the score threshold, first select candidate containers that are greater than the score threshold from each container in the container storage area. If there are less than 20 candidate containers, for example, only 10, then the 10 candidate containers are the containers to be transferred .
  • the first buffer position corresponding to the container to be transferred in the container buffer area can be determined, that is, the buffer position to which the container to be transferred is transferred.
  • the first cache location and the first storage location may be located in the same lane or in different lanes.
  • the warehouse scheduling platform can generate a container transfer task for the container to be transferred based on the first storage location and the first cache location, and send the container transfer task to the corresponding robot, so that the robot can perform the transfer task and transfer the container to be transferred from The first storage bit is transferred to the first cache bit.
  • the container to be transferred is the current
  • the high-score containers in the container storage area can be transferred to the container cache at regular intervals, ensuring the quantity of cache space occupied by the container cache area and the quality of the containers occupying the cache space.
  • the storage system includes at least two lanes, and each lane is provided with a container storage area and a container buffer area; to determine the first buffer position corresponding to the container to be transferred in the container buffer area, the specific implementation process can be as follows:
  • the first cache location corresponding to the container to be transferred in the container buffer area it may be prioritized to determine whether there is an available cache location in the first container buffer area that belongs to the same lane as the container storage area where the container to be transferred is located. , that is, the container to be transferred can be preferentially transferred to the buffer position of the container buffer area of the same lane.
  • the available cache bits include free cache bits and/or cache bits with lower container scores.
  • the container to be transferred can be transferred to the cache bit in the same lane, that is, the first cache bit can be determined from the available cache bit in the first container buffer area .
  • the idle cache bit among the available cache bits can be determined as the first cache bit first (if there are multiple free cache bits, one will be randomly selected), if the available cache bits are all cache bits with a lower container score , it means that there are containers stored in the available cache slots, but the storage container has a lower score, then the cache slot with the lowest score can be preferentially selected as the first cache slot, and the container to be transferred can be transferred to the first cache slot bit to replace a container with a lower container score on the first cache slot.
  • the containers to be transferred can be transferred to the cache in other lanes at this time, that is, Cross-lane transfer, that is, determine the first buffer position from the second container buffer area that does not belong to the same lane as the container storage area where the container to be transferred is located.
  • the first cache bit may be selected from the second container buffer area in combination with whether there is a free cache bit in each second container buffer area and the container score of the occupied cache bit.
  • the container to be transferred can be transferred to the buffer position of the same lane, or the container to be transferred can be transferred to the buffer position of another lane, and the high-scoring container in the container storage area is transferred to the container buffer area At the same time, it can be transferred in the same lane or across lanes, which balances the container scores of containers stored in the container buffer areas of different lanes, and avoids the accumulation of high-scoring containers in a certain lane.
  • a container transfer task for the container to be transferred is generated based on the first storage location and the first cache location.
  • a replacement task for storing the container in the first cache position is generated, wherein the replacement task is used to instruct the handling robot to return the storage container in the first cache position to the container storage area, and transfer the container to be transferred from the first cache position to the container storage area.
  • a storage bit is transferred to the first cache bit;
  • a first container handling task for the container to be transferred is generated based on the first storage location and the first cache location, wherein the first container handling task is used to instruct the handling robot to transfer the container to be transferred from the first storage location Move to the first cache location.
  • the container transfer task of the container to be transferred is generated.
  • the container transfer task is to transfer the container to be transferred from the first storage location to the first cache location, so the first storage location can be determined Whether there is a container currently stored in the first cache location. If there is a container stored, the container to be transferred needs to be replaced by the container currently stored in the first cache location. Therefore, a replacement task for the container stored in the first cache location can be generated at this time.
  • Warehouse scheduling The platform can send the scheduling task to the handling robot, and the handling robot can return the storage container in the first cache position to the container storage area, and transport the container to be transferred from the first storage position to the first cache position.
  • returning the storage container in the first cache position to the container storage area, and transporting the container to be transferred from the first storage position to the first cache position can be performed successively by one transport robot, or can be performed synchronously by two transport robots .
  • a storage location can be randomly determined from the container storage area as the storage location of the target, and the destination storage location The position identifier is carried in the replacement task, so that the handling robot returns the storage container in the first buffer position to the destination storage position.
  • a container handling task that is, carry the position identifiers of the first storage position and the first buffer position in the first container handling task, so that the handling robot can transport the container to be transferred from the first storage position to the first buffer position.
  • FIG. 14A is a schematic diagram of the execution process of the container handling task in the same lane according to the embodiment of the present disclosure.
  • a container buffer area and a container storage area are set on the shelf, the high-scoring container represents the container to be transferred, and the target location Indicates the first cache position.
  • the transport robot can perform the transport task to transport the high-resolution container from the first storage position to the first cache position.
  • Fig. 14B is a schematic diagram of the implementation process of the container replacement task in the same laneway according to the embodiment of the present disclosure. As shown in Fig.
  • a container buffer area and a container storage area are set on the shelf, a container with a high score represents the container to be transferred, and a container with a low score represents the first
  • the storage container in the cache position is replaced by the handling robot to replace the low score container in the first cache position with the high score container in the first storage position.
  • the task of container handling or container replacement can be performed in the same lane, so that the high-scoring containers in the container storage area of the lane can be transferred to the container buffer area of the same lane, ensuring the number of cache bits occupied by the container buffer area At the same time, the quality of the container occupying the cache bit is also guaranteed.
  • the first cache location and the first storage location belong to different lanes, that is, when transferring across lanes, a container transfer task for the container to be transferred is generated based on the first storage location and the first cache location.
  • the specific implementation process can be as follows :
  • a second container handling task for the container to be transferred is generated based on the first storage position, wherein the second container handling task is used to instruct the handling robot to transport the container to be transferred from the first storage position to the second buffer position, and the second buffer position and The first storage location belongs to the same lane;
  • a transfer task is generated for the container to be transferred based on the second cache location and the first cache location, wherein the transfer task is used to instruct the transfer robot to move the container to be transferred from the second cache location Transfer to the first cache bit.
  • the cross-lane transfer task is divided into two stages. In the first stage, the container to be transferred is first transported to the container buffer area of the same lane, and in the second stage, the container to be transferred is transferred from the container buffer area of the same lane. Transshipped to the first cache bit of the cross-lane container buffer.
  • the second container handling task for the container to be transferred can be generated based on the first storage position, and the handling robot can transport the container to be transferred from the first storage position to the second buffer position based on the second container handling task.
  • the second cache location and the first storage location belong to the same lane, and the second cache location is any cache location in the container buffer area of the same lane, that is, the first stage is the transfer from the same lane container storage area to the container buffer area.
  • a transfer task is generated for the container to be transferred based on the second cache location and the first cache location, and the transfer robot can transfer the container to be transferred from the second cache location based on the transfer task.
  • the position is transferred to the first cache position, that is, cross-lane transfer, and the container to be transferred is transferred from the current lane to the cache position of other lanes.
  • the containers to be transferred can be transferred to the cache positions of other lanes, so as to balance the container scores of the containers stored in the container buffer areas of different lanes, and avoid accumulation of high-scoring containers in a certain lane.
  • a transshipment task is generated for the container to be transferred.
  • the specific implementation process may be as follows:
  • a third container handling task for the container stored in the first cache position is generated, wherein the third container handling task is used to instruct the handling robot to move the storage container in the first cache position from the first cache position to the first cache position.
  • Two storage locations, the first cache location and the second storage location are in the same lane or different lanes;
  • a transfer task is generated for the container to be transferred based on the second cache location and the first cache location.
  • the specific implementation process of generating the transshipment task for the container to be transferred based on the second cache location and the first cache location is similar to the above-mentioned container transfer task process of generating the container to be transferred based on the first storage location and the first cache location , the present disclosure will not repeat them here.
  • FIG. 14C is a schematic diagram of the execution process of the cross-lane container handling task of the embodiment of the present disclosure.
  • the containers stored in the buffer positions in the container buffer area of the lane in District 6 are all high-heat.
  • containers with high shelf scores are not dominant, but at this time there are available cache positions in Area 1, that is, the first cache position is the cache position in the container buffer area of Area 1.
  • a single-box handling task can be generated.
  • the transfer robot is relatively cumbersome to perform cross-region transfer, so as shown in Figure 14C, the transfer robot and the transfer robot container relay are carried out, that is, the transfer task is first performed by the transfer robot, and then the transfer task is performed by the transfer robot.
  • Fig. 14D is a schematic diagram of the execution process of the container replacement task across the same lane in the embodiment of the present disclosure.
  • Fig. 14D if it is difficult to find a free cache space in the container buffer area of No. 6 area, it is necessary to generate a cross-area Replace task.
  • the high-score container in District 6 is to be placed on the cache position of the low-score container in District 1, and the cache position has a low-temperature container (i.e. a low-score container), as shown in Figure 14D, you can now Carry out the handling task by the handling robot, transfer the low-scoring container to the upper floor (such as the upper floor of No. 2 area), and then perform the relay handling process as shown in Figure 14C.
  • a low-temperature container i.e. a low-score container
  • the storage scheduling method provided by the present disclosure can determine the occupation ratio of the cache space in the container buffer area.
  • the cache bits for container handover may be insufficient.
  • the containers to be returned are returned to the container storage area, thereby dynamically controlling the occupancy ratio of the cache bits in the container buffer area, and ensuring that there are sufficient cache bits in the container buffer area for container handover.
  • the container buffer area can also be used for container storage, that is, after the container is picked at the workstation, the transfer robot does not need to send the container back to the container buffer area after the transfer robot returns the container from the workstation
  • the container can be directly stored in the cache area, and then based on the occupation ratio of the cache bits in the container cache area, the transfer of the container in the cache area is dynamically controlled, and the container can be stored in the container cache area, which improves the container reuse rate, thereby improving It improves the efficiency of container outbound and object picking, and greatly saves the transportation resources of robots.
  • FIG. 15 shows a schematic structural diagram of the warehouse scheduling device according to the embodiment of the present disclosure.
  • the device includes a first determining module 1502 , a second determining module 1504 and a generating module 1506 .
  • the first determining module 1502 is configured to determine the occupancy ratio of cache bits in the container buffer area, where the container buffer area includes at least one cache bit;
  • the second determination module 1504 is configured to determine the container score of each cache location in the container buffer area for storing containers when the occupancy ratio of the cache location exceeds the set ratio threshold, wherein the container score is based on the picking task to be performed and the container Determination of the number of target objects;
  • the generation module 1506 is configured to determine the cache position to be released in the container cache area according to the container score, and generate a return task for the container to be returned in the cache position to be released, wherein the return task is used to indicate that the container to be returned is removed from the cache position to be released Free cache bits are returned to container storage.
  • the storage scheduling device can determine the occupancy ratio of the cache space in the container buffer area.
  • the cache bits for container handover may be insufficient.
  • the containers to be returned are returned to the container storage area, thereby dynamically controlling the occupancy ratio of the cache bits in the container buffer area, and ensuring that there are sufficient cache bits in the container buffer area for container handover.
  • the container buffer area can also be used for container storage, that is, after the container is picked at the workstation, the transfer robot does not need to send the container back to the container buffer area after the transfer robot returns the container from the workstation
  • the container can be directly stored in the cache area, and then based on the occupation ratio of the cache bits in the container cache area, the transfer of the container in the cache area is dynamically controlled, and the container can be stored in the container cache area, which improves the container reuse rate, thereby improving It improves the efficiency of container outbound and object picking, and greatly saves the transportation resources of robots.
  • the first determination module 1502 is further configured to:
  • the occupation ratio of cache bits in the container buffer area is determined.
  • generating module 1506 is further configured to:
  • generating module 1506 is further configured to:
  • a return task is generated based on the cache to be released and the target storage, wherein the return task is used to return the container to be returned stored in the cache to be released to the target storage.
  • the apparatus also includes a transfer module configured to:
  • the container transfer task of the container to be transferred is generated based on the first storage location and the first cache location, wherein the first storage location is the storage location of the container to be transferred in the container storage area, and the container transfer task is used to instruct the container to be transferred from the first The storage bit is transferred to the first cache bit.
  • the storage system includes at least two lanes, and each lane is provided with a container storage area and a container buffer area; the transfer module is further configured to:
  • the transfer module is further configured to:
  • a replacement task for storing the container in the first cache position is generated, wherein the replacement task is used to instruct the handling robot to return the storage container in the first cache position to the container storage area, and transfer the container to be transferred from the first cache position to the container storage area.
  • a storage bit is transferred to the first cache bit;
  • a first container handling task for the container to be transferred is generated based on the first storage location and the first cache location, wherein the first container handling task is used to instruct the handling robot to transfer the container to be transferred from the first storage location Move to the first cache location.
  • the transfer module is further configured to:
  • a second container handling task for the container to be transferred is generated based on the first storage position, wherein the second container handling task is used to instruct the handling robot to transport the container to be transferred from the first storage position to the second buffer position, and the second buffer position and The first storage location belongs to the same lane;
  • a transfer task is generated for the container to be transferred based on the second cache location and the first cache location, wherein the transfer task is used to instruct the transfer robot to move the container to be transferred from the second cache location Transfer to the first cache bit.
  • the transfer module is further configured to:
  • a third container handling task for the container stored in the first cache position is generated, wherein the third container handling task is used to instruct the handling robot to move the storage container in the first cache position from the first cache position to the first cache position.
  • Two storage locations, the first cache location and the second storage location are in the same lane or different lanes;
  • a transfer task is generated for the container to be transferred based on the second cache location and the first cache location.
  • the device also includes a scoring module configured to:
  • a container score for the first container is determined based on the heat value and the base score.
  • the scoring module is further configured to:
  • the container type of the first container is a hit container
  • the basic score of the first container is determined to be the first set value, wherein the hit container refers to the container selected to perform the picking task, and the first set value is the first set value.
  • the container type of the first container is a non-hit container and is a container in the container cache area, determine that the basic score of the first container is a second set value, wherein the second set value is the second score the lower bound value of the range;
  • the container type of the first container is a non-hit container and is a container in the container storage area, determine that the basic score of the first container is a third set value, wherein the third set value is a third set value the lower bound value of the range;
  • the first score range, the second score range and the third score range are obtained based on the division of container scores, the first set value is higher than the second set value, and the second set value is higher than the third set value set value.
  • FIG. 16 shows a structural block diagram of a computing device 1600 according to an embodiment of the disclosure.
  • Components of the computing device 1600 include, but are not limited to, memory 1610 and processor 1620 .
  • the processor 1620 is connected to the memory 1610 through the bus 1630, and the database 1650 is used for saving data.
  • Computing device 1600 also includes access device 1640 that enables computing device 1600 to communicate via one or more networks 1660 .
  • networks include Public Switched Telephone Network (PSTN, Public Switched Telephone Network), Local Area Network (LAN, Local Area Network), Wide Area Network (WAN, Wide Area Network), Personal Area Network (PAN, Personal Area Network) or networks such as the Internet Composition of communication networks.
  • PSTN Public Switched Telephone Network
  • LAN Local Area Network
  • WAN Wide Area Network
  • PAN Personal Area Network
  • Internet Composition of communication networks such as the Internet Composition of communication networks.
  • the access device 1640 may include one or more of wired or wireless network interfaces of any type (for example, a network interface card (NIC, Network Interface Controller)), such as IEEE802.11 wireless local area network (WLAN, Wireless Local Area Networks) Wireless interface, Worldwide Interoperability for Microwave Access (Wi-MAX, Worldwide Interoperability for Microwave Access) interface, Ethernet interface, Universal Serial Bus (USB, Universal Serial Bus) interface, cellular network interface, Bluetooth interface, Near Field Communication (NFC , Near Field Communication) interface, and so on.
  • NIC Network Interface Card
  • NIC Network Interface Controller
  • the above-mentioned components of the computing device 1600 and other components not shown in FIG. 16 may also be connected to each other, such as through a bus. It should be understood that the structural block diagram of the computing device shown in FIG. 16 is only for the purpose of illustration, rather than limiting the scope of the present disclosure. Those skilled in the art can add or replace other components as needed.
  • Computing device 1600 can be any type of stationary or mobile computing device, including mobile computers or mobile computing devices (e.g., tablet computers, personal digital assistants, laptop computers, notebook computers, netbooks, etc.), mobile phones (e.g., smartphones, ), wearable computing devices (eg, smart watches, smart glasses, etc.), or other types of mobile devices, or stationary computing devices such as desktop computers or PCs.
  • mobile computers or mobile computing devices e.g., tablet computers, personal digital assistants, laptop computers, notebook computers, netbooks, etc.
  • mobile phones e.g., smartphones, ), wearable computing devices (eg, smart watches, smart glasses, etc.), or other types of mobile devices, or stationary computing devices such as desktop computers or PCs.
  • Computing device 1600 may also be a mobile or stationary server.
  • processor 1620 is configured to execute the following computer-executable instructions to implement the steps of the warehouse scheduling method.
  • An embodiment of the present disclosure also provides a computer-readable storage medium storing computer instructions, which are used to implement the steps of the warehouse scheduling method when executed by a processor.
  • An embodiment of the present disclosure further provides a computer program product, including a computer program, and when the computer program is executed by a processor, the steps of the above storage scheduling method are implemented.
  • Computer instructions include computer program code, which may be in the form of source code, object code, executable file, or some intermediate form.
  • the computer-readable medium may include: any entity or device capable of carrying computer program code, recording medium, U disk, removable hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access Memory (RAM, Random Access Memory), electrical carrier signal, telecommunication signal and software distribution medium, etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Mechanical Engineering (AREA)
  • Economics (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Warehouses Or Storage Devices (AREA)

Abstract

一种仓储系统和仓储调度方法。仓储系统包括仓库储存区(7)、工作站区(8)、搬运机器人(9)和转运机器人。仓库储存区(7)包括多个呈矩阵排列的货架(5),货架(5)上设置有容器缓存区和容器储存区。工作站区(8)包括至少一个工作站,工作站被配置为用于对容器(6)进行处理。搬运机器人(9)被配置为负责容器(6)在容器缓存区和容器储存区间的调配。转运机器人被配置为负责容器(6)在容器缓存区和工作站之间的交换。该仓储系统和仓储调度方法无需输送线装置,提高了容器出库效率和目标物拣选效率,节省了机器人的运力资源。

Description

仓储系统及仓储调度方法
相关申请的交叉引用
本申请基于下列中国专利申请提出,并要求这些中国专利申请的优先权:
申请号为202122055035.3、申请日为2021年8月27日的中国专利申请;
申请号为202122054995.8、申请日为2021年8月27日的中国专利申请;
申请号为202210590668.0、申请日为2022年5月27日的中国专利申请,
这些中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本公开涉及物流设备领域,特别涉及一种仓储系统、一种货架、一种转运机器人、一种转运系统、一种仓储调度方法、一种仓储调度装置、一种计算设备、一种计算机可读存储介质以及一种计算机程序产品。
背景技术
随着工业自动化程度的提高,转运机器人的应用越来越多,应用更加广泛,并且可以替代人工搬运,节省人力物力。但是现有的转运机器人只能负责容器的运输,不能取放容器,需要人工将容器放置到搬运机器人上,再通过人工将搬运机器人上的容器取走,而且容器在搬运机器人上的放置位置不能准确限定和定位,所以不能实现全流程的自动化运转。
发明内容
为了解决现有技术中存在的问题,本公开提供了一种仓储系统、一种货架、一种转运机器人、一种转运系统、一种仓储调度方法、一种仓储调度装置、一种计算设备、一种计算机可读存储介质以及一种计算机程序产品。
根据本公开的第一方面,提供了一种仓储系统,包括:仓库储存区,所述仓库储存区包括多个呈矩阵排列的货架,所述货架上设置有容器缓存区和容器储存区;工作站区,所述工作站区包括至少一个工作站,所述工作站被配置为用于对容器进行处理;搬运机器人,所述搬运机器人被配置为负责容器在容器缓存区和容器储存区间的调配;转运机器人,所述转运机器人被配置为负责容器在容器缓存区和工作站之间的交换。
在一些实施例中,所述仓库储存区中,横向排列的多个货架之间形成了多条横向通道,纵向排列的多个货架之间形成了多条纵向通道;多条所述横向通道和多条所述纵向通道交错设置。
在一些实施例中,所述横向通道被配置为用于转运机器人通行;所述竖向通道被配置为用于搬运机器人通行。
在一些实施例中,所述搬运机器人被配置为通过所述横向通道由一纵向通道交换到另一纵向通道中。
在一些实施例中,所述横向通道被构造为供不同的转运机器人双向同时行驶。
在一些实施例中,所述容器缓存区和容器储存区在货架垂直方向上依次交替设置;或者所述容器缓存区设置有至少一层,至少一层所述容器缓存区位于容器储存区的下方。
在一些实施例中,所述货架的最底层为容器缓存区,所述容器缓存区包括在水平方向上彼此相邻且平行设置的容器缓存位和缓存区通道;所述转运机器人被配置为满载时或者空载时在所述缓存区通道中行驶。
在一些实施例中,所述缓存区通道沿着货架的纵向方向延伸,形成纵向缓存区通道;和/或,所述缓存区通道沿着货架的横向方向延伸,形成横向缓存区通道。
在一些实施例中,所述容器缓存位的底部与地面之间形成了供转运机器人空载时行驶的空载行驶通道。
在一些实施例中,所述转运机器人被配置将容器缓存区上的容器转运至工作站的货架平台上;所述工作站被配置为对位于货架平台上的容器进行处理。
在一些实施例中,所述工作站包括至少一个处理区,且被配置为对位于处理区的转运机器人上的容器进行处理。
在一些实施例中,所述工作站被配置为当处理区内转运机器人上的容器处理完毕后,向下一转运机器人发出在容器缓存区取容器的指令。
在一些实施例中,所述工作站包括至少一个排队区,所述转运机器人被配置为当处理区被占用时在排队区依次排队。
在一些实施例中,所述处理区和排队区相对应,且分别设置有至少两个。
在一些实施例中,所述工作站包括显示器,所述显示器被配置为用于显示指引操作人员的信息。
在一些实施例中,所述工作站包括灯光指引装置,所述灯光指引装置被配置为用于投射出辅助操作人员操作的信息。
在一些实施例中,所述工作站包括交互按钮,所述交互按钮被配置为用于当操作人员完成操作后与系统的交互确认。
在一些实施例中,所述工作站包括货容器位姿检测装置,所述货容器位姿检测装置被配置为用 于检测转运机器人上容器的姿态。
在一些实施例中,所述工作站包括安全防护装置,所述安全防护装置为用于阻止转运机器人进入工作站的防护门。
在一些实施例中,所述工作站包括安全防护装置和控制单元,所述安全防护装置为检测传感器;所述控制单元基于所述检测传感器检测到的误入工作站处理区的电信号,向转运机器人发出停止进站的指令。
在一些实施例中,所述工作站包括识别装置,所述识别装置被配置为获取转运机器人上容器的信息。
在一些实施例中,所述工作站包括视觉识别装置和控制单元,所述识别装置被配置为用于识别容器中的商品种类或者数量;和/或被配置为用于识别操作人员的操作手势;所述控制单元基于视觉识别装置获得的错误信息发出报警信号。
在一些实施例中,在所述仓库储存区与工作站区之间设置有高速行驶区;所述转运机器人在高速行驶区的行驶速度大于其在仓库储存区的行驶速度。
根据本公开的第二方面,提供了一种货架,所述货架用于根据本公开的第一方面的仓储系统,包括:容器缓存区;和容器储存区。
在一些实施例中,所述容器缓存区和容器储存区在货架垂直方向上依次交替设置;或者所述容器缓存区设置有至少一层,至少一层所述容器缓存区位于容器储存区的下方。
在一些实施例中,所述货架的最底层为容器缓存区,所述容器缓存区包括在水平方向上彼此相邻且平行设置的容器缓存位和缓存区通道。
在一些实施例中,所述缓存区通道沿着所述货架的纵向方向延伸,形成纵向缓存区通道;和/或,所述缓存区通道沿着所述货架的横向方向延伸,形成横向缓存区通道。
根据本公开的第三方面,提供了一种转运机器人,所述转运机器人用于根据本公开的第一方面的仓储系统,包括:底盘机构;举升机构,所述举升机构设置在所述底盘机构上;顶板,所述顶板设置在所述举升机构上,且受控于举升机构驱动上升或下降;所述顶板用于与容器接触的一面设置有与容器底部配合的定位机构;所述顶板被构造为用于将容器顶起或落下。
在一些实施例中,所述定位机构包括定位销或定位孔;所述定位销设置在所述顶板上,用于与定位销配合的定位孔设置在容器的底部;或者所述定位孔设置在所述顶板上,用于与定位孔配合的定位销设置在容器的底部。
在一些实施例中,所述定位销或定位孔至少设置有两个,分布在顶板或容器的相对两侧区域。
在一些实施例中,所述定位销至少其顶部表面呈圆锥面结构,所述定位孔的形状与所述定位销相配合。
在一些实施例中,所述举升机构还包括驱动组件和至少具有一个剪叉单元的剪叉组件,所述剪叉组件底端与所述底盘机构活动连接、顶端与顶板活动连接,所述驱动组件用于驱动所述剪叉组件在竖直方向升降。
在一些实施例中,所述剪叉单元包括两个交叉设置并且在交叉处铰接的第一连杆组件、第二连杆组件;邻近所述顶板的剪叉单元中的第一连杆组件顶端与所述顶板铰接,第二连杆组件顶端相对所述顶板在水平方向移动;邻近所述底盘机构的剪叉单元的第一连杆组件底端与所述底盘机构铰接,第二连杆组件底端相对所述底盘机构在水平方向移动;相邻两个所述剪叉单元之间铰接在一起。
在一些实施例中,所述顶板底部设置有水平方向延伸的第一导向机构,与顶板邻近的剪叉单元中的第二连杆组件被构造为在第一导向机构中水平移动;所述底盘机构的顶部设置有水平方向延伸的第二导向机构,与底盘机构邻近的剪叉单元中的第二连杆组件被构造为在第二导向机构中水平移动。
在一些实施例中,所述剪叉单元中用于与第一导向机构、第二导向机构配合的第二连杆组件的端头设有滚轮,所述滚轮被构造为沿所述第一导向机构、第二导向机构滚动。
在一些实施例中,所述剪叉组件包括两个剪叉单元,位于上方的所述剪叉单元包括铰接连接的第一上连杆组件和第二上连杆组件,位于下方的所述剪叉单元包括铰接连接的第一下连杆组件和第二下连杆组件;所述第一上连杆组件的顶端与所述顶板铰接、底端与所述第一下连杆组件的顶端铰接,所述第二上连杆组件的顶端支撑在所述顶板底部并且相对顶板水平方向移动、底端与所述第二下连杆组件的顶端铰接;所述第一下连杆组件的底端与所述底盘机构铰接,所述第二下连杆组件的底端支撑在所述底盘机构上并且相对底盘机构水平方向移动。
在一些实施例中,所述驱动组件包括摇杆、驱动电机和连接在所述驱动电机输出端的凸轮,所述摇杆的其中一端与凸轮铰接、另一端铰接在所述剪叉组件上;所述驱动电机被配置为通过摇杆驱动所述剪叉组件升降。
根据本公开的第四方面,提供了一种转运系统,包括根据本公开的第三方面的转运机器人、至少一个货架,所述转运机器人被配置为将位于货架上的容器顶起,或者被配置为将顶板上的容器放置在货架上。
在一些实施例中,所述货架包括架体,所述架体上具有多个成排设置的第一容器位,所述第一容器位具有用于支撑容器的支撑部,所述支撑部设置有供所述转运机器人通过的开口端。
在一些实施例中,所述货架上还设置有用于放置容器的第二容器位,所述第二容器位设置在所述第一容器位的上方,还包括搬运机器人,所述搬运机器人被配置为将位于第二容器位上的容器转 移至第一容器位上。
在一些实施例中,所述第一容器位设置有至少一层,位于所述架体上第二容器位的底部。
根据本公开的第五方面,提供了一种仓储调度方法,所述仓储调度方法是使用根据本公开的第一方面的仓储系统进行的,包括:确定容器缓存区中缓存位的占用比例,其中,容器缓存区包括至少一个缓存位;在缓存位的占用比例超过设定比例阈值的情况下,确定容器缓存区中各个缓存位存放容器的容器分值,其中,容器分值基于待执行拣选任务与容器中目标物数量确定;根据容器分值,确定容器缓存区中的待释放缓存位,并生成针对待释放缓存位中待归还容器的归还任务,其中,归还任务用于指示将待归还容器从待释放缓存位归还至容器储存区。
在一些实施例中,确定容器缓存区中缓存位的占用比例,包括:确定容器缓存区中的已占用缓存位数目;根据当前的容器转移任务,确定待占用缓存位数目和待释放缓存位数目;根据已占用缓存位数目、待占用缓存位数目和待释放缓存位数目,确定容器缓存区中缓存位的占用比例。
在一些实施例中,根据容器分值,确定容器缓存区中的待释放缓存位,包括:确定占用比例与设定比例阈值的差值,并根据差值确定待释放缓存位的数目;对各个缓存位存放容器的容器分值进行排序,根据排序结果,选取该数目待释放缓存位。
在一些实施例中,生成针对待释放缓存位中待归还容器的归还任务,包括:确定待释放缓存位对应的目标储存位;基于待释放缓存位和目标储存位生成归还任务,其中,归还任务用于将待释放缓存位中存放的待归还容器归还至目标储存位。
在一些实施例中,确定容器缓存区中各个缓存位存放容器的容器分值之前,还包括:每间隔第一预设时长,确定容器储存区中待转移至容器缓存区的待转移容器;确定待转移容器在容器缓存区对应的第一缓存位;基于第一储存位和第一缓存位生成待转移容器的容器转移任务,其中,第一储存位为待转移容器在容器储存区的储存位置,容器转移任务用于指示将待转移容器从第一储存位转移至第一缓存位。
在一些实施例中,仓储系统包括至少两个巷道,每个巷道均设置有容器储存区和容器缓存区;确定待转移容器在容器缓存区对应的第一缓存位,包括:确定第一容器缓存区中是否存在可用缓存位,其中,第一容器缓存区与待转移容器所处的容器储存区属于同一巷道;若存在可用缓存位,则从可用缓存位中确定第一缓存位;若不存在可用缓存位,则从第二容器缓存区中确定第一缓存位,其中,第二容器缓存区与待转移容器所处的容器储存区不属于同一巷道。
在一些实施例中,第一缓存位与第一储存位属于同一巷道;基于第一储存位和第一缓存位生成待转移容器的容器转移任务,包括:确定第一缓存位当前是否存放有容器;若存放有容器,则生成针对第一缓存位中存放容器的替换任务,其中,替换任务用于指示搬运机器人将第一缓存位中的存放容器归还至容器储存区、并将待转移容器从第一储存位搬运至第一缓存位;若未存放有容器,则基于第一储存位和第一缓存位生成针对待转移容器的第一容器搬运任务,其中,第一容器搬运任务用于指示搬运机器人将待转移容器从第一储存位搬运至第一缓存位。
在一些实施例中,第一缓存位与第一储存位属于不同巷道;基于第一储存位和第一缓存位生成待转移容器的容器转移任务,包括:基于第一储存位生成针对待转移容器的第二容器搬运任务,其中,第二容器搬运任务用于指示搬运机器人将待转移容器从第一储存位搬运至第二缓存位,第二缓存位与第一储存位属于同一巷道;在待转移容器搬运至第二缓存位的情况下,基于第二缓存位和第一缓存位针对待转移容器生成转运任务,其中,转运任务用于指示转运机器人将待转移容器从第二缓存位转运至第一缓存位。
在一些实施例中,基于第二缓存位和第一缓存位针对待转移容器生成转运任务,包括:确定第一缓存位当前是否存放有容器;若存放有容器,则生成针对第一缓存位中存放容器的第三容器搬运任务,其中,第三容器搬运任务用于指示搬运机器人将第一缓存位中存放容器从第一缓存位移动至第二存储位,第一缓存位与第二存储位处于同一巷道或不同巷道;在第一缓存位中存放容器搬运出第一缓存位的情况下,基于第二缓存位和第一缓存位针对待转移容器生成转运任务。
在一些实施例中,确定容器缓存区中各个缓存位存放容器的容器分值之前,还包括:确定第一容器中的至少一个目标物组匹配的拣选任务数目,其中,第一容器为容器缓存区和容器储存区中存放的任一容器,目标物标识相同的目标物构成一个目标物组;根据至少一个目标物组匹配的拣选任务数目,确定第一容器的热度值;确定第一容器的容器类型,并根据容器类型,确定第一容器的基础分值;根据热度值和基础分值,确定第一容器的容器分值。
在一些实施例中,根据容器类型,确定第一容器的基础分值,包括:在第一容器的容器类型为命中容器的情况下,确定第一容器的基础分值为第一设定值,其中,命中容器是指被选中执行拣选任务的容器,第一设定值为第一分值范围的下边界数值;在第一容器的容器类型为非命中容器、且为容器缓存区中容器的情况下,确定第一容器的基础分值为第二设定值,其中,第二设定值为第二分值范围的下边界数值;在第一容器的容器类型为非命中容器、且为容器储存区中容器的情况下,确定第一容器的基础分值为第三设定值,其中,第三设定值为第三分值范围的下边界数值;其中,第一分值范围、第二分值范围和第三分值范围为基于容器分值划分获得,第一设定值高于第二设定值,且第二设定值高于第三设定值。
根据本公开的第六方面,提供了一种仓储调度装置,包括:第一确定模块,被配置为确定容器缓存区中缓存位的占用比例,其中,容器缓存区包括至少一个缓存位;第二确定模块,被配置为在缓存位的占用比例超过设定比例阈值的情况下,确定容器缓存区中各个缓存位存放容器的容器分值,其中,容器分值基于待执行拣选任务与容器中目标物数量确定;生成模块,被配置为根据容器分值,确定容器缓存 区中的待释放缓存位,并生成针对待释放缓存位中待归还容器的归还任务,其中,归还任务用于指示将待归还容器从待释放缓存位归还至容器储存区。
根据本公开的第七方面,提供了一种计算设备,包括:存储器和处理器;存储器用于存储计算机可执行指令,处理器用于执行计算机可执行指令,以实现上述仓储调度方法的步骤。
根据本公开的第八方面,提供了一种计算机可读存储介质,其存储有计算机可执行指令,该指令被处理器执行时实现上述仓储调度方法的步骤。
根据本公开的第九方面,提供了一种计算机程序产品,包括计算机程序,所述计算机程序被处理器执行时实现上述仓储调度方法的步骤。
本公开的有益效果在于,转运机器人能够实现容器的升降,其顶板上的定位机构能够与容器配合,对容器的位置进行精准定位,在容器转运系统中,转运机器人能够自行取放货架上容器的工作,节省了力劳动,并且能够通过定位机构对容器的位置进行准确定位,提高了容器位置的准确性和稳定性,转运机器人既能够运输容器,又能够自行取放容器,实现了全流程的自动化运转。
本公开的仓储系统,无需输送线装置,极大提高了方案的柔性,便于快速施工、动态增减机器人等优势。
本公开提供的仓储调度方法,确定容器缓存区中缓存位的占用比例,其中,容器缓存区包括至少一个缓存位;在缓存位的占用比例超过设定比例阈值的情况下,确定容器缓存区中各个缓存位存放容器的容器分值,其中,容器分值基于待执行拣选任务与容器中目标物数量确定;根据容器分值,确定容器缓存区中的待释放缓存位,并生成针对待释放缓存位中待归还容器的归还任务,其中,归还任务用于指示将待归还容器从待释放缓存位归还至容器储存区。
这种情况下,可以确定容器缓存区中缓存位的占用比例,在缓存位的占用比例超过设定比例阈值的情况下,说明容器缓存区中存放了过多的容器,用于执行容器交接的缓存位可能不足,此时可以基于容器缓存区中各个缓存位存放容器的容器分值,确定容器缓存区中的待释放缓存位,并生成对应的归还任务,将待释放缓存位中的待归还容器归还至容器储存区,从而动态控制容器缓存区中缓存位的占用比例,保证容器缓存区中有充足的缓存位用于容器交接。如此,容器缓存区除了用于容器交接之外,还可以用于容器存放,也即容器在工作站拣选完毕后,转运机器人将该容器从工作站送回容器缓存区后,无需将该容器送回容器储存区,该容器可以直接存放于缓存区,后续基于容器缓存区中缓存位的占用比例,动态控制缓存区中容器的转移,容器可以存放于容器缓存区,提高了容器复用率,进而提高了容器出库效率和目标物拣选效率,极大节省了机器人的运力资源。
附图说明
被结合在说明书中并构成说明书的一部分的附图示出了本公开的实施例,并且连同其说明一起用于解释本公开的原理。
图1是本公开实施例的转运机器人的整体结构示意图。
图2是本公开实施例的容器的结构示意图。
图3是本公开实施例的转运机器人的顶板的结构示意图。
图4是图3中A部分的放大图。
图5是本公开实施例的转运机器人的顶板的剖视图。
图6是本公开实施例的转运机器人的举升机构的结构示意图。
图7是本公开实施例的容器转运系统的整体结构示意图。
图8是本公开实施例的仓储系统的整体分布图。
图9是图8中相邻两个货架的结构示意图。
图10是图8中部分货架的俯视图。
图11是本公开实施例的工作站的结构布置图。
图12A是本公开实施例的仓储系统的结构示意图。
图12B是本公开实施例的仓储调度中容器转移方法的处理流程图;
图12C是本公开实施例的仓储调度方法的处理流程图;
图13是本公开实施例的仓储调度方法的流程图;
图14A是本公开实施例的同巷道容器搬运任务的执行过程示意图;
图14B是本公开实施例的同巷道容器替换任务的执行过程示意图;
图14C是本公开实施例的跨巷道容器搬运任务的执行过程示意图;
图14D是本公开实施例的跨同巷道容器替换任务的执行过程示意图;
图15是本公开实施例的仓储调度装置的结构示意图;
图16是本公开实施例的计算设备的结构框图。
具体实施方式
现在将参照附图来详细描述本公开的各种示例性实施例。应注意到:除非另外具体说明,否则在这些实施例中阐述的部件和步骤的相对布置、数字表达式和数值不限制本公开的范围。
以下对至少一个示例性实施例的描述实际上仅仅是说明性的,决不作为对本公开及其应用或使用的任何限制。
对于相关领域普通技术人员已知的技术、方法和设备可能不作详细讨论,但在适当情况下,所 述技术、方法和设备应当被视为说明书的一部分。
在这里示出和讨论的所有例子中,任何具体值应被解释为仅仅是示例性的,而不是作为限制。因此,示例性实施例的其它例子可以具有不同的值。
应注意到:相似的标号和字母在下面的附图中表示类似项,因此,一旦某一项在一个附图中被定义,则在随后的附图中不需要对其进行进一步讨论。
在本公开一个或多个实施例中使用的术语是仅仅出于描述特定实施例的目的,而非旨在限制本公开一个或多个实施例。在本公开一个或多个实施例和所附权利要求书中所使用的单数形式的“一种”和“该”也旨在包括多数形式,除非上下文清楚地表示其他含义。还应当理解,本公开一个或多个实施例中使用的术语“和/或”是指并包含一个或多个相关联的列出项目的任何或所有可能组合。
应当理解,尽管在本公开一个或多个实施例中可能采用术语第一、第二等来描述各种信息,但这些信息不应限于这些术语。这些术语仅用来将同一类型的信息彼此区分开。例如,在不脱离本公开一个或多个实施例范围的情况下,第一也可以被称为第二,类似地,第二也可以被称为第一。取决于语境,如在此所使用的词语“如果”可以被解释成为“在……时”或“当……时”或“响应于确定”。
本公开提供了一种转运机器人,如图1至图6所示,包括底盘机构1、举升机构2和顶板3,举升机构2设置在底盘机构1上方,顶板3设置在举升机构2顶部,顶板3受控于举升机构2驱动上升或下降。顶板3用于承载容器6,顶板3被配置为用于将容器6顶起或落下。顶板3用于与容器6接触的一面设置有与容器6底部配合的定位机构4,实现对容器6的位置进行精准定位。
定位机构4包括相互配合的定位销41或定位孔42。在一种实施例中,定位销41设置在顶板3上,用于与定位销41配合的定位孔42设置在容器6的底部。在另一种实施例中,定位孔42设置在顶板3上,用于与定位孔42配合的定位销41设置在容器6的底部。
定位销41或定位孔42可以分别设置有一个,也可以至少设置有两个。本实施例中,如图2和图3所示,定位销41和定位孔42各设置有两个,并且分布在顶板3或容器6的相对两侧区域。定位销41可以是凸出于顶板3或容器6表面的凸起,具体可以是扁平的柱形、锥形或球面形等结构,定位孔42的形状与定位销41配合。定位销41的至少其顶部表面成圆锥面结构,以便于定位销41能够顺利进入定位孔42中。如图4所示为定位销41的一种具体结构,其设置为呈扁平的圆柱形,其远离连接顶板3或容器6一端设置为圆锥结构。
定位销41与顶板3或容器6表面可以是不可拆卸的固定连接,如一体成型、焊接、粘接等连接方式;也可以是可拆卸固定连接,如螺纹连接、卡接等;定位销41还可以设置为弹性伸缩结构,在自由状态下伸出顶板3或容器6的底面,在受到外力作用时能够收缩至顶板3或容器6内。
在定位销41为弹性伸缩结构的实施例中,如图5所示,顶板3或容器6表面开设安装孔43,安装孔43内设置弹性件44,定位销41连接在弹性件44上,定位销41在外力作用下能够压缩弹性件44并收缩至安装孔43内。当弹性的定位销41设置在顶板3上时,顶板3可以用来运输普通容器,普通容器放置在顶板3上时能够将定位销41压回安装孔43中,从而普通容器能够平稳放置。当弹性的定位销41设置在容器6底部时,容器6能够平稳的放置在平整的平面上,定位销41受平面压力而收缩至安装孔43内。
底盘机构1具有行走组件,行走组件可以沿着特定的轨道行走,也可以受控于控制系统,行走组件能够接收指令并按照指定路径行走,将指定位置的容器6运送至另一指定位置。底盘机构1上可以设置传感器,传感器包括多种,例如视觉传感器、激光测距传感器、红外传感器、激光传感器等,能够检测自身的位置,以及货架、容器6、障碍物等其他目标物的位置,并将位置信号发送至智能控制系统。转运机器人可以配置导航系统,能够根据自身位置、目标物实际位置和目标物指定位置规划行走路线。
举升机构2可以采用如剪叉式升降机构,直线驱动器等等。如图6所示,在举升机构2采用剪叉式升降机构的实施例中,举升机构2包括驱动组件和至少一个具有剪叉单元的剪叉组件,剪叉组件底端与底盘机构1活动连接、顶端与顶板3活动连接,驱动组件用于驱动剪叉组件在竖直方向升降,驱动组件可以受控于控制系统。剪叉单元至少具有两个,且在纵向方向上排列,剪叉单元的数量可以根据举升高度的需要进行选择,剪叉单元的数量越多,其举升高度越高。
剪叉单元包括两个交叉设置并且在交叉处铰接的第一连杆组件210和第二连杆组件220。位于最上方的剪叉单元邻近顶板3,该剪叉单元的第一连杆组件210顶端与顶板3铰接,第二连杆组件220能够相对顶板3在水平方向移动。位于最下方的剪叉单元邻近底盘机构1,该剪叉单元的第一连杆组件210底端与底盘机构1铰接,第二连杆组件220能够相对底盘机构1在水平方向移动。任意相邻的两个剪叉单元之间铰接在一起。当剪叉组件仅有一个剪叉单元时,位于最上方的邻近顶板3的剪叉单元和位于最下方的邻近底盘机构1的剪叉单元为同一个剪叉单元。
剪叉单元升高时,第二连杆组件220的顶端逐渐靠近第一连杆组件210的顶端,第二连杆组件220的底端逐渐靠近第一连杆组件210的底端;剪叉单元降落时,第二连杆组件220的顶端逐渐远离第一连杆组件210的顶端,第二连杆组件220的底端逐渐远离第一连杆组件210的底端。剪叉组件升高或降落时,各剪叉单元的第一连杆2101和第二连杆2201同时相对转动,第一连杆2101和第二连杆2201的顶端高度能够同步升降,从而能够稳定的升起或落下顶板3。
第一连杆组件210包括两根平行设置的第一连杆2101,以及连接在两根第一连杆2101之间的第一横梁2102。第二连杆组件220包括两根相互平行的第二连杆2201,以及连接在两根第二连杆2201之间的第二横梁2202。上下相邻的两个剪叉单元中,位于同一侧的上下两个第一连杆2101相 铰接,位于同一侧的上下两个第二连杆2201相铰接。邻近顶板3的剪叉单元中,两根第一连杆2101上端均与顶板3铰接,两根第二连杆2201上端均能够相对顶板3在水平方向移动;在邻近底盘机构1的剪叉单元中,两根第一连杆2101下端均与底盘机构1铰接,两根第二连杆2201下端均能够相对底盘机构1在水平方向移动。
顶板3的底部设置有水平方向延伸的第一导向机构230,与顶板3邻近的剪叉单元中的第二连杆组件220被构造为在第一导向机构230中水平移动。底盘机构1的顶部设置有水平方向延伸的第二导向机构240,与底盘机构1邻近的第二连杆组件220被构造为在第二导向机构240中水平方向移动。两个第二连杆组件220分别沿着第一导向机构230和第二导向机构240相对于顶板、底盘机构1在水平方向移动,从而保证其剪叉组件的升降稳定性。剪叉单元中用于与第一导向机构230、第二导向机构240配合的第二连杆2201端头设置有滚轮250,滚轮250被构造为沿第一导向机构230、第二导向机构240滚动。滚轮250与第一导向机构230、第二导向机构240之间的摩擦力较小,能够减轻磨损。
具体地,第一导向机构230设置有两个,分别对应邻近顶板3的第二连杆组件220的两根第二连杆2201;第二导向机构240也设置有两个,分别对应邻近底盘机构1的第二连杆组件220的两根第二连杆2201。邻近顶板3的第二连杆组件220的两根第二连杆2201端头均设置有沿第一导向机构230滚动的滚轮250,邻近底盘机构1的第二连杆组件220的两根第二连杆2201端头均设置有沿第二导向机构240滚动的滚轮250。第一导向机构230和第二导向机构240可以采用角钢制作,角钢的其中一条侧边固定连接在顶板3或底盘机构1的表面上,并分别与顶板3和底盘机构1表面围成导向槽结构。滚轮250在角钢与顶板3或底盘机构1表面形成的导向槽中滚动。
本实施例以下详细介绍剪叉组件的一种具体实施例。
本实施例中,如图6所示,剪叉组件包括两个剪叉单元,位于上方的剪叉单元的第一连杆组件210为第一上连杆组件211、第二连杆组件220为第二上连杆组件212,位于下方的剪叉单元的第一连杆组件210为第一下连杆组件221、第二连杆组件220为第二下连杆组件222。
顶板3的底部和底盘机构1上均设置有铰接座,第一上连杆组件211的顶端与顶板3底部的铰接座铰接,第一上连杆组件211的底端与第一下连杆组件221的顶端铰接,第一下连杆组件221的底端与底盘机构1上的铰接座铰接。第二上连杆组件212的顶端支撑在顶板3底部并且相对顶板3水平方向移动,第二上连杆组件212的底端与第二下连杆组件222的顶端铰接,第二下连杆组件222的底端支撑在底盘机构1上并且相对底盘机构1水平方向移动。
顶板3的底部设置有第一导向机构230,第二上连杆组件212的顶端设置有在第一导向机构230中行走的滚轮250;底盘机构1上设置有第二导向机构240,第二下连杆组件222的底端设置有在第二导向机构240中行走的滚轮250。
驱动组件包括摇杆260、驱动电机270和连接在驱动电机270输出端的凸轮280,摇杆260的其中一端与凸轮280铰接,另一端铰接在剪叉组件上。驱动电机270固定在底盘机构1的上,其被配置为通过摇杆260驱动剪叉组件升降。驱动电机270工作时驱动凸轮280转动,摇杆260与凸轮280铰接的一端在凸轮280的驱动下绕凸轮280转动,摇杆260的另一端驱动剪叉组件的第一连杆2101和第二连杆2201相对转动,从而实现驱动剪叉组件升降。
驱动组件还可以是线性电机、液压缸等驱动器。在一种实施例中,驱动器一端铰接在顶板3或底盘机构1上、另一端铰接在剪叉组件上。在另一种实施例中,驱动器两端均铰接在剪叉组件上,该种实施例中,驱动器可以两端铰接在不同的剪叉单元上,驱动器也可以两端分别铰接在同一剪叉单元的第一连杆2101和第二连杆2201上。
本公开还提供了一种容器转运系统,如图7所示,包括上述的转运机器人和货架5。转运机器人被配置为将位于货架5上的容器6顶起,或者被配置为将顶板3上的容器6放置在货架5上。
货架5包括架体,架体上具有成排设置的多个第一容器位51,第一容器位51用于放置容器6,多个第一容器位51位于货架5的底层,第一容器位51具有用于支撑容器6的支撑部511。支撑部511设置有供容器6转运机构通过的开口端5111,并且第一容器位51与架体的最底端之间留有容许转运机器人通过的高度。支撑部511可以是U形结构的支撑梁,形成一个开口端5111,也可以是仅支撑在容器6相对两侧的两个支撑梁,形成相对两个开口端5111。
架体上还可以设置多个第二容器位52,多个第二容器位52成排设置在第一容器位51的上方,并且可以在第一容器位51上方排列为多层。容器转运系统还包括搬运机器人,搬运机器人被配置为将位于第二容器位52上的容器6转移至第一容器位51上。
搬运机器人可以采用现有技术,本实施例中以下提供一种搬运机器人并介绍其具体的结构和工作原理。搬运机器人具有升降机构和取还容器机构,升降机构用于驱动取还容器机构上下移动,取还容器机构包括底板和两个伸缩臂,两个伸缩臂被配置为能够勾取或推送容器6。两个伸缩臂伸出后能够将位于第二容器位52的容器6勾取至底板上,然后升降机构将容器6降低至第一容器位51的高度,再通过两个伸缩臂将容器6推送至第一容器位51上。搬运机器人还可以被配置为将位于第一容器位51的容器6转移至第二容器位52上。
向转运机器人发送取容器的命令,转运机器人接收命令后,通过举升机构2将顶板3降低至低于第一容器位51;然后通过底盘机构1行走至指定容器6所在货架5的第一容器位51下方,再通过举升机构2将顶板3从第一容器位51支撑部511的开口端5111升起,将容器6抬起,同时定位机构4能够对容器6进行准确定位;抬起容器6后,转运机器人从支撑部511的开口端5111离开, 从而将容器6取走。第一容器位51的容器6被取走后,搬运机器人可以将第二容器位52的容器6移动到第一容器位51上。
向转运机器人发送还容器送命令,转运机器人接收命令后,通过举升机构2将顶板3上的容器6升高,使容器6高于货架5第一容器位51的支撑部511;然后通过底盘机构1行走至指定第一容器位51的开口端5111内,再通过举升机构2使容器6下降,将容器6放置在指定第一容器位51的支撑部511上。搬运机器人可以将放置在第一容器位51上的容器6转移到第二容器位52上。
容器转运系统实现了转运机器人自行取放货架5上容器6的工作,节省了劳动力,并且能够通过定位机构对容器的位置进行准确定位,提高了容器位置的准确性和稳定性,转运机器人既能够运输容器,又能够自行取放容器,实现了全流程的自动化运转。
传统的仓储系统中,搬运机器人通过从仓库内取出容器并直接送至工作站,完成拣选后送回仓库的形式来完成自动化的拣选。这种模式下,无论工作站是采用输送线的形式,还是在机器人身上直接完成拣选的形式,都是由同一台机器人完成全部的动作。搬运机器人本身比较高大,运行相对缓慢;同时成本高昂,这就不可避免的带来了效率低下、性价比低等缺陷。针对此,业内也出现了一系列优化的方案,比如使用第三方的设备来将机器人身上的容器快速移除和补充,从而缩短交接等待时间,提高机器人的利用率,但这种方案没有改变使用搬运机器人完成取容器-送容器-拣选-还容器等全系列的动作,上述的缺陷依然存在;同时还为整体方案引入了刚性,不利于现场施工和后期的修改。
而本公开的实施例中,通过搬运机器人来实现容器在第一容器位和第二容器位之间的转换,通过转运机器人完成容器在第一容器位和工作站之间的流转。转运机器人可以取一个容器,也可以取两个容器,无论其整体高度、运行速度及成本均优于搬运机器人,由此可大大提高仓储系统的工作效率。
在一个实施例中,图7示意出了一层第一容器位51及三层第二容器位52的结构示意图。第一容器位51位于第二容器位52的下方位置,这样便于转运机器人对位于第一容器位51上的容器进行转运。
在一个实施例中,第一容器位51也可以设置两层、三层或者更多层,多层第一容器位51均位于第二容器位52的下方。例如货架从底部开始,其第一层为第一容器位,第二层为第一容器位,第三层为第二容器位,第四层为第二容器位。转运机器人在进行转运的时候,可以首先将位于最底层第一容器位51上的容器进行转运,之后再根据实际情况对上层第一容器位51的容器进行转运,依次来完成对不同层第一容器位51的转运。
在一个实施例中,第一容器位51、第二容器位52也可以在垂直方向上依次交替设置。例如,货架的最底层可以为第一容器位51,其上为第二容器位52,再其上可选的又为第一容器位51,依次类推。也可以是货架最底层可以为第一容器位51,第二至第n层为第二容器位52,第n+1层为第一容器位,第n+2层至第2n层为第二容器位,也可以是,最底层为第二容器位52,其上为第一容器位51,再其上可选的又为第二容器位52,在此不再一一举例。
在该实施例中,需要选用可以对上层第一容器位51进行转运的机器人。也可以重新设计第一容器位51的结构,例如可以选择使用受控于驱动机构的输送机构作为第一容器位51,通过驱动机构的驱动可以将位于第一容器位51上的容器往外输送,这样可以选择结构较为简单、运行速度更快的机器人来完成第一容器位51上的取、放容器动作。还可以是,第一容器位51的下方设置可以行走的台面,转运机器人可以经斜坡行走至该台面上,以将该台面上方第一容器位51上的容器进行取放。
本公开的第一容器位51作为缓存区,第二容器位52作为容器储存区。由搬运机器人完成容器在缓存区、容器储存区之间的交换,由转运机器人将缓存区内的容器搬运至工作站,完成拣选后再返回缓存区,由搬运机器人继续完成容器在缓存区、容器储存区之间的交换,从而完成拣选。当转运机器人带着容器在完成拣选后,也可以选择不再送回缓存区,送到其它位置进行储存。采用的转运方式,搬运机器人、转运机器人分工明确,各司其职。另外,转运机器人由于其结构及其实际工作需求,其运行速度一般情况下远大于搬运机器人的速度,大大提高了容器的分拣的效率。
图10示意出了本公开一种仓储系统,其包括仓库储存区7、高速行驶区73和工作站区8。
具体地,仓库储存区7中设有呈矩阵排列的多个货架70,货架70可以采用上述实施例中的货架结构。多个货架70排列在一起,横向排列的多个货架70之间在仓库储存区7形成了横向通道71,纵向排列的多个货架70之间在仓库储存区7形成了纵向通道72,这些横向通道71、纵向通道72交叉在一起,构成了供转运机器人、搬运机器人行走的空间。基于此,可以合理布置供转运机器人、搬运机器人的行走路线。例如,鉴于转运机器人、搬运机器人不同的任务分配,可以配置使搬运机器人仅在纵向通道72中穿行,配置使转运机器人可以在横向通道71中穿行。
在一些实施例中,纵向通道72可以为单向通道,横向通道71可以为双向通道。这是由于纵向通道72仅分配给搬运机器人使用,横向通道可以分配给转运机器人使用,由于在仓储系统中,转运机器人设置多个,多个转运机器人需要同时在仓库储存区7、和工作站区8中不停的穿梭,因此设置横向通道为双向通道,这样多个转运机器人可以在横向通道上同时双向行驶,有利于提高转运机器人的转运速度,避免它们之间的相互让行。
在一些实施例中,横向通道71也可以同时分配给搬运机器人、转运机器人使用。这样使得搬运机器人可以借助于横向通道71在不同的纵向通道72中工作,使搬运机器人可以同时负责多排货 架上容器在缓存区和容器储存区之间的交换。当搬运机器人、转运机器人在横向通道71中存在路径冲突时,可以根据预制的处理策略选择搬运机器人让行或者转运机器人让行。
为了在仓库储存区7为转运机器人规划出更多的通行路径,在一个实施例中,缓存区不但包括容器缓存位(第一容器位),还包括供转运机器人行走的缓存区通道。
图9示意出了该种结构的示意图,在图9示意出的部分仓储储存区7中,包括第一货架70a、第二货架70b,第一货架70a和第二货架70b的结构可以是一致的。第一货架70a的底层为缓存区,缓存区的上层为容器储存区。缓存区包括了相邻设置的第一容器缓存位700(也可以理解为上述的第一容器位)和缓存区通道702。缓存区通道702可以贯穿整个第一货架70a,由此转运机器人可以经过缓存区通道702对其相邻位置的第一容器缓存位700上的容器进行取容器或者放容器。例如转运机器人还可以在缓存区通道702中穿行至其它货架的位置,或者穿行至其它的横向通道等。选择使转运机器人在缓存区通道702中对第一容器缓存位700上的容器进行操作,可避免转运机器人长时间占用横向通道,提高了横向通道的流畅性,避免多个转运机器人在横向通道造成拥堵。
在另一个实施例中,缓存区通道702也可以作为满载转运机器人的通道,即,主要供转运机器人取到容器后通行。这是由于容器位于转运机器人上后,其整体高度增加,因此需要在缓存区通道702中通行。此时空载的转运机器人可以直接在第一容器缓存位700的下方通行,直到行驶到合适的容器位后,将容器从某个对应的第一容器位取下后,转入缓存区通道702中通行。
在一个实施例中,空载的转运机器人也可以借助缓存区通道702来通行,根据具体的实际需求和路径规划而定,在此不再具体说明。
图9示意出的第一货架70a中,底层设置有两条纵向延伸的第一容器缓存位700和两条纵向设置的缓存区通道702,每条缓存区通道702对应各自的第一容器缓存位700。两条缓存区通道702设置在第一货架70a的中部,而两条纵向设置的第一容器缓存位700设置在第一货架70a的外侧。当然,对于本领域的技术人员而言,第一货架70a上第一容器缓存位和缓存区通道702的数量不限制,可以是更多,或者更少,在此不再具体说明。
第一货架70a中,作为容器储存区的第一容器储存位701(也可理解为上述的第二容器位)设置在第一容器缓存位700的上方。在图9示意出的实施例中,第一货架70a和第二货架70b之间形成了供搬运机器人9穿行的纵向通道72。搬运机器人9通过其升降组件和取还容器组件可以实现容器在第一容器缓存位700和第一容器储存位701之间的交换,即将位于第一容器储存位701上的容器转移到第一容器缓存位700,或者将位于第一容器缓存位700上的容器转移到第一容器储存位701中。
需要说明的是,货架可以只包含一条纵向延伸的第一容器缓存位700和一条纵向设置的缓存区通道702,即货架可以只包含图9所示的第一货架70a的一半。这样的货架可以在空间不足以放置图9所示的第一货架70a时放置,或者在其它场景需要时放置,进一步提高仓库存储率。
在一个实施例中,搬运机器人9可以在同一货架的容器储存区、缓存区中实现容器的交换。还可以是,多个货架共用容器储存区和缓存区,即搬运机器人9可以将一个货架容器储存区上的容器转移至另一货架的缓存区;或者,将一个货架缓存区上的容器转移至另一货架的容器储存区中。
搬运机器人负责在区域间进行容器的转移。例如负责容器在容器储存区与缓存区之间互相转移,来总体调配容器在不同区域之间的分布。也可以在同一个区域内不同位置之间进行转移,例如在缓存区的不同容器缓存位间进行转移,或者在容器储存区的不同容器储存位间进行转移,来总体调配容器在同一个区域内不同位置上的分布。
搬运机器人被配置为完成容器在挑选缓存区和容器储存区中的交换,调配容器在不同区域的分布。每一个容器分配在不同区域可以由多个因素决定,在一个实施例中,可以由四个因素决定:该容器是否被任务命中,该容器的算法打分,不同区域的储存限制,区域内或者区域间分布的合理性等。
在一个实施例中,搬运机器人被配置基于任务分配将容器在挑选缓存区和容器储存区进行交换。当容器被任务命中时,即系统给该容器分配拣选任务后,该容器的当前状态决定了其后续的操作。即,若容器当前已经位于缓存区(第一容器位或者容器缓存位),则由转运机器人直接将其搬运前往任务所指向的目的地。若该容器当前位于容器储存区(第二容器位或者容器储存位),则由搬运机器人将其转移至缓存区,然后由转运机器人将其搬运前往任务所指向的目的地。
在一个实施例中,每一个容器都会根据内部所装的货物进行打分,所装的货物出库的概率相对较高,则该货物的分数较高;将一个容器内的所有货物的分数进行加权相加,会得到一个容器的总分。
容器的分数可以考虑多种因素,在本实施例中,可以考虑容器内所装的货物种类,有些货物的分值占比高,有些则相对较低,相应货物的分值会预存在系统内。如果该容器内所装的货物分值较高,则该容器的分值也会相对高。
货物的分数也可以根据该货物出库概率来进行计算,例如可以统计预定时间内货物的出库概率,如果某种货物的在预定时间内的出库次数多,则该货物的分值则较高,反之则较低。例如统计一个月内所有货物的出库次数,并计算得到一个月内货物的出率概率,也可称为货物的热销度。
容器的总分可选的会进行归一化的处理后成为每一个容器的分数;容器的分数会随着库存变化或者对出库量的预期两个方面的变化而发生变化。容器的分数并不是固定不变的,而是通过定期计算或者由库存变动的事件触发来计算更新容器的分数。
容器在进行分配时,会倾向于将打分相对较低的容器放在容器储存区,打分相对较高的容器放在缓存区。这样会相对减少搬运机器人的操作次数,提高了拣选的效率。
当容器的分数发生变动,使得容器分数与所处的区域不匹配时,则会触发容器位置的调整。即,搬运机器人基于容器的分数将分数高的容器由容器储存区转移至缓存区,或者被将分数低的容器由缓存区转移至容器储存区。
在一个实施例中,搬运机器人被配置为基于容器储存区或缓存区的储存比例,来完成容器在缓存区及容器储存区间的转移。
当某一区域内的储存超过设定的阈值时,会触发容器的调整。比如当缓存区内容器储存超过一定比例时,需要将部分容器由缓存区转移至容器储存区。和/或,缓存区内容器储存低于一定比例时,需要将部分容器由容器储存区转移至缓存区。转移的规则会参照容器的打分和命中的情况,优先将打分较低或者没有被命中的容器调回容器储存区;反之,若容器储存区储存超过设定的阈值时,需要将部分容器由容器储存区调整至缓存区,转移的规则类似,优先将打分较高或者已经被命中的容器调整至缓存区。
在一些实施例中,容器在区域内或者区域间的不同分布会影响机器人取放的效率,当分布不合理导致机器人取放过于集中或者过于分散时,会触发容器位置的调整,来调整机器人在不同区域搬运的路径和集中度的合理性。
在一些实施例中,缓存区通道702可以沿着货架的纵向方向延伸,形成纵向缓存区通道,也可以沿着货架的横向方向延伸,形成横向缓存区通道。纵向缓存区通道和横向缓存区通道分布在不同的货架中,由此可使转运机器人借助于横向缓存区通道和纵向缓存区通道在仓库储存区中穿梭,这有利于转运机器人的路径规划,提高了仓储系统的效率。
对应地,在一些实施例中,与缓存区通道702相邻的第一容器缓存位的排列方向可以是纵向排列,也可以是横向排列。转运机器人需要行驶到第一容器缓存位的下方来进行取放料操作,因此这些排列在一起的第一容器缓存位底部与地面之间形成了可以供转运机器人空载状态时穿行的空载行驶通道703。空载行驶通道703可以在纵向上延伸,也可以在横向上延伸,这与第一容器缓存位的排列方式有关。空载转运机器人可以沿着纵向排列的第一容器缓存位的底部在纵向方向上通行,也可以沿着横向排列的第一容器缓存位的底部在横向方向上通行,这丰富了机器人的路径规划,提高了容器流转的效率。
在图10示意出的实施例中,
①指代的是转运机器人的横向通道(上文中用标号71指代),用于转运机器人在不同的通道之间切换,根据实际情况,该横向横道可以是单向通道,也可以是双向通道,无论转运机器人是满载状态还是空载状态均可通行。
②是满载转运机器人纵向缓存区通道702,用于带有容器的转运机器人通行,空载转运机器人也可借道通行。
③是空载转运机器人纵向通道(空载行驶通道703),仅可用于空载转运机器人通行,通道上方是第一容器缓存位。
④是空载转运机器人横向通道(空载行驶通道703),仅可用于空载转运机器人通行,通道会穿过第一容器缓存位。该空载转运机器人横向通道可以在单个货架上形成,也可以由多个排列在一起的多个货架构成。
⑤是转运机器人的横向通道(上文中用标号71指代),可用于满载和空载转运机器人通行,通道上方没有第一容器缓存位。
⑥是搬运机器人的纵向通道(上文中用标号72指代),用于搬运机器人在同一个巷道不同的位置通行,根据实际情况,可双向也可单向。
上述各通道不仅可以单独使用,还可以合并使用,比如某一个货架或者多个货架中既有③空载转运机器人纵向通道又有④空载转运机器人横向通道等。
高速行驶区73设置在仓库储存区7和工作站区8之间,转运机器人在高速行驶区73的行驶速度大于其在仓库储存区的运行速度,由此可以使转运机器人在高速行驶区快速通行,完成在仓库储存区7与工作站区8之间的流转。当然,高速行驶区73在本公开中也不是必须的,在某些应用场景中,也可以不设置高速行驶区,在此不再具体说明。
本实施例中的仓储系统或者转运系统,工作站区8包括至少一个工作站,图8示意出了四个工作站的工作站区。转运机器人将容器从第一容器位取下后便可转运至相应的工作站,并在工作站对容器进行处理,这种处理包括将物品放入容器进行上架储存,或者将物品从容器中取出,或者是其它处理步骤,在此不做限制。
在一个实施例中,转运机器人可以将第一容器缓存位上的容器转运至工作站的货架平台上。也就说,工作站位置设置有货架平台,转运机器人带着容器运动至工作站后,需要将容器放置在货架平台,之后在工作站对位于货架平台上的容器进行处理。对应的,当容器处理完成之后,再通过转运机器人将容器从货架平台上取下,并转运至第一容器缓存位,等待搬运机器人将其转运至第一容器缓存位进行储存。本实施例中的货架平台可以采用与上述第一容器缓存位相同或相似的结构,只要可以实现与转运机器人的对接即可。
采用上述的方式,使得转运机器人可以快速将容器放入货架平台,或者将容器从货架平台上取下,因此转运机器人在工作站不需要排队,可以快进快出。
货架平台可以是一层结构,也可以是多层的。转运机器人可将容器放在不同的层上,或从不同的层上取走。
转运机器人将容器送至工作站后,会主动将容器调整到合适的高度和姿态供操作人员方便的进行操作;还可以是人工或者机械手将容器直接从机器人身上取下,进行指定操作后再放回机器人,之后再进行后续的搬运工作。
参考图11,在一个实施例中,工作站包括至少一个处理区88,转运机器人将第一容器缓存位上的容器顶起并运动至工作站的处理区88;此后工作站可以对位于处理区88的转运机器人上的容器进行处理。也就是说,转运机器人带着容器来到处理区88后,并不会将容器卸下,工作站直接对转运机器人上的容器进行处理。待处理完成后,转运机器人再将其送入第一容器缓存位。
在一个实施例中,工作站被配置为当处理区88内转运机器人上的容器处理完毕后,向下一转运机器人发出在缓存区取容器的指令,下一个转运机器人接收到相应的指令后,行驶至缓存区取容器后,带着容器行驶至该工作站的处理区继续处理。
在一个实施例中,由于工作站对容器的处理需要时间,基于此,工作站还包括至少一个排队区89,转运机器人被配置为当处理区被占用时在排队区89依次排队。当某个转运机器人正在处理区进行处理时,若要有其它转运机器人到站,则需要在排队区89依次排队等待,当处理区内转运机器人上的容器处理完毕并离开后,位于排队区89的转运机器人则行驶至处理区进行处理。
需要注意的是,一个排队区89可以被理解为供一个转运机器人排队。也可以被理解为可以供多个转运机器人排队,此时,该排队区89与处理区88相对应。例如某个工作站包含两个处理区88时,则相应地设置两个排队区89,分别对应各自的处理区88。详细地说,例如包括第一处理区和与其对应的第一排队区,以及第二处理区和与其对应的第二排队区,第一排队区上的转运机器人相应的会运动到第一处理区进行处理,第二排队区上的转运机器人相应的会运动到第二处理区进行处理。
还可以是,工作站包括两个处理区88和两个排队区89时,哪个处理区88先空闲,则两个排队区89上的转运机器人按照依次交替的方式运动到该处理区88进行处理,也可以按照时间顺序或者其它预定的策略进行选择。上述的这种方式也可以理解为不同的处理区可以共享排队区。
在一个实施例中,工作站还包括显示器80,用以指引操作人员或者显示信息。该显示器80可以为操作人员提供各种辅助的信息,例如拣选的物品种类、数量等信息等,或者是提示操作人员做出相应的操作等。
在一个实施例中,工作站还可能包括灯光指引装置81,通过灯光指引装置81发出的灯光或者投影的形式对相应的操作进行指引,投射出用于投射出辅助操作人员操作的信息。例如,操作人员需要将相应位置的物品拣选至相应的容器中时,该灯光指引装置81可以发出光线照射在相应的容器上,或者照射在相应的物品上,提示操作员做出拣选的相应动作。还可以是,灯光指引装置81可以将商品的种类、数量投射到相应的位置,操作人员依据这些信息进行操作。
在一个实施例中,工作站还可能包括交互按钮82,该交互按钮82可被配置为用于完成操作后与系统交互的确认。例如当操作人员在工作站对相应的容器拣选完成后,可以按下该交互按钮82完成与系统的交互确认。系统确认之后,可向该转运机器人发出进行下一步转运的操作指令;和/或向下一个转运机器人发出可以进站的操作指令等。
在一个实施例中,工作站还可能包括容器位姿检测装置83,该容器位姿检测装置83可以是传感器,也可以是相机等检测装置,用来检测容器在机器人上的姿态。当容器与机器人的相对位置发生偏移时,容器位姿检测装置83可以发出告警;通知操作人员对容器进行摆正,或者通过自动化装置进行摆正。
在一个实施例中,工作站还可能包括安全防护装置84,用于保护操作人员在操作过程中的人身安全。该安全防护装置84可以是护栏或者可以起到保护操作人员的其它装置,保护操作人员在操作过程中的人身安全。例如通过护栏可以避免容器机器人由于指令错误或者发生其它故障时撞击操作人员。
在该实施例中,安全防护装置84可以为用于阻止转运机器人进入工作站的防护门。只有当该防护门打开时,转运机器人才可以进入工作站的处理区,这样可以保护操作人员,避免转运机器人撞击操作人员。
还可以是,工作站包括安全防护装置84和控制单元87,安全防护装置84为检测传感器;所述控制单元基于所述检测传感器检测到的误入工作站处理区的电信号,向转运机器人发出停止进站的指令。例如当工作站的处理区落入商品或者其它货物时,检测传感器检测到处理区有障碍物,控制单元87基于检测传感器的电信号,向转运机器人发出停止进站的指令,避免转运机器人撞击货物。还可以是,例如当操作人员的某个身体部位伸入到处理区时,也可以被检测传感器检测到,由此可避免容器机器人撞击操作人员,保护了操作人员的人身安全。
在一个实施例中,工作站还可能包括识别装置85,该识别装置85可以是条码或芯片识读装置,用于识别和校验容器信息。当转运机器人带着容器来到工作站时,可以通过条码或芯片识读装置完成对容器的识别,并将识别的信息通知给系统,以便系统做出下一步的操作指示。
在一个实施例中,工作站还可能包括视觉识别装置86和控制单元87,视觉识别装置86用于识别容器中的商品或者数量,或者识别操作人员的动作,控制单元87可以基于视觉识别装置86获得的错误信息发出报警的信号。该视觉识别装置86例如可以是相机,当操作人员在往容器中放置商 品时,视觉识别装置86可以通过视觉拍照来识别容器中商品的种类、数量等信息。如果发现容器中商品的种类、数量与系统中预存的信息不相符时,则可以发出警示信息。
该视觉识别装置86也可以用来识别操作人员的动作,如果识别到操作人员的动作出现错误时,控制单元87也会发出相应的警示信息。
本公开的仓储系统中,货架在垂直方向上被分成不同的区域,对应不同的机器人操作。搬运机器人负责在区域之间或者同区域内完成对容器位置的调整,转运机器人负责将容器由缓存区搬运至操作目的地进行操作。
本公开的仓储系统,很好地解决了传统中搬运机器人需要直接搬运容器至操作点操作所引发的一系列低效率、低性价比的缺陷,而改由两种机器人配合来完成。
在算法打分的支持下,该系统还可以将出库概率更高的容器放置到缓存区,容器操作时,仅需要转运机器人的搬运即可完成,大大减少了缓慢而成本高昂的搬运机器人的操作动作,还可以将出库概率高的容器放置在距离工作站更近的缓存区,进一步减少搬运时间,提高工作效率。
本仓储系统无需输送线装置,极大提高了方案的柔性,便于快速施工、动态增减机器人等优势。
本公开给出了多个实施例,上述多个实施例可以单独实施,也可以相互结合在一起来实施。例如可以通过本公开的转运机器人来完成各实施例中的转运,也可以由其它可以实现相似转运能力的机器人来完成。又例如,上述实施例中的各通道可以单独设置,也可以相互结合在一起来丰富机器人的路径规划。再例如,上述第一容器位、第二容器位的结构可以应用到转运系统或仓储系统的缓存区、容器储存区中,当然,缓存区、容器储存区中也可以采用其它合适的结构,只要能实现转运机器人在缓存区完成取容器、送容器的快捷转运即可。
本公开的容器转运系统、仓储系统均是由控制系统来进行控制,例如通过控制系统中的检测单元、控制单元来完成对搬运机器人、转运机器人的相应操作,在此不再具体说明。
图12A是本公开实施例的仓储系统的结构示意图,如图12A所示,仓储系统包括仓库储存区,该仓库储存区包括多个呈矩阵排列的货架,货架上设置有容器缓存区和容器储存区;仓储系统还包括工作站区,工作站区包括至少一个工作站,该工作站被配置为用于对容器进行拣选处理。
需要说明的是,在将容器从仓库储存区转移至工作站进行拣选处理时,可以采用RS+P容器到人方案,该方案是一种高存储、高柔性、高效率的仓储调度方案。具体实现时,货架上高层储存位的容器出库时,要先用RS机器人(即搬运机器人),将容器从高层储存位搬运到货架第一层的缓存位,P机器人(即转运机器人)前往缓存位将容器接力送往工作站。RS+P容器到人方案采用5-8米单深或双深位存储,最大化存储能力,可匹配多种抱箱形态的RS机器人,使用P机器人实现高柔性拣货,无需输送线,主要应用于体积小,SKU(Stock Keeping Unit,库存量单位)多,柔性要求高的容器到人拆零拣选场景、零售MFC场景等。其中,零售MFC场景是指基于MFC(Microsoft Foundation Classes,基础类库)创建的零售管理系统,是一种主动微型实行中心,实现主动拣货,在线订单取代了工作人员,机器人拣选订单和重新上架取代了相关工作人员,从而降低了零售商的运营成本,它可以帮助零售商提供便捷的电子商务服务,从而进一步提高售量。
上述方案中,承接输送容器到工作站的P机器人只能从货架第一层的缓存位取容器,所以缓存位合理利用对容器整体出库效率影响极大。目前,缓存位仅用于容器交接的用途,在这种方式下,容器只可以储存在高层的储存位,当工作站需要容器时,RS机器人将容器取下置于缓存位等待P机器人转运,当拣选完成后,从工作站送回缓存位的容器,等待RS机器人还至高层的储存位。图12B是本公开实施例的仓储调度中容器转移方法的处理流程图,如图12B所示,容器会被反复执行储存位-缓存位-工作站-缓存位-储存位的转移操作。
由上可知,对于高价值容器,有可能被多个拣选任务命中,所以当第一个拣选任务完成后,该容器被送回高层的储存位,下一个拣选任务到来时又需要从高层的储存位搬下该容器。实际上,缓存位除用于机器人交接容器的功能外,也可以承担一部分容器存放的功能,如上述高价值的容器可以在第一单完成后送回缓存位时,让其暂留缓存位存放,如此一来可以解放一部分RS机器人的运力资源,实现效率提升。但是,容器在缓存位暂存,导致非常容易占满缓存位资源,需要对应的调度管理方法调控缓存位资源。
因而,基于RS+P产品方案的特点,本公开实施例中提供了一种仓储调度方法,缓存位既承担容器交接功能,又承担容器存放功能,可以根据容器缓存区中缓存位的占用比例与各个缓存位存放容器的容器分值,自动生成容器归还任务,自动调控容器缓存区中缓存位的占用比例。图12C是本公开实施例的仓储调度方法的处理流程图,如图12C所示,容器从储存位搬运至缓存位,并转运至工作站,该容器在被使用后,送回到缓存位即流程结束;然后,引入缓存位的占用比例,根据缓存位的占用比例与容器价值调动自动归还任务,将容器归还至高层的储存位,由于容器还到缓存位流程结束的原因,会让缓存位的占用比例总是上升的,因而要有自动将容器归还至容器储存区的功能,从而控制缓存位的占用比例均衡。
在本公开中,提供了一种仓储调度方法,本公开同时涉及一种仓储调度装置,一种计算设备,以及一种计算机可读存储介质,在下面的实施例中逐一进行详细说明。
图13示出了根据本公开实施例的仓储调度方法的流程图,该仓储调度方法是使用上述仓储系统进行的,具体包括以下步骤1302、1304和1306。
步骤1302:确定容器缓存区中缓存位的占用比例,其中,容器缓存区包括至少一个缓存位。
具体的,仓储系统包括仓库储存区,仓库储存区包括多个呈矩阵排列的货架,货架上设置有容器缓存区和容器储存区,容器缓存区位于货架的低层,提供容器交接功能和容器存放功能;容器储存区位于 货架的高层,提供容器的储存功能。也即,容器储存区位于容器缓存区之上,如货架的底层作为容器缓存区,货架中除底层之外的其他层均作为容器储存区。
其中,容器缓存区可以包括至少一个缓存位,每个缓存位可以缓存一个容器,该容器是指用于储存目标物的结构,该目标物可以为需要进行拣选的物品,此时容器可以为储存物品的货箱。
需要说明的是,仓储系统还包括工作站区包括至少一个工作站,工作站被配置为用于对容器进行拣选处理。容器一般储存在容器储存区中,在将容器从仓库储存区转移至工作站进行拣选处理时,也即容器储存区的容器出库时,要先用搬运机器人将容器从容器储存位搬运到容器缓存区的缓存位,转运机器人前往缓存位将容器接力送往工作站,当拣选完成后,从工作站送回缓存位的容器,储存在该缓存位,以解放一部分搬运机器人的运力资源,实现容器出库效率的提升,但是容器在缓存位储存,非常容易占满缓存位资源,因而可以确定容器缓存区中缓存位的占用比例,基于该占用比例动态调整缓存位的占用,保证了用于执行容器交接任务的缓存位充足。
实际应用中,容器缓存区中缓存位的占用比例是指容器缓存区中被占用的缓存位占总缓存位的比例,可以将容器缓存区中被占用的缓存位数量除以总缓存位数量获得该占用比例。因而,具体实现时可以先确定容器缓存区中被占用的缓存位的数目,基于该被占用的缓存位的数目结合总缓存位的数目,确定容器缓存区中缓存位的占用比例。
本实施例一个示例中,容器缓存区中被占用的缓存位是动态变化的,因而确定容器缓存区中缓存位的占用比例,具体可以通过如下步骤实现:
确定容器缓存区中的已占用缓存位数目;
根据当前的容器转移任务,确定待占用缓存位数目和待释放缓存位数目;
根据已占用缓存位数目、待占用缓存位数目和待释放缓存位数目,确定容器缓存区中缓存位的占用比例。
具体的,容器缓存区的缓存位可以分为四类,当前占用、当前空置、即将占用和即将释放等。当前占用是指容器缓存区中当前储存有容器的缓存位,当前空置是指容器缓存区中当前未储存有容器的缓存位,即将占用是指容器缓存区中当前未储存有容器、且即将有容器转移进来的缓存位,即将释放是指容器缓存区中当前储存有容器、但储存的容器即将归还至容器储存区的缓存位。
因而,已占用缓存位数目是指当前占用的缓存位的数目,已占用缓存位数目可以直接读取各个缓存位中当前储存有容器的缓存位,统计其数目即可确定;待占用缓存位数目是指即将占用的缓存位的数目;待释放缓存位数目是指即将释放的缓存位的数目。
需要说明的是,由于从容器储存区向缓存位中转移容器、将缓存位中的容器归还至容器储存区均是机器人基于容器转移任务实现,也即仓储调度平台可以生成容器转移任务,将该容器转移任务下发给机器人,该机器人接收到任务后,依次执行各个任务,从容器储存区向缓存位中转移容器或者将缓存位中的容器归还至容器储存区。
因而,可以根据当前的容器转移任务,确定待占用缓存位数目和待释放缓存位数目。实际应用中,仓储调度平台可以存储有待执行和执行中的各个容器转移任务,各个容器转移任务均携带有转移起始位置和终止位置,针对每个容器转移任务,若转移起始位置为缓存位,则待释放缓存位数目加1,若转移起始位置为容器储存区,则待占用缓存位数目加1,依次遍历各个容器转移任务,可以确定出待占用缓存位数目和待释放缓存位数目。
另外,在根据已占用缓存位数目、待占用缓存位数目和待释放缓存位数目,确定容器缓存区中缓存位的占用比例时,可以先确定已占用缓存位数目与待占用缓存位数目之和,然后再减去待释放缓存位数目,即可确定出容器缓存区中缓存位的更新占用数目,使用该更新占用数目除以缓存位的总数目,即可获得容器缓存区中缓存位的占用比例。
本公开实施例中,可以根据当前的容器转移任务,确定待占用缓存位数目和待释放缓存位数目,然后结合已占用缓存位数目、待占用缓存位数目和待释放缓存位数目,确定容器缓存区中缓存位的占用比例。如此,在确定容器缓存区中缓存位的占用比例时,考虑了容器缓存区中缓存位的动态变化,使得容器缓存区中缓存位的占用比例更准确,贴合实际的应用场景,保证了容器缓存区域中缓存位的动态调控的准确性和实时性。
步骤1304:在缓存位的占用比例超过设定比例阈值的情况下,确定容器缓存区中各个缓存位存放容器的容器分值,其中,容器分值基于待执行拣选任务与容器中目标物数量确定。
具体的,设定比例阈值是指设定的水位线,用于保证容器缓存区中被占用的缓存位不会过多,如设定比例阈值可以为60%、70%、80%等。待执行拣选任务是指等待从容器中拣选目标物的任务,容器中的目标物数量是指容器的库存。
另外,容器分值可以表示容器的价值,即容器可能频繁被拣选任务命中的概率,容器分值是对容器进行打分获得,容器打分即为一种容器价值的评判标准,容器分值高,则认为容器价值较高,从工作站送回到缓存位后,如果容器分值较高,应尽可能让它停留在缓存位,也即容器缓存区中储存容器分值较高的容器,容器储存区中储存容器分值较低的容器。
实际应用中,仓储调度平台可以根据容器的自身库存与实时拣选任务的匹配程度,对该容器进行打分,也即如果容器能给多个拣选任务进行供货,容器得分就较高。另外,容器缓存区上高热容器的容器分值高于容器储存区上高热容器的容器分值,以保障容器缓存区上高热容器不被替换;容器储存区上高热容器的容器分值高于容器缓存区上不匹配待执行拣选任务或所含目标物数目过量的容器分值,以保障容器缓存区利用不到的容器被送回容器储存区。其中,高热容器是指容器热度高于设定阈值的容器,容 器热度是指容器可能被匹配、用于执行待执行拣选任务的次数,即容器可能被搬运的次数。如此,保证了容器分值可以让容器缓存区中的缓存位变成动态的稀缺资源,被容器争抢,匹配待执行拣选任务的次数较多的容器可以在容器缓存区停留较长时间。
需要说明的是,在缓存位的占用比例超过设定比例阈值的情况下,说明容器缓存区中存放了过多的容器,用于执行容器交接的缓存位可能不足,此时需要释放容器缓存区中某些缓存位中的容器,将其归还至容器储存区。为了确定将哪些缓存位中的容器归还至容器储存区,可以确定容器缓存区中各个缓存位存放容器的容器分值,该容器分值基于待执行拣选任务与容器中目标物数量确定,可以表示容器与待执行拣选任务的匹配程序,从而标识容器的价值,因而后续可以基于容器缓存区中各个缓存位存放容器的容器分值,确定容器缓存区中的待释放缓存位,从而将待释放缓存位中的待归还容器归还至容器储存区。
另外,可以定时确定仓库储存区中各个容器的容器分值,也即可以定时基于当前的待执行拣选任务与容器中当前的目标物数量,更新容器分值。
本实施例一个示例中,容器分值可以分为基础分值和热度值,也即确定容器缓存区中各个缓存位存放容器的容器分值之前,还可以包括:
确定第一容器中的至少一个目标物组匹配的拣选任务数目,其中,第一容器为容器缓存区和容器储存区中存放的任一容器,目标物标识相同的目标物构成一个目标物组;
根据至少一个目标物组匹配的拣选任务数目,确定第一容器的热度值;
确定第一容器的容器类型,并根据容器类型,确定第一容器的基础分值;
根据热度值和基础分值,确定第一容器的容器分值。
需要说明的是,容器储存于容器储存区或者容器缓存区,转运机器人只能转运位于容器缓存区的容器,这个场景中,期望容器缓存区中储存的容器有较高的周转率,即容器缓存区中储存的容器可以多次被待执行拣选任务命中,被转运机器人多次转运,因而对容器进行打分,就是把有潜力多次取用的容器给出高分,提前置于容器缓存区。对于容器内的目标物来说,无论待执行拣选任务需要几种目标物(比如1种或10种),如果都匹配到一个容器,都是对该容器转运一次,对机器人拿容器没有任何区别,所以判断一个容器的重要性可以看潜在被当前未执行拣选任务匹配到的次数,即容器可能与几个待执行拣选任务匹配,而不是有几种商品匹配。
实际应用中,针对第一容器,可以将第一容器内目标物标识相同的各个目标物定义为一个目标物组,一个容器的目标物数量可以看作是若干个目标物组构成的,也即,一个容器包括至少一个目标物组,一个目标物组包括至少一个目标物、且包括的各个目标物的目标物标识相同。对于容器内任何一个目标物组,可以计算该目标物组的库存量能够满足哪些待执行拣选任务的需求,计数获得该目标物组匹配的拣选任务数目,该拣选任务数目可以表示该目标物组的潜在取用次数,加和第一容器内各个目标物组的拣选任务数目,可以获得第一容器的潜在取用计数,然后基于该潜在取用计数确定第一容器的热度值。依次类推,可以确定出各个容器的热度值。
其中,目标物标识是指用于标识目标物的字符/编码等信息,目标物标识相同的目标物表示属于一个目标物组,目标物标识不同的目标物表示属于不同的目标物组,如目标物为商品时,目标物标识可以为商品编号(skuCode)和批次编号(batchCode),商品编号(skuCode)和批次编号(batchCode)相同的商品属于一个商品组,商品编号(skuCode)和批次编号(batchCode)不同的商品属于不同的商品组。
另外,计算该目标物组的库存量能够满足哪些待执行拣选任务的需求,计数获得该目标物组匹配的拣选任务数目时,针对每个待执行拣选任务,如果该目标物组的库存量不满足该待执行拣选任务的需求量,可以设定一个系数,使用库存量除以需求量,然后乘以该系数,获得该待执行拣选任务计数,如系数为0.5,假设库存为8,拣选任务需求量为10,则该待执行拣选任务的拣选任务计数为:0.5*(8/10);如果该目标物组的库存量满足该待执行拣选任务的需求量,则确定该待执行拣选任务计数为1。如此遍历各个待执行拣选任务,最终的计数结果即为该目标物组匹配的拣选任务数目。
其次,不同的待执行拣选任务可以有不同的优先级,各个优先级对应有优先级系数,此时确定出各个待执行拣选任务的计数结果后,还可以将各个待执行拣选任务的计数结果乘以对应的优先级系数,然后求和获得该目标物组匹配的拣选任务数目。
具体实现时,某些待执行拣选任务可能已经确定了从哪个容器中获取目标物,此时该容器中该目标物所处的目标物组即为预命中,因而确定出第一容器内各个目标物组的拣选任务数目,加和第一容器内各个目标物组的拣选任务数目后,还可以确定各个目标物组中是否包括预命中的目标物组,若包括,则可以根据预命中的目标物组数目,在加和结果上增加相应的计数,获得第一容器的潜在取用计数。
进一步地,基于该潜在取用计数确定第一容器的热度值时,可以将潜在取用计数映射至设定的第四分值范围,该第四分值范围的上下边界为第一分值范围的上下边界之差。实现时,可以将第一容器的潜在取用计数除以各个容器的潜在取用计数最大值,然后乘以第四分值范围的上下界差值,可以获得第一容器的热度值。如,第四分值范围为0-20,假设各个容器的潜在取用计数最大值为38,则第一容器的潜在取用次数T/38*20,即可获得第一容器的热度值。
具体的,可以将容器分值划分为三个范围,包括第一分值范围、第二分值范围和第三分值范围,第一分值范围高于第二分值范围高于第三分值范围。该三个分值范围可以用于确定不同类型的容器的基础分值。
本公开实施例中,可以将容器分值划分为容器热度值和基础分值,不同类型的容器可以设置不同的基础分值,然后在基础分值上增加与拣选任务匹配的热度值,从而确定容器分值,提高了容器分值的确 定准确率。
本实施例一个示例中,可以针对不同的容器类型,预先设定对应的基础分值,也即根据容器类型,确定第一容器的基础分值,具体实现过程可以如下:
在第一容器的容器类型为命中容器的情况下,确定第一容器的基础分值为第一设定值,其中,命中容器是指被选中执行拣选任务的容器,第一设定值为第一分值范围的下边界数值;
在第一容器的容器类型为非命中容器、且为容器缓存区中容器的情况下,确定第一容器的基础分值为第二设定值,其中,第二设定值为第二分值范围的下边界数值;
在第一容器的容器类型为非命中容器、且为容器储存区中容器的情况下,确定第一容器的基础分值为第三设定值,其中,第三设定值为第三分值范围的下边界数值;
其中,第一分值范围、第二分值范围和第三分值范围为基于容器分值划分获得,第一设定值高于第二设定值,且第二设定值高于第三设定值。
需要说明的是,某些待执行拣选任务可能已经确定了从哪个容器中获取目标物,此时该容器已经确定被命中,后续需要被搬运至工作站,从该容器中拣选目标物,因而在第一容器的容器类型为命中容器的情况下,确定第一容器的基础分值为第一设定值。
实际应用中,对于没有被命中的容器,可以根据储存的位置,设置其对应的基础分值。在第一容器的容器类型为容器缓存区中容器的情况下,确定第一容器的基础分值为第二设定值;在第一容器的容器类型为容器储存区中容器的情况下,确定第一容器的基础分值为第三设定值。其中,该第一设定值高于第二设定值高于第三设定值。
其中,第一分值范围为命中容器的容器分值范围,第二分值范围为容器缓存区中容器的容器分值范围,第三分值范围为容器储存区中容器的容器分值范围。如,第一分值范围为80-100,第一设定值为80;第二分值范围为60-80,第二设定值为60;第三分值范围为40-60,第三设定值为40。
具体实现时,针对仓库存储区内储存的各个目标物组(skuCode,batchCode),计算该目标物组关联的拣选任务数目(即有多少个待执行拣选任务对这个目标物组有需求),关联越多,认为这个目标物组越重要,后续计算从最重要的目标物组开始轮询。
在确定容器缓存区中容器的基础分值时,从最重要的目标物组开始轮询,对于每一个目标物组,有一系列可用容器的候选可以满足该目标物组的拣选任务需求,从容器缓存区中热度值最高(即与待执行拣选任务匹配度最高)的容器开始拿,直到满足该目标物组的拣选任务需求(即各个待执行拣选任务对该目标物组的需求),或者用完了容器缓存区可满足该目标物组的拣选任务需求的容器。在此过程中,每使用一个容器缓存区中容器,就将这个容器的基础分值设置为第二设定值(如60分),该容器的容器分值即为基础分值60分与该容器对应的热度值之和。同时,基于容器缓存区中容器能够满足的拣选任务需求,更新该目标物组的拣选任务的剩余需求量,该剩余需求量可以由容器储存区中容器满足。
在确定容器储存区容器的基础分值时,某些目标物组的拣选任务需求已经能够被容器缓存区中容器满足(也即容器缓存区中容器储存的该目标物组的库存充足),某些目标物组的需求无法被容器缓存区中容器满足(也即容器缓存区中容器储存的该目标物组的库存不足),需要继续从容器储存区中容器获取。从最重要的目标物组开始轮询,若该目标物组的拣选任务需求已被容器缓存区中容器满足,则跳过;若该目标物组的拣选任务需求未被容器缓存区中容器满足,该目标物组在容器储存区中也存在可用容器的候选,跟容器缓存区过程类似,从容器储存区中热度值最高的容器开始拿,直到满足该目标物组的拣选任务需求,或者用完了容器储存区可满足该目标物组的拣选任务需求的容器。在此过程中,每使用一个容器储存区中容器,就将这个容器的基础分值设置为第三设定值(如40分),该容器的容器分值即为基础分值40分与该容器对应的热度值之和。同时,基于容器储存区中容器能够满足的拣选任务需求,更新该目标物组的拣选任务的剩余需求量,如果仍有某些目标物组的拣选任务需求未被满足,即库存确实不足,也不再处理。
对于未被选择的剩余容器,基于第四分值范围进行打分。针对容器缓存区中未被选择的剩余容器,可以将其基础分值设定为第四设定值(如20分),针对容器储存区中未被选择的剩余容器,可以将其基础分值设定为第五设定值(如0分)。
其中,第一分值范围高于第二分值范围高于第三分值范围高于第四分值范围,该四个分值范围构成了容器分值的区间;第一设定值高于第二设定值高于第三设定值高于第四设定值高于第五设定值,第四设定值和第五设定值为第四分值范围内的数值,如第四设定数值为第四分值范围的中间值,第五设定数值为第四分值范围的下边界值。例如,第一分值范围为80-100,第一设定值为80;第二分值范围为60-80,第二设定值为60;第三分值范围为40-60,第三设定值为40;第四分值范围为0-40,第四设定值为20,第五设定值为0。
需要说明的是,对于命中容器,搬运机器人已经确定要进行搬运,也即命中容器并不一定是热度比较高的容器,但是命中容器是确定了已经命中某个待执行拣选任务,后续一定会被搬运至工作站的容器。因而,无论该命中容器位于储存区还是缓存区,该命中容器的分值应该设置的较大,从而保证该命中容器可以处于缓存区(或被搬运至缓存区),后续被机器人搬运至工作站,因而给出了80分以上的分数,满足了跟实际情况的一致性,但该分数没太大意义,因而命中容器被搬运至工作站执行拣选任务,被送回缓存区后,依旧需要重新进行打分,确定其继续留在缓存区,还是送回储存区。
而对于容器储存区上匹配订单的高分分布于40-60分,当这些容器要被挪到缓存区,若缓存区没有空位置,它们不应该替换缓存区上比较高频的容器(60-80分),而可以替换相对较低频的容器(20-40分)。同时,缓存区两个相同的容器,由于前一个匹配到了订单需求,后一个没匹配到订单需求,原本比如热 度值都是15,根据上述逻辑可能被分别打分为75和35,这种情况代表的物理世界的意义为,可能装有某目标物的容器被太多挪到了缓存区,有一部分需要搬回储存区,也有可能仅仅只是算法没有预留冗余空间。所以储存区较高分容器,在替换缓存区低分容器时,要尽可能选低分区最低分数的容器做替换。因为对于每一层来说,分数设置有比较意义,映射分数为15的容器比映射分数为10的容器更有机会被多次使用。
步骤1306:根据容器分值,确定容器缓存区中的待释放缓存位,并生成针对待释放缓存位中待归还容器的归还任务,其中,归还任务用于指示将待归还容器从待释放缓存位归还至容器储存区。
需要说明的是,容器分值可以表示容器的价值,因而可以根据容器分值,确定容器缓存区中的待释放缓存位,将容器缓存区的各个缓存位中容器分值较低的缓存位作为待释放缓存位,释放其中的容器。
实际应用中,确定出容器缓存区中的待释放缓存位后,说明待释放缓存位中储存的容器需要归还至容器储存区储存,因而此时仓储调度平台可以生成针对待释放缓存位中待归还容器的归还任务,该归还任务可以下发给搬运机器人,搬运机器人将待归还容器从待释放缓存位归还至容器储存区。
本实施例一个示例中,可以基于占用比例与设定比例阈值的差值,确定需要释放多少个缓存位,进而确定容器缓存区中的待释放缓存位,也即根据容器分值,确定容器缓存区中的待释放缓存位,具体实现过程可以如下:
确定占用比例与设定比例阈值的差值,并对各个缓存位存放容器的容器分值进行排序根据差值确定待释放缓存位的数目;
对各个缓存位存放容器的容器分值进行排序,根据排序结果,选取该数目待释放缓存位。
需要说明的是,占用比例与设定比例阈值之间的差值,可以表示容器缓存区中多占用的缓存位的数目,因而可以根据该差值确定待释放缓存位的数目。具体的,可以直接将该差值乘以总缓存位数目作为待释放缓存位的数目,也即多占用的缓存位的数目即为待释放缓存位的数目;或者,为了避免频繁释放缓存位中的容器,还可以将该差值的设定数值倍,乘以总缓存位数目,作为待释放缓存位的数目,也即一次性多释放一些缓存位。
本公开实施例中,确定出待释放缓存位的数目后,可以对各个缓存位存放容器的容器分值从高至低(或从低至高)进行排序,选取排序靠后(排序靠前)的该数目容器分值对应的缓存位作为待释放缓存位。如此,可以在容器缓存区中缓存位的占用比例超过设定比例阈值的情况下,将容器缓存区中容器分值较低的容器归还至容器储存区,以释放容器缓存区中的容器缓存位。
示例的,如果当前巷道有8个容器在容器缓存区的缓存位,总缓存位数目为10个,即此时占用比例0.8,假设设定比例阈值为0.6,此时确定差值为0.2,乘以10,可以获得待释放缓存位的数目为2个,此时可以保留容器缓存区中最高容器分值的6个,将最低2个容器分值对应的容器所处的缓存位作为待释放缓存位,以将该2个最低容器分值的容器归还至容器储存区。
本实施例一个示例中,可以在归还任务中携带目的位置,也即生成针对待释放缓存位中待归还容器的归还任务,具体实现过程可以如下:
确定待释放缓存位对应的目标储存位;
基于待释放缓存位和目标储存位生成归还任务,其中,归还任务用于将待释放缓存位中存放的待归还容器归还至目标储存位。
需要说明的是,目标储存位可以是仓库储存区的各个巷道的容器储存区的任一储存位,也即可以将待释放缓存位中的待归还容器归还至容器储存区的任一储存位中。
实际应用中,可以从仓库储存区的各个巷道的容器储存区中随机选择一个空闲的储存位作为目标储存位,优先选择与待释放缓存位处于同一巷道的储存位,若与待释放缓存位处于同一巷道的容器储存区中没有空闲储存位时,可以选择与待释放缓存位处于不同巷道的储存为作为目标储存位。
本公开实施例中,基于待释放缓存位和目标储存位生成归还任务,也即将待释放缓存位和目标储存位的位置标识携带在归还任务中,机器人接收到该归还任务,即可将待释放缓存位中存放的待归还容器归还至目标储存位,以释放容器缓存区中的容器缓存位,从而动态调控容器缓存区中缓存位的占用比例。
需要说明的是,仓储系统(即仓库储存区)包括至少两个巷道,每个巷道均设置有容器储存区和容器缓存区。容器打分完成后,配合自动归还容器的机制,已经基本可以保证高分容器留在缓存位概率相比低分容器要高,但由于拣选任务的不均衡以及巷道任务不均衡等原因,被动的把高分容器留在缓存位的方式可能会让高分容器在缓存位的比例并不高,也有可能出现某巷道都是高分的容器,而另一巷道全是低分的容器,因而本公开实施例中除了上述将容器缓存区中的低分容器归还至容器储存区之外,还可以将容器储存区中的高分容器转移至容器缓存区。
实际应用中,为了考虑缓存区存放容器保持占用比例稳定,将容器储存区中的高分容器转移至容器缓存区的转移任务可以大体分成两类,即单箱转移任务和替换任务,在下面实施例中逐一论述。
本实施例一个示例中,除了上述定时确定容器缓存区中缓存位的占用比例,以将容器缓存区中的低分容器归还至容器储存区之外,还可以定时确定容器储存区中的高分容器,将容器储存区中的高分容器转移至容器缓存区。也即该仓储调度方法还包括:
每间隔第一预设时长,确定容器储存区中待转移至容器缓存区的待转移容器;
确定待转移容器在容器缓存区对应的第一缓存位;
基于第一储存位和第一缓存位生成待转移容器的容器转移任务,其中,第一储存位为待转移容器在容器储存区的储存位置,容器转移任务用于指示将待转移容器从第一储存位转移至第一缓存位。
需要说明的是,每间隔第一预设时长,定时确定容器储存区中待转移至容器缓存区的待转移容器。 具体的,确定容器储存区中待转移至容器缓存区的待转移容器时,可以先获取预先设定的、每次更新过程最多可以向容器缓存区转移的最大容器数量,确定出该最大容器数量后,从容器储存区的各个储存位中选取容器分值最高的该最大容器数量个容器,选择出的容器即待转移容器,可以被转移至容器缓存区。
另外,还可以先从容器储存区的各个储存位中选取容器分值高于分值阈值的各个候选容器,若候选容器的数量大于最大容器数量,则从各个候选容器中选择分值最高的该最大容器数量个候选容器,选择出的候选容器即为待转移容器。若候选容器的数量不大于最大容器数量,则直接将各个候选容器作为待转移容器。
示例的,每5min可以将20个容器储存区中的容器转移到容器缓存区进行储存,因而可以从容器储存区的各个容器中选取最高分值的20个容器作为待转移容器。或者,还可以结合分值阈值,先容器储存区的各个容器中选取大于分值阈值的候选容器,若候选容器少于20个,比如只有10个,那该10个候选容器即为待转移容器。
实际应用中,确定出容器储存区中待转移至容器缓存区的待转移容器后,可以确定待转移容器在容器缓存区对应的第一缓存位,即待转移容器要转移到的缓存位,该第一缓存位与第一储存位可以位于同一巷道,也可以位于不同巷道。之后,仓储调度平台可以基于第一储存位和第一缓存位生成待转移容器的容器转移任务,将该容器转移任务下发给对应的机器人,以使机器人执行该转移任务,将待转移容器从第一储存位转移至第一缓存位。
本公开实施例中,除了上述将容器缓存区中的低分容器归还至容器储存区之外,还可以定时确定容器储存区中待转移至容器缓存区的待转移容器,该待转移容器为当前容器储存区中的高分容器,从而可以定时将容器储存区中的高分容器转移至容器缓存区,保证了容器缓存区缓存位占用数量的同时,也保证了占用缓存位的容器的质量。
本实施例一个示例中,仓储系统包括至少两个巷道,每个巷道均设置有容器储存区和容器缓存区;确定待转移容器在容器缓存区对应的第一缓存位,具体实现过程可以如下:
确定第一容器缓存区中是否存在可用缓存位,其中,第一容器缓存区与待转移容器所处的容器储存区属于同一巷道;
若存在可用缓存位,则从可用缓存位中确定第一缓存位;
若不存在可用缓存位,则从第二容器缓存区中确定第一缓存位,其中,第二容器缓存区与待转移容器所处的容器储存区不属于同一巷道。
需要说明的是,在确定待转移容器在容器缓存区对应的第一缓存位时,可以优先确定与待转移容器所处的容器储存区属于同一巷道的第一容器缓存区中是否存在可用缓存位,也即可以优先将待转移容器转移至同一巷道的容器缓存区的缓存位中。其中,可用缓存位包括空闲缓存位和/或容器分值较低的缓存位。
实际应用中,若第一容器缓存区存在可用缓存位,则说明可以将待转移容器转移至同巷道的缓存位中,也即可以从第一容器缓存区中可用缓存位中确定第一缓存位。具体实现时,可以优先将可用缓存位中的空闲缓存位确定为第一缓存位(容空闲缓存位为多个,则随机选择一个),若可用缓存位均为容器分值较低的缓存位,则说明可用缓存位上存放有容器,但存放容器的容器分值较低,则可以优先选择分值最低的缓存位作为第一缓存位,此时可以将待转移容器转移至该第一缓存位,以替换该第一缓存位上容器分值较低的容器。
另外,若第一容器缓存区不存在可用缓存位,则说明同巷道的缓存位已满,且均被高分容器占用,因而此时可以将待转移容器转移至其他巷道的缓存位中,即跨巷道转移,也即从与待转移容器所处的容器储存区不属于同一巷道的第二容器缓存区中确定第一缓存位。具体实现时,可以结合各个第二容器缓存区中是否存在空闲缓存位、被占用缓存位的容器分值,从第二容器缓存区中选取第一缓存位。
本公开实施例中,可以将待转移容器转移至同巷道的缓存位中,也可以将待转移容器转移至其他巷道的缓存位中,在将容器储存区中的高分容器转移至容器缓存区时,即可同巷道转移,又可跨巷道转移,均衡了不同巷道的容器缓存区中储存的容器的容器分值,避免了高分容器堆积在某个巷道中。
本实施例一个示例中,第一缓存位与第一储存位属于同一巷道时,即同巷道转移时,基于第一储存位和第一缓存位生成待转移容器的容器转移任务,具体实现过程可以如下:
确定第一缓存位当前是否存放有容器;
若存放有容器,则生成针对第一缓存位中存放容器的替换任务,其中,替换任务用于指示搬运机器人将第一缓存位中的存放容器归还至容器储存区、并将待转移容器从第一储存位搬运至第一缓存位;
若未存放有容器,则基于第一储存位和第一缓存位生成针对待转移容器的第一容器搬运任务,其中,第一容器搬运任务用于指示搬运机器人将待转移容器从第一储存位搬运至第一缓存位。
需要说明的是,基于第一储存位和第一缓存位生成待转移容器的容器转移任务,该容器转移任务要将待转移容器从第一储存位转移至第一缓存位,因而可以先确定第一缓存位中当前是否存放有容器,若存放有容器,则需要使用待转移容器替换第一缓存位当前存放的容器,因而此时可以生成针对第一缓存位中存放容器的替换任务,仓储调度平台可以将该调度任务下发给搬运机器人,搬运机器人可以将第一缓存位中的存放容器归还至容器储存区、并将待转移容器从第一储存位搬运至第一缓存位。
其中,将第一缓存位中的存放容器归还至容器储存区,和将待转移容器从第一储存位搬运至第一缓存位可以由一个搬运机器人先后执行,也可以由两个搬运机器人同步执行。在将第一缓存位中的存放容器归还至容器储存区时,需要确定目的存储位,此时可以从容器储存区中随机确定一个储存位作为该目标的存储位,并将该目的储存位的位置标识携带在替换任务中,以使搬运机器人将第一缓存位中的存放 容器归还至该目的储存位。
另外,若未存放有容器,说明第一缓存位当前空闲,此时可以直接将待转移容器搬运至第一缓存位,也即基于第一储存位和第一缓存位生成针对待转移容器的第一容器搬运任务,也即在第一容器搬运任务中携带第一储存位和第一缓存位的位置标识,以使搬运机器人将待转移容器从第一储存位搬运至第一缓存位。
示例的,图14A是本公开实施例的同巷道容器搬运任务的执行过程示意图,如图14A所示,货架上设置有容器缓存区和容器储存区,高分容器表示待转移容器,目标货位表示第一缓存位,此时可以由搬运机器人执行搬运任务,将高分容器从第一储存位搬运至第一缓存位。图14B是本公开实施例的同巷道容器替换任务的执行过程示意图,如图14B所示,货架上设置有容器缓存区和容器储存区,高分容器表示待转移容器,低分容器表示第一缓存位中的存放容器,由搬运机器人执行替换任务,将第一缓存位的低分容器与第一储存位的高分容器进行替换。
本公开实施例中,可以在同巷道中执行容器搬运任务或者容器替换任务,从而将该巷道的容器储存区中高分容器转移至同巷道的容器缓存区中,保证了容器缓存区缓存位占用数量的同时,也保证了占用缓存位的容器的质量。
本实施例一个示例中,第一缓存位与第一储存位属于不同巷道,即跨巷道转移时,基于第一储存位和第一缓存位生成待转移容器的容器转移任务,具体实现过程可以如下:
基于第一储存位生成针对待转移容器的第二容器搬运任务,其中,第二容器搬运任务用于指示搬运机器人将待转移容器从第一储存位搬运至第二缓存位,第二缓存位与第一储存位属于同一巷道;
在待转移容器搬运至第二缓存位的情况下,基于第二缓存位和第一缓存位针对待转移容器生成转运任务,其中,转运任务用于指示转运机器人将待转移容器从第二缓存位转运至第一缓存位。
需要说明的是,跨巷道转移任务分为两个阶段,第一个阶段先将待转移容器搬运至同巷道的容器缓存区中,第二阶段再将待转移容器从该同巷道的容器缓存区中转运至跨巷道的容器缓存区的第一缓存位。
实际应用中,可以基于第一储存位生成针对待转移容器的第二容器搬运任务,搬运机器人基于该第二容器搬运任务,可以将待转移容器从第一储存位搬运至第二缓存位,第二缓存位与第一储存位属于同一巷道,第二缓存位是同一巷道的容器缓存区的任一缓存位,也即第一阶段为同巷道容器储存区至容器缓存区的搬运。
然后,在待转移容器搬运至第二缓存位的情况下,基于第二缓存位和第一缓存位针对待转移容器生成转运任务,转运机器人可以基于该转运任务,将待转移容器从第二缓存位转运至第一缓存位,即跨巷道转运,将待转移容器从当前巷道,转移至其他巷道的缓存位。
本公开实施例中,可以将待转移容器转移至其他巷道的缓存位中,均衡了不同巷道的容器缓存区中储存的容器的容器分值,避免了高分容器堆积在某个巷道中。
本实施例一个示例中,基于第二缓存位和第一缓存位针对待转移容器生成转运任务,具体实现过程可以如下:
确定第一缓存位当前是否存放有容器;
若存放有容器,则生成针对第一缓存位中存放容器的第三容器搬运任务,其中,第三容器搬运任务用于指示搬运机器人将第一缓存位中存放容器从第一缓存位移动至第二存储位,第一缓存位与第二存储位处于同一巷道或不同巷道;
在第一缓存位中存放容器搬运出第一缓存位的情况下,基于第二缓存位和第一缓存位针对待转移容器生成转运任务。
需要说明的是,基于第二缓存位和第一缓存位针对待转移容器生成转运任务的具体实现过程,与上述基于第一储存位和第一缓存位生成待转移容器的容器转移任务过程相类似,本公开在此不再赘述。
示例的,图14C是本公开实施例的跨巷道容器搬运任务的执行过程示意图,如图14C所示,假定6号区该巷道的容器缓存区内缓存位上存放的容器,都是高热的,当前货架高分容器并不占优势,但此时1号区有可用的缓存位,即第一缓存位为1号区的容器缓存区内的缓存位,此时可生成单箱搬运任务,搬运时由于需要跨区,搬运机器人执行跨区搬运比较笨重,所以如图14C所示进行搬运机器人与转运机器人容器接力方式搬运,也即先由搬运执行搬运任务,再由转运机器人执行转运任务。
图14D是本公开实施例的跨同巷道容器替换任务的执行过程示意图,如图14D所示,如若在6号区的容器缓存区内很难找到空余的缓存位,此时需要生成跨区的替换任务。假定要将6号区的高分容器放到1号区的低分容器的缓存位上,而该缓存位有一个低热度的容器(即低分容器),如图14D所示,此时可以通过搬运机器人执行搬运任务,将该低分容器转移到上层(如2号区的上层),再执行如图14C所示的接力方式搬运过程。
本公开提供的仓储调度方法,可以确定容器缓存区中缓存位的占用比例,在缓存位的占用比例超过设定比例阈值的情况下,说明容器缓存区中存放了过多的容器,用于执行容器交接的缓存位可能不足,此时可以基于容器缓存区中各个缓存位存放容器的容器分值,确定容器缓存区中的待释放缓存位,并生成对应的归还任务,将待释放缓存位中的待归还容器归还至容器储存区,从而动态控制容器缓存区中缓存位的占用比例,保证容器缓存区中有充足的缓存位用于容器交接。如此,容器缓存区除了用于容器交接之外,还可以用于容器存放,也即容器在工作站拣选完毕后,转运机器人将该容器从工作站送回容器缓存区后,无需将该容器送回容器储存区,该容器可以直接存放于缓存区,后续基于容器缓存区中缓存位的占用比例,动态控制缓存区中容器的转移,容器可以存放于容器缓存区,提高了容器复用率,进而提高了容器出库效率和目标物拣选效率,极大节省了机器人的运力资源。
与上述方法实施例相对应,本公开还提供了仓储调度装置实施例,图15示出了本公开实施例的仓储调度装置的结构示意图。如图15所示,该装置包括第一确定模块1502、第二确定模块1504和生成模块1506。
第一确定模块1502被配置为确定容器缓存区中缓存位的占用比例,其中,容器缓存区包括至少一个缓存位;
第二确定模块1504被配置为在缓存位的占用比例超过设定比例阈值的情况下,确定容器缓存区中各个缓存位存放容器的容器分值,其中,容器分值基于待执行拣选任务与容器中目标物数量确定;
生成模块1506被配置为根据容器分值,确定容器缓存区中的待释放缓存位,并生成针对待释放缓存位中待归还容器的归还任务,其中,归还任务用于指示将待归还容器从待释放缓存位归还至容器储存区。
本公开提供的仓储调度装置,可以确定容器缓存区中缓存位的占用比例,在缓存位的占用比例超过设定比例阈值的情况下,说明容器缓存区中存放了过多的容器,用于执行容器交接的缓存位可能不足,此时可以基于容器缓存区中各个缓存位存放容器的容器分值,确定容器缓存区中的待释放缓存位,并生成对应的归还任务,将待释放缓存位中的待归还容器归还至容器储存区,从而动态控制容器缓存区中缓存位的占用比例,保证容器缓存区中有充足的缓存位用于容器交接。如此,容器缓存区除了用于容器交接之外,还可以用于容器存放,也即容器在工作站拣选完毕后,转运机器人将该容器从工作站送回容器缓存区后,无需将该容器送回容器储存区,该容器可以直接存放于缓存区,后续基于容器缓存区中缓存位的占用比例,动态控制缓存区中容器的转移,容器可以存放于容器缓存区,提高了容器复用率,进而提高了容器出库效率和目标物拣选效率,极大节省了机器人的运力资源。
在一些实施例中,第一确定模块1502进一步被配置为:
确定容器缓存区中的已占用缓存位数目;
根据当前的容器转移任务,确定待占用缓存位数目和待释放缓存位数目;
根据已占用缓存位数目、待占用缓存位数目和待释放缓存位数目,确定容器缓存区中缓存位的占用比例。
在一些实施例中,生成模块1506进一步被配置为:
确定占用比例与设定比例阈值的差值,并根据差值确定待释放缓存位的数目;
对各个缓存位存放容器的容器分值进行排序,根据排序结果,选取该数目待释放缓存位。
在一些实施例中,生成模块1506进一步被配置为:
确定待释放缓存位对应的目标储存位;
基于待释放缓存位和目标储存位生成归还任务,其中,归还任务用于将待释放缓存位中存放的待归还容器归还至目标储存位。
在一些实施例中,该装置还包括转移模块,被配置为:
每间隔第一预设时长,确定容器储存区中待转移至容器缓存区的待转移容器;
确定待转移容器在容器缓存区对应的第一缓存位;
基于第一储存位和第一缓存位生成待转移容器的容器转移任务,其中,第一储存位为待转移容器在容器储存区的储存位置,容器转移任务用于指示将待转移容器从第一储存位转移至第一缓存位。
在一些实施例中,仓储系统包括至少两个巷道,每个巷道均设置有容器储存区和容器缓存区;转移模块进一步被配置为:
确定第一容器缓存区中是否存在可用缓存位,其中,第一容器缓存区与待转移容器所处的容器储存区属于同一巷道;
若存在可用缓存位,则从可用缓存位中确定第一缓存位;
若不存在可用缓存位,则从第二容器缓存区中确定第一缓存位,其中,第二容器缓存区与待转移容器所处的容器储存区不属于同一巷道。
在一些实施例中,第一缓存位与第一储存位属于同一巷道;转移模块进一步被配置为:
确定第一缓存位当前是否存放有容器;
若存放有容器,则生成针对第一缓存位中存放容器的替换任务,其中,替换任务用于指示搬运机器人将第一缓存位中的存放容器归还至容器储存区、并将待转移容器从第一储存位搬运至第一缓存位;
若未存放有容器,则基于第一储存位和第一缓存位生成针对待转移容器的第一容器搬运任务,其中,第一容器搬运任务用于指示搬运机器人将待转移容器从第一储存位搬运至第一缓存位。
在一些实施例中,第一缓存位与第一储存位属于不同巷道;转移模块进一步被配置为:
基于第一储存位生成针对待转移容器的第二容器搬运任务,其中,第二容器搬运任务用于指示搬运机器人将待转移容器从第一储存位搬运至第二缓存位,第二缓存位与第一储存位属于同一巷道;
在待转移容器搬运至第二缓存位的情况下,基于第二缓存位和第一缓存位针对待转移容器生成转运任务,其中,转运任务用于指示转运机器人将待转移容器从第二缓存位转运至第一缓存位。
在一些实施例中,转移模块进一步被配置为:
确定第一缓存位当前是否存放有容器;
若存放有容器,则生成针对第一缓存位中存放容器的第三容器搬运任务,其中,第三容器搬运任务用于指示搬运机器人将第一缓存位中存放容器从第一缓存位移动至第二存储位,第一缓存位与第二存储位处于同一巷道或不同巷道;
在第一缓存位中存放容器搬运出第一缓存位的情况下,基于第二缓存位和第一缓存位针对待转移容器生成转运任务。
在一些实施例中,该装置还包括打分模块,被配置为:
确定第一容器中的至少一个目标物组匹配的拣选任务数目,其中,第一容器为容器缓存区和容器储存区中存放的任一容器,目标物标识相同的目标物构成一个目标物组;
根据至少一个目标物组匹配的拣选任务数目,确定第一容器的热度值;
确定第一容器的容器类型,并根据容器类型,确定第一容器的基础分值;
根据热度值和基础分值,确定第一容器的容器分值。
在一些实施例中,打分模块进一步被配置为:
在第一容器的容器类型为命中容器的情况下,确定第一容器的基础分值为第一设定值,其中,命中容器是指被选中执行拣选任务的容器,第一设定值为第一分值范围的下边界数值;
在第一容器的容器类型为非命中容器、且为容器缓存区中容器的情况下,确定第一容器的基础分值为第二设定值,其中,第二设定值为第二分值范围的下边界数值;
在第一容器的容器类型为非命中容器、且为容器储存区中容器的情况下,确定第一容器的基础分值为第三设定值,其中,第三设定值为第三分值范围的下边界数值;
其中,第一分值范围、第二分值范围和第三分值范围为基于容器分值划分获得,第一设定值高于第二设定值,且第二设定值高于第三设定值。
上述为本实施例的一种仓储调度装置的示意性方案。需要说明的是,该仓储调度装置的技术方案与上述的仓储调度方法的技术方案属于同一构思,仓储调度装置的技术方案未详细描述的细节内容,均可以参见上述仓储调度方法的技术方案的描述。
图16示出了根据本公开实施例的计算设备1600的结构框图。该计算设备1600的部件包括但不限于存储器1610和处理器1620。处理器1620与存储器1610通过总线1630相连接,数据库1650用于保存数据。
计算设备1600还包括接入设备1640,接入设备1640使得计算设备1600能够经由一个或多个网络1660通信。这些网络的示例包括公用交换电话网(PSTN,Public Switched Telephone Network)、局域网(LAN,Local Area Network)、广域网(WAN,Wide Area Network)、个域网(PAN,Personal Area Network)或诸如因特网的通信网络的组合。接入设备1640可以包括有线或无线的任何类型的网络接口(例如,网络接口卡(NIC,Network Interface Controller))中的一个或多个,诸如IEEE802.11无线局域网(WLAN,Wireless Local Area Networks)无线接口、全球微波互联接入(Wi-MAX,Worldwide Interoperability for Microwave Access)接口、以太网接口、通用串行总线(USB,Universal Serial Bus)接口、蜂窝网络接口、蓝牙接口、近场通信(NFC,Near Field Communication)接口,等等。
在一个实施例中,计算设备1600的上述部件以及图16中未示出的其他部件也可以彼此相连接,例如通过总线。应当理解,图16所示的计算设备结构框图仅仅是出于示例的目的,而不是对本公开范围的限制。本领域技术人员可以根据需要,增添或替换其他部件。
计算设备1600可以是任何类型的静止或移动计算设备,包括移动计算机或移动计算设备(例如,平板计算机、个人数字助理、膝上型计算机、笔记本计算机、上网本等)、移动电话(例如,智能手机)、可佩戴的计算设备(例如,智能手表、智能眼镜等)或其他类型的移动设备,或者诸如台式计算机或PC的静止计算设备。计算设备1600还可以是移动式或静止式的服务器。
其中,处理器1620用于执行如下计算机可执行指令,以实现仓储调度方法的步骤。
上述为本实施例的一种计算设备的示意性方案。需要说明的是,该计算设备的技术方案与上述的仓储调度方法的技术方案属于同一构思,计算设备的技术方案未详细描述的细节内容,均可以参见上述仓储调度方法的技术方案的描述。
本公开一实施例还提供一种计算机可读存储介质,其存储有计算机指令,该指令被处理器执行时以用于实现仓储调度方法的步骤。
上述为本实施例的一种计算机可读存储介质的示意性方案。需要说明的是,该存储介质的技术方案与上述的仓储调度方法的技术方案属于同一构思,存储介质的技术方案未详细描述的细节内容,均可以参见上述仓储调度方法的技术方案的描述。
本公开一实施例还提供一种计算机程序产品,包括计算机程序,所述计算机程序被处理器执行时实现上述仓储调度方法的步骤。
上述对本公开特定实施例进行了描述。其它实施例在所附权利要求书的范围内。在一些情况下,在权利要求书中记载的动作或步骤可以按照不同于实施例中的顺序来执行并且仍然可以实现期望的结果。另外,在附图中描绘的过程不一定要求示出的特定顺序或者连续顺序才能实现期望的结果。在某些实施例中,多任务处理和并行处理也是可以的或者可能是有利的。
计算机指令包括计算机程序代码,计算机程序代码可以为源代码形式、目标物代码形式、可执行文件或某些中间形式等。计算机可读介质可以包括:能够携带计算机程序代码的任何实体或装置、记录介质、U盘、移动硬盘、磁碟、光盘、计算机存储器、只读存储器(ROM,Read-Only Memory)、随机存取存储器(RAM,Random Access Memory)、电载波信号、电信信号以及软件分发介质等。
需要说明的是,对于前述的各方法实施例,为了简便描述,故将其都表述为一系列的动作组合,但是本领域技术人员应该知悉,本公开并不受所描述的动作顺序的限制,因为依据本公开,某些步骤可以采用其它顺序或者同时进行。其次,本领域技术人员也应该知悉,说明书中所描述的实施例均属于优选实施例,所涉及的动作和模块并不一定都是本公开所必须的。
在上述实施例中,对各个实施例的描述都各有侧重,某个实施例中没有详述的部分,可以参见其它 实施例的相关描述。
本领域技术人员在考虑说明书及实践这里公开的发明后,将容易想到本公开的其它实施方案。本申请旨在涵盖本公开的任何变型、用途或者适应性变化,这些变型、用途或者适应性变化遵循本公开的一般性原理并包括本公开未公开的本技术领域中的公知常识或惯用技术手段。说明书和实施例仅被视为示例性的,本公开的真正范围和精神由下面的权利要求指出。
应当理解的是,本公开并不局限于上面已经描述并在附图中示出的精确结构,并且可以在不脱离其范围进行各种修改和改变。本公开的范围仅由所附的权利要求来限制。

Claims (56)

  1. 一种仓储系统,包括:
    仓库储存区,所述仓库储存区包括多个呈矩阵排列的货架,所述货架上设置有容器缓存区和容器储存区;
    工作站区,所述工作站区包括至少一个工作站,所述工作站被配置为用于对容器进行处理;
    搬运机器人,所述搬运机器人被配置为负责容器在容器缓存区和容器储存区间的调配;
    转运机器人,所述转运机器人被配置为负责容器在容器缓存区和工作站之间的交换。
  2. 根据权利要求1所述的仓储系统,其中,所述仓库储存区中,横向排列的多个货架之间形成了多条横向通道,纵向排列的多个货架之间形成了多条纵向通道;多条所述横向通道和多条所述纵向通道交错设置。
  3. 根据权利要求2所述的仓储系统,其中,所述横向通道被配置为用于转运机器人通行;所述竖向通道被配置为用于搬运机器人通行。
  4. 根据权利要求3所述的仓储系统,其中,所述搬运机器人被配置为通过所述横向通道由一纵向通道交换到另一纵向通道中。
  5. 根据权利要求3所述的仓储系统,其中,所述横向通道被构造为供不同的转运机器人双向同时行驶。
  6. 根据权利要求1至5中任一项所述的仓储系统,其中,所述容器缓存区和容器储存区在货架垂直方向上依次交替设置;或者所述容器缓存区设置有至少一层,至少一层所述容器缓存区位于容器储存区的下方。
  7. 根据权利要求6所述的仓储系统,其中,所述货架的最底层为容器缓存区,所述容器缓存区包括在水平方向上彼此相邻且平行设置的容器缓存位和缓存区通道;所述转运机器人被配置为满载时或者空载时在所述缓存区通道中行驶。
  8. 根据权利要求7所述的仓储系统,其中,所述缓存区通道沿着货架的纵向方向延伸,形成纵向缓存区通道;和/或,所述缓存区通道沿着货架的横向方向延伸,形成横向缓存区通道。
  9. 根据权利要求7所述的仓储系统,其中,所述容器缓存位的底部与地面之间形成了供转运机器人空载时行驶的空载行驶通道。
  10. 根据权利要求1至5中任一项所述的仓储系统,其中,所述转运机器人被配置将容器缓存区上的容器转运至工作站的货架平台上;所述工作站被配置为对位于货架平台上的容器进行处理。
  11. 根据权利要求1至5中任一项所述的容器转运系统,其中,所述工作站包括至少一个处理区,且被配置为对位于处理区的转运机器人上的容器进行处理。
  12. 根据权利要求11所述的容器转运系统,其中,所述工作站被配置为当处理区内转运机器人上的容器处理完毕后,向下一转运机器人发出在容器缓存区取容器的指令。
  13. 根据权利要求11所述的仓储系统,其中,所述工作站包括至少一个排队区,所述转运机器人被配置为当处理区被占用时在排队区依次排队。
  14. 根据权利要求13所述的仓储系统,其中,所述处理区和排队区相对应,且分别设置有至少两个。
  15. 根据权利要求1至5中任一项所述的仓储系统,其中,所述工作站包括显示器,所述显示器被配置为用于显示指引操作人员的信息。
  16. 根据权利要求1至5中任一项的仓储系统,其中,所述工作站包括灯光指引装置,所述灯光指引装置被配置为用于投射出辅助操作人员操作的信息。
  17. 根据权利要求1至5中任一项所述的仓储系统,其中,所述工作站包括交互按钮,所述交互按钮被配置为用于当操作人员完成操作后与系统的交互确认。
  18. 根据权利要求1至5中任一项所述的仓储系统,其中,所述工作站包括货容器位姿检测装置,所述货容器位姿检测装置被配置为用于检测转运机器人上容器的姿态。
  19. 根据权利要求1至5中任一项所述的仓储系统,其中,所述工作站包括安全防护装置,所述安全防护装置为用于阻止转运机器人进入工作站的防护门。
  20. 根据权利要求1至5中任一项所述的仓储系统,其中,所述工作站包括安全防护装置和控制单元,所述安全防护装置为检测传感器;所述控制单元基于所述检测传感器检测到的误入工作站处理区的电信号,向转运机器人发出停止进站的指令。
  21. 根据权利要求1至5中任一项所述的仓储系统,其中,所述工作站包括识别装置,所述识别装置被配置为获取转运机器人上容器的信息。
  22. 根据权利要求1至5中任一项所述的仓储系统,其中,所述工作站包括视觉识别装置和控制单元,所述识别装置被配置为用于识别容器中的商品种类或者数量;和/或被配置为用于识别操作人员的操作手势;所述控制单元基于视觉识别装置获得的错误信息发出报警信号。
  23. 根据权利要求1至22中任一项所述的仓储系统,其中,在所述仓库储存区与工作站区之间设置有高速行驶区;所述转运机器人在高速行驶区的行驶速度大于其在仓库储存区的行驶速度。
  24. 一种货架,所述货架用于权利要求1至23中任一项所述的仓储系统,包括:
    容器缓存区;和
    容器储存区。
  25. 根据权利要求24所述的货架,其中,所述容器缓存区和容器储存区在货架垂直方向上依次交替设置;或者所述容器缓存区设置有至少一层,至少一层所述容器缓存区位于容器储存区的下方。
  26. 根据权利要求25所述的货架,其中,所述货架的最底层为容器缓存区,所述容器缓存区包括在水平方向上彼此相邻且平行设置的容器缓存位和缓存区通道。
  27. 根据权利要求26所述的货架,其中,所述缓存区通道沿着所述货架的纵向方向延伸,形成纵向缓存区通道;和/或,所述缓存区通道沿着所述货架的横向方向延伸,形成横向缓存区通道。
  28. 一种转运机器人,所述转运机器人用于权利要求1至23中任一项所述的仓储系统,包括:
    底盘机构;
    举升机构,所述举升机构设置在所述底盘机构上;
    顶板,所述顶板设置在所述举升机构上,且受控于举升机构驱动上升或下降;所述顶板用于与容器接触的一面设置有与容器底部配合的定位机构;
    所述顶板被构造为用于将容器顶起或落下。
  29. 根据权利要求28所述的转运机器人,其中,所述定位机构包括定位销或定位孔;
    所述定位销设置在所述顶板上,用于与定位销配合的定位孔设置在容器的底部;或者是,
    所述定位孔设置在所述顶板上,用于与定位孔配合的定位销设置在容器的底部。
  30. 根据权利要求29所述的转运机器人,其中,所述定位销或定位孔至少设置有两个,分布在顶板或容器的相对两侧区域。
  31. 根据权利要求29所述的转运机器人,其中,所述定位销至少其顶部表面呈圆锥面结构,所述定位孔的形状与所述定位销相配合。
  32. 根据权利要求28至31中任一项所述的转运机器人,其中,所述举升机构还包括驱动组件和至少具有一个剪叉单元的剪叉组件,所述剪叉组件底端与所述底盘机构活动连接、顶端与顶板活动连接,所述驱动组件用于驱动所述剪叉组件在竖直方向升降。
  33. 根据权利要求32所述的转运机器人,其中,所述剪叉单元包括两个交叉设置并且在交叉处铰接的第一连杆组件、第二连杆组件;
    邻近所述顶板的剪叉单元中的第一连杆组件顶端与所述顶板铰接,第二连杆组件顶端相对所述顶板在水平方向移动;
    邻近所述底盘机构的剪叉单元的第一连杆组件底端与所述底盘机构铰接,第二连杆组件底端相对所述底盘机构在水平方向移动;
    相邻两个所述剪叉单元之间铰接在一起。
  34. 根据权利要求33所述的转运机器人,其中,所述顶板底部设置有水平方向延伸的第一导向机构,与顶板邻近的剪叉单元中的第二连杆组件被构造为在第一导向机构中水平移动;
    所述底盘机构的顶部设置有水平方向延伸的第二导向机构,与底盘机构邻近的剪叉单元中的第二连杆组件被构造为在第二导向机构中水平移动。
  35. 根据权利要求34所述的转运机器人,其中,所述剪叉单元中用于与第一导向机构、第二导向机构配合的第二连杆组件的端头设有滚轮,所述滚轮被构造为沿所述第一导向机构、第二导向机构滚动。
  36. 根据权利要求33所述的转运机器人,其中,所述剪叉组件包括两个剪叉单元,位于上方的所述剪叉单元包括铰接连接的第一上连杆组件和第二上连杆组件,位于下方的所述剪叉单元包括铰接连接的第一下连杆组件和第二下连杆组件;
    所述第一上连杆组件的顶端与所述顶板铰接、底端与所述第一下连杆组件的顶端铰接,所述第二上连杆组件的顶端支撑在所述顶板底部并且相对顶板水平方向移动、底端与所述第二下连杆组件的顶端铰接;所述第一下连杆组件的底端与所述底盘机构铰接,所述第二下连杆组件的底端支撑在所述底盘机构上并且相对底盘机构水平方向移动。
  37. 根据权利要求32所述的转运机器人,其中,所述驱动组件包括摇杆、驱动电机和连接在所述驱动电机输出端的凸轮,所述摇杆的其中一端与凸轮铰接、另一端铰接在所述剪叉组件上;所述驱动电机被配置为通过摇杆驱动所述剪叉组件升降。
  38. 一种转运系统,包括权利要求28至37中任一项所述的转运机器人、至少一个货架,所述转运机器人被配置为将位于货架上的容器顶起,或者被配置为将顶板上的容器放置在货架上。
  39. 根据权利要求38所述的转运系统,其中,所述货架包括架体,所述架体上具有多个成排设置的第一容器位,所述第一容器位具有用于支撑容器的支撑部,所述支撑部设置有供所述转运机器人通过的开口端。
  40. 根据权利要求39所述的转运系统,其中,所述货架上还设置有用于放置容器的第二容器位,所述第二容器位设置在所述第一容器位的上方,还包括搬运机器人,所述搬运机器人被配置为将位于第二容器位上的容器转移至第一容器位上。
  41. 根据权利要求40所述的转运系统,其中,所述第一容器位设置有至少一层,位于所述架体上第二容器位的底部。
  42. 一种仓储调度方法,所述仓储调度方法是使用权利要求1至23中任一项所述的仓储系统进行的,包括:
    确定容器缓存区中缓存位的占用比例,其中,所述容器缓存区包括至少一个缓存位;
    在所述缓存位的占用比例超过设定比例阈值的情况下,确定所述容器缓存区中各个缓存位存放容器的容器分值,其中,所述容器分值基于待执行拣选任务与容器中目标物数量确定;
    根据所述容器分值,确定所述容器缓存区中的待释放缓存位,并生成针对所述待释放缓存位中待归还容器的归还任务,其中,所述归还任务用于指示将所述待归还容器从所述待释放缓存位归还至容器储存区。
  43. 根据权利要求42所述的仓储调度方法,其中,所述确定容器缓存区中缓存位的占用比例,包括:
    确定所述容器缓存区中的已占用缓存位数目;
    根据当前的容器转移任务,确定待占用缓存位数目和待释放缓存位数目;
    根据所述已占用缓存位数目、所述待占用缓存位数目和所述待释放缓存位数目,确定所述容器缓存区中缓存位的占用比例。
  44. 根据权利要求42所述的仓储调度方法,其中,所述根据所述容器分值,确定所述容器缓存区中的待释放缓存位,包括:
    确定所述占用比例与所述设定比例阈值的差值,并根据所述差值确定待释放缓存位的数目;
    对所述各个缓存位存放容器的容器分值进行排序,根据排序结果,选取所述数目待释放缓存位。
  45. 根据权利要求42所述的仓储调度方法,其中,所述生成针对所述待释放缓存位中待归还容器的归还任务,包括:
    确定所述待释放缓存位对应的目标储存位;
    基于所述待释放缓存位和所述目标储存位生成所述归还任务,其中,所述归还任务用于将所述待释放缓存位中存放的待归还容器归还至所述目标储存位。
  46. 根据权利要求42至45中任一项所述的仓储调度方法,其中,所述确定所述容器缓存区中各个缓存位存放容器的容器分值之前,还包括:
    每间隔第一预设时长,确定所述容器储存区中待转移至所述容器缓存区的待转移容器;
    确定所述待转移容器在所述容器缓存区对应的第一缓存位;
    基于第一储存位和所述第一缓存位生成所述待转移容器的容器转移任务,其中,所述第一储存位为所述待转移容器在所述容器储存区的储存位置,所述容器转移任务用于指示将所述待转移容器从所述第一储存位转移至所述第一缓存位。
  47. 根据权利要求46所述的仓储调度方法,其中,仓储系统包括至少两个巷道,每个所述巷道均设置有所述容器储存区和所述容器缓存区;
    所述确定所述待转移容器在所述容器缓存区对应的第一缓存位,包括:
    确定第一容器缓存区中是否存在可用缓存位,其中,所述第一容器缓存区与所述待转移容器所处的容器储存区属于同一巷道;
    若存在可用缓存位,则从所述可用缓存位中确定所述第一缓存位;
    若不存在可用缓存位,则从第二容器缓存区中确定所述第一缓存位,其中,所述第二容器缓存区与所述待转移容器所处的容器储存区不属于同一巷道。
  48. 根据权利要求47所述的仓储调度方法,其中,所述第一缓存位与所述第一储存位属于同一巷道;
    所述基于第一储存位和所述第一缓存位生成所述待转移容器的容器转移任务,包括:
    确定所述第一缓存位当前是否存放有容器;
    若存放有容器,则生成针对所述第一缓存位中存放容器的替换任务,其中,所述替换任务用于指示搬运机器人将所述第一缓存位中的存放容器归还至所述容器储存区、并将所述待转移容器从所述第一储存位搬运至所述第一缓存位;
    若未存放有容器,则基于所述第一储存位和所述第一缓存位生成针对所述待转移容器的第一容器搬运任务,其中,所述第一容器搬运任务用于指示搬运机器人将所述待转移容器从所述第一储存位搬运至所述第一缓存位。
  49. 根据权利要求47所述的仓储调度方法,其中,所述第一缓存位与所述第一储存位属于不同巷道;
    所述基于第一储存位和所述第一缓存位生成所述待转移容器的容器转移任务,包括:
    基于所述第一储存位生成针对所述待转移容器的第二容器搬运任务,其中,所述第二容器搬运任务用于指示搬运机器人将所述待转移容器从所述第一储存位搬运至第二缓存位,所述第二缓存位与所述第一储存位属于同一巷道;
    在所述待转移容器搬运至所述第二缓存位的情况下,基于所述第二缓存位和所述第一缓存位针对所述待转移容器生成转运任务,其中,所述转运任务用于指示转运机器人将所述待转移容器从所述第二缓存位转运至所述第一缓存位。
  50. 根据权利要求49所述的仓储调度方法,其中,所述基于所述第二缓存位和所述第一缓存位针对所述待转移容器生成转运任务,包括:
    确定所述第一缓存位当前是否存放有容器;
    若存放有容器,则生成针对所述第一缓存位中存放容器的第三容器搬运任务,其中,所述第三容器搬运任务用于指示搬运机器人将所述第一缓存位中存放容器从所述第一缓存位移动至第二存储位,所述第一缓存位与所述第二存储位处于同一巷道或不同巷道;
    在所述第一缓存位中存放容器搬运出所述第一缓存位的情况下,基于所述第二缓存位和所述第一缓存位针对所述待转移容器生成所述转运任务。
  51. 根据权利要42至45中任一项所述的仓储调度方法,其中,所述确定所述容器缓存区中各个缓 存位存放容器的容器分值之前,还包括:
    确定第一容器中的至少一个目标物组匹配的拣选任务数目,其中,所述第一容器为所述容器缓存区和所述容器储存区中存放的任一容器,目标物标识相同的目标物构成一个目标物组;
    根据所述至少一个目标物组匹配的拣选任务数目,确定第一容器的热度值;
    确定所述第一容器的容器类型,并根据所述容器类型,确定所述第一容器的基础分值;
    根据所述热度值和所述基础分值,确定所述第一容器的容器分值。
  52. 根据权利要求51所述的仓储调度方法,其中,所述根据所述容器类型,确定所述第一容器的基础分值,包括:
    在所述第一容器的容器类型为命中容器的情况下,确定所述第一容器的基础分值为第一设定值,其中,所述命中容器是指被选中执行拣选任务的容器,所述第一设定值为第一分值范围的下边界数值;
    在所述第一容器的容器类型为非命中容器、且为容器缓存区中容器的情况下,确定所述第一容器的基础分值为第二设定值,其中,所述第二设定值为第二分值范围的下边界数值;
    在所述第一容器的容器类型为非命中容器、且为容器储存区中容器的情况下,确定所述第一容器的基础分值为第三设定值,其中,所述第三设定值为第三分值范围的下边界数值;
    其中,所述第一分值范围、所述第二分值范围和所述第三分值范围为基于容器分值划分获得,所述第一设定值高于所述第二设定值,且所述第二设定值高于所述第三设定值。
  53. 一种仓储调度装置,包括:
    第一确定模块,被配置为确定容器缓存区中缓存位的占用比例,其中,所述容器缓存区包括至少一个缓存位;
    第二确定模块,被配置为在所述缓存位的占用比例超过设定比例阈值的情况下,确定所述容器缓存区中各个缓存位存放容器的容器分值,其中,所述容器分值基于待执行拣选任务与容器中目标物数量确定;
    生成模块,被配置为根据所述容器分值,确定所述容器缓存区中的待释放缓存位,并生成针对所述待释放缓存位中待归还容器的归还任务,其中,所述归还任务用于指示将所述待归还容器从所述待释放缓存位归还至容器储存区。
  54. 一种计算设备,包括:
    处理器;和
    存储器,所述存储器用于存储计算机可执行指令,
    其中所述处理器用于执行所述计算机可执行指令,以实现上述权利要求42至52中任一项所述的仓储调度方法的步骤。
  55. 一种计算机可读存储介质,其存储有计算机指令,该指令被处理器执行时实现权利要求42至52中任一项所述的仓储调度方法的步骤。
  56. 一种计算机程序产品,包括计算机程序,所述计算机程序被处理器执行时实现如权利要求42至52中任一项所述的仓储调度方法的步骤。
PCT/CN2022/114669 2021-08-27 2022-08-25 仓储系统及仓储调度方法 WO2023025222A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP22860568.9A EP4393842A1 (en) 2021-08-27 2022-08-25 Warehousing system and warehousing scheduling method

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
CN202122054995.8U CN215709083U (zh) 2021-08-27 2021-08-27 转运机器人及转运系统、仓储系统
CN202122055035.3U CN215709084U (zh) 2021-08-27 2021-08-27 仓储系统
CN202122055035.3 2021-08-27
CN202122054995.8 2021-08-27
CN202210590668.0 2022-05-27
CN202210590668.0A CN117163517A (zh) 2022-05-27 2022-05-27 仓储调度方法及装置

Publications (1)

Publication Number Publication Date
WO2023025222A1 true WO2023025222A1 (zh) 2023-03-02

Family

ID=85322434

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/114669 WO2023025222A1 (zh) 2021-08-27 2022-08-25 仓储系统及仓储调度方法

Country Status (2)

Country Link
EP (1) EP4393842A1 (zh)
WO (1) WO2023025222A1 (zh)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109636269A (zh) * 2018-11-14 2019-04-16 深圳市海柔创新科技有限公司 货物处理方法、装置、存储介质和计算机设备
EP3650374A1 (de) * 2018-11-06 2020-05-13 Gebhardt Fördertechnik GmbH Lagersystem zum lagern von behältern
CN111361908A (zh) * 2020-03-27 2020-07-03 上海快仓智能科技有限公司 仓储装置、系统、控制方法
CN112591359A (zh) * 2020-12-08 2021-04-02 北京极智嘉科技有限公司 一种库存物品拣选系统、方法
CN112830137A (zh) * 2020-12-18 2021-05-25 上海快仓智能科技有限公司 货架、仓储装置、控制方法、控制设备、仓储系统
CN215709083U (zh) * 2021-08-27 2022-02-01 苏州极智嘉机器人有限公司 转运机器人及转运系统、仓储系统
CN215709084U (zh) * 2021-08-27 2022-02-01 苏州极智嘉机器人有限公司 仓储系统

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3650374A1 (de) * 2018-11-06 2020-05-13 Gebhardt Fördertechnik GmbH Lagersystem zum lagern von behältern
CN109636269A (zh) * 2018-11-14 2019-04-16 深圳市海柔创新科技有限公司 货物处理方法、装置、存储介质和计算机设备
CN111361908A (zh) * 2020-03-27 2020-07-03 上海快仓智能科技有限公司 仓储装置、系统、控制方法
CN112591359A (zh) * 2020-12-08 2021-04-02 北京极智嘉科技有限公司 一种库存物品拣选系统、方法
CN112830137A (zh) * 2020-12-18 2021-05-25 上海快仓智能科技有限公司 货架、仓储装置、控制方法、控制设备、仓储系统
CN215709083U (zh) * 2021-08-27 2022-02-01 苏州极智嘉机器人有限公司 转运机器人及转运系统、仓储系统
CN215709084U (zh) * 2021-08-27 2022-02-01 苏州极智嘉机器人有限公司 仓储系统

Also Published As

Publication number Publication date
TW202308917A (zh) 2023-03-01
EP4393842A1 (en) 2024-07-03

Similar Documents

Publication Publication Date Title
US11724879B2 (en) Management method, device and system applied to goods-to-person system, server and computer storage medium
US11608228B2 (en) Control system for storage and retrieval systems
CN107628404B (zh) 一种物流仓储中心基于订单到人的拣选系统和方法
WO2020052592A1 (zh) 机器人控制系统和方法、计算设备及存储介质
JP7065693B2 (ja) 物品搬送システム、オーダー管理装置、及び、物品搬送システムの制御方法
CN113673887B (zh) 任务分配方法、装置、服务器和存储介质
CN111861325A (zh) 一种仓储系统和仓储控制方法
US20210323800A1 (en) Shelf management method and system, pickup area and stock pickup system
CN215709084U (zh) 仓储系统
US20230041684A1 (en) Automated warehouse, automated warehouse control method, program, and automated warehouse system
WO2023025222A1 (zh) 仓储系统及仓储调度方法
Pfrommer et al. Autonomously organized block stacking warehouses: A review of decision problems and major challenges
WO2024093758A1 (zh) 立体仓库的搬运调度方法及装置
TWI843186B (zh) 貨架、倉儲系統、轉運機器人及系統、倉儲排程方法及裝置、計算設備、電腦可讀儲存媒體、電腦程式產品
CN215709083U (zh) 转运机器人及转运系统、仓储系统
Chen et al. Does battery management matter? Performance evaluation and operating policies in a self-climbing robotic warehouse
JP2023525729A (ja) 在庫システム及び方法
EP3816886B1 (en) Management method, apparatus, system applied to goods-to-person system, and server and computer storage medium
WO2023084732A1 (ja) 情報処理システム及び方法並びに制御システム
CN115043122B (zh) 机场早到行李立体存储系统出入库模式评估选择方法
JP7454746B2 (ja) 搬送システム及び方法
US20240043215A1 (en) Multi-level tote cache storage and sequencing for improved picker performance
EP4398168A2 (en) Management method, apparatus, system applied to goods-to-person system, and server and computer storage medium
JP2004001944A (ja) 入出庫制御方法及び装置並びにその入出庫制御装置を有する自動倉庫
Zhu et al. AGV scheduling strategy based on the A* algorithm

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22860568

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2022860568

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2022860568

Country of ref document: EP

Effective date: 20240327