WO2023226465A1 - 存储物品的方法、装置、设备和计算机可读介质 - Google Patents

存储物品的方法、装置、设备和计算机可读介质 Download PDF

Info

Publication number
WO2023226465A1
WO2023226465A1 PCT/CN2023/073810 CN2023073810W WO2023226465A1 WO 2023226465 A1 WO2023226465 A1 WO 2023226465A1 CN 2023073810 W CN2023073810 W CN 2023073810W WO 2023226465 A1 WO2023226465 A1 WO 2023226465A1
Authority
WO
WIPO (PCT)
Prior art keywords
item
storage
storage unit
occupied
items
Prior art date
Application number
PCT/CN2023/073810
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
Application filed by 北京京东乾石科技有限公司 filed Critical 北京京东乾石科技有限公司
Publication of WO2023226465A1 publication Critical patent/WO2023226465A1/zh

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders

Definitions

  • the present disclosure relates to the field of computer technology, and in particular, to a method, device, equipment and computer-readable medium for storing items.
  • the three-dimensional warehouse is a kind of intensive storage equipment in the warehouse. With the popularization of the application of intensive storage of three-dimensional libraries, there are new requirements for the storage of three-dimensional libraries.
  • the storage locations in the three-dimensional warehouse are fixed, that is, one item is placed in each storage location, and the size of the item matches the size of the storage location one by one, as shown in Figure 1.
  • embodiments of the present disclosure provide a method, device, equipment and computer-readable medium for storing items, which can locate storage locations with actual containers and improve storage density.
  • a method for storing items including:
  • a storage unit is the smallest storage location in a warehouse
  • the method of knowing the number of storage units occupied by the item based on the projected area of the item includes:
  • the number of storage units occupied by the items is determined based on the width of the item involved in the projected area of the item and the width of the storage unit.
  • Locating the storage location of the item in the warehouse in the free storage unit based on the projected area of the item and the number of occupied storage units includes:
  • the storage location of the item is positioned using the width of the storage unit as a step length.
  • locating the storage location of the item includes: :
  • the width of the item involved in the projected area of the item and the number of occupied storage units using the width of the storage unit as the step size, determine the candidate storage location of the item in the free storage unit;
  • a storage location for the item is located in the candidate storage location based on a minimum number of free storage units between the candidate storage location and the occupied storage unit.
  • the object is carried in the object container, and the projected area of the object includes the projected area of the object container.
  • the storage of the item into the storage location of the item and updating the storage location of the item involve the status of the storage unit, including:
  • the storage unit involved in the storage location of the item is marked as an occupied storage unit, so that the item is stored in the storage location of the item.
  • the method also includes:
  • the item has been moved out of the storage location of the item, and the storage unit involved in the storage location of the item is marked as a free storage unit to release the storage location occupied by the item.
  • a device for storing items including:
  • the container module is used to learn the number of storage units occupied by the items based on the projected area of the items.
  • the storage units are the smallest storage locations in the warehouse;
  • a positioning module configured to locate the storage location of the item in the warehouse based on the projected area of the item and the number of occupied storage units in the free storage unit of the warehouse;
  • a storage module is configured to store the item into a storage location of the item, and update the status of the storage unit related to the storage location of the item.
  • an electronic device for storing items including:
  • processors one or more processors
  • a storage device for storing one or more programs
  • the one or more processors When the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the method as described above.
  • a computer-readable medium is provided, a computer program is stored thereon, and when the program is executed by a processor, the above method is implemented.
  • One embodiment of the above invention has the following advantages or beneficial effects: according to the projected area of the item, the number of storage units occupied by the items is known, and the storage unit is a warehouse the minimum storage space in the warehouse; in the free storage unit of the warehouse, locate the storage space of the item in the warehouse based on the projected area of the item and the number of occupied storage units; store the item in the storage location of the item, and updating the state of the storage unit involved in the storage location of the item. Based on the projected area of the items, the storage location of the items is located, thereby reducing the distance between items and thereby increasing the storage density of the warehouse.
  • Figure 1 is a schematic diagram of storage locations in a three-dimensional warehouse according to the prior art
  • Figure 2 is a schematic diagram of another storage location in a three-dimensional warehouse according to the prior art
  • Figure 3 is a main flow diagram of a method for storing items according to an embodiment of the present disclosure
  • Figure 4 is a schematic flowchart of locating storage locations of items according to an embodiment of the present disclosure
  • Figure 5 is a schematic diagram of a candidate storage location for an item according to an embodiment of the present disclosure.
  • Figure 6 is a schematic diagram of items stored in a three-dimensional library according to an embodiment of the present disclosure.
  • Figure 7 is a schematic diagram of the main structure of a device for storing items according to an embodiment of the present disclosure
  • Figure 8 is an exemplary system architecture diagram in which embodiments of the present disclosure may be applied.
  • FIG. 9 is a schematic structural diagram of a computer system suitable for implementing a terminal device or server according to an embodiment of the present disclosure.
  • Figure 1 is a schematic diagram of storage locations in a three-dimensional warehouse according to the prior art.
  • 2 layers of storage are marked A, B, C and D respectively.
  • item 2 is stored in storage location C1;
  • item 1 is stored in storage location D1;
  • item 3 is stored in storage location D2.
  • Item 1, Item 2 and Item 3 have the same projected area.
  • Figure 2 is a schematic diagram of another storage location in a three-dimensional warehouse according to the prior art.
  • the projections of items 1, 2, and 3 are different, but since the volume projection area of each storage location cannot be adjusted, the storage locations occupied by items 1, 2, and 3 are the same size.
  • Figure 3 is a schematic flowchart of a method for storing items according to an embodiment of the present disclosure. Storage locations are positioned according to the projected area of the items to increase storage density. As shown in Figure 3, it specifically includes the following steps:
  • the storage unit is the smallest storage location in the warehouse.
  • the three-dimensional warehouse includes multiple levels, and each level contains multiple storage locations. Items can be stored in storage slots. In the embodiment of the present disclosure, items are carried in the item container. That is to say, the object is carried in the object container, and the projected area of the object includes the projected area of the object container.
  • the item container includes the original packaging of the item.
  • the item container specifically includes ten packs of rolling papers. That is, the item container is the original packaging of the item with ten packs of rolling papers.
  • the projected area of the item container is 0.5 square meters to carry multiple pieces of clothing.
  • the item container has a projected area of 0.2 square meters to hold multiple books.
  • the storage unit is used as the basic unit for measuring items.
  • a storage unit is the smallest storage location in a warehouse. As an example, based on the actual situation in the warehouse, Default storage unit width.
  • a storage unit is the smallest granularity that identifies a storage location. Storage units allow you to mark where items are stored.
  • the memory cells are identified through Equation 1, Equation 2, and Equation 3.
  • no grid is the grid number, indicating the storage group number corresponding to the storage unit; no cell is the storage unit number; index i is the number in the length direction of the storage unit, and index j is the number in the width direction of the storage unit. Index i and index j describe the positional relationship of storage units.
  • the above two numbers of two adjacent storage units are consecutive.
  • Formula 2 represents the value range of i, that is, the maximum value of i is the grid length length grid divided by the container storage transverse spacing length inr rounded down.
  • Formula 3 represents the value range of j, that is, the maximum value of j is the width grid divided by the depth interval width inr of the container inventory, rounded down.
  • the storage unit involves a grid, and the grid is illustrated below. There is a corresponding relationship between the grid and the storage group (cellGroup).
  • a storage group is a logical abstraction of a grid. All storage location groups constitute the entire inventory of the three-dimensional warehouse.
  • the data structure of the storage group is as follows:
  • no tunnel is the tunnel number
  • no tier is the level number
  • no grid is the grid number
  • length grid is the length of the grid
  • width grid is the width of the grid, that is, the depth of the grid
  • high grid is the height of the grid.
  • shelves composed of storage locations are set in the lanes.
  • the shelves include multiple levels.
  • Each shelf includes a plurality of grids arranged in sequence. Among them, the height of the grid is the distance between the upper and lower shelves.
  • the number of storage units occupied by the item is determined based on the projected area of the item.
  • the projected area of an item involves the width and length of the item. Considering that when the shelves store items, the width of the items should be assessed. For the length of the items, the depth of the shelves can meet the requirements. Therefore, when determining the number of storage units occupied by an item, both the width of the item and the width of the storage unit are involved. That is, the number of storage units occupied by the items is determined based on the width of the item and the width of the storage unit involved in the projected area of the item.
  • the projected area of an item relates to the width of the item, and the storage unit also has a width. Items need to be measured in storage units.
  • the projected area of the item can be determined in advance from the outer packaging or by measurement.
  • the projected area of the item can be determined by the smallest external shape of the item.
  • the projected area of an item involves a width of: 0.5 meters.
  • the width of the storage unit is: 0.2 meters. It can be seen that the number of storage units occupied by items is 3.
  • Measuring items through storage units lays the foundation for locating their storage locations.
  • the storage unit has two states, namely idle state and occupied state. That is, the storage units include free storage units and occupied storage units. As for the occupied storage unit, since it is already occupied by other items, in the case of storing items, there is no need to consider occupying the storage unit. For an idle storage unit, since it is not occupied by other items, in the case of storing items, the idle storage unit is used as an object for storing items.
  • the storage location of the item is located based on the projected area of the item and the number of occupied storage units.
  • a storage unit is the smallest unit in a warehouse where items are stored.
  • the width of the storage unit is used as the step length to position the storage of items. Bit. That is, in the free storage unit of the warehouse, based on the width of the item involved in the projected area of the item and the number of occupied storage units, the storage location of the item is located using the width of the storage unit as the step size.
  • the width of the storage unit as the step length to locate the storage locations of items can minimize the distance between items.
  • the width of the storage unit can be preset according to the actual warehouse.
  • FIG. 4 is a schematic flowchart of locating storage locations of items according to an embodiment of the present disclosure. Specifically, it includes the following steps:
  • An occupied storage unit is a storage unit that is occupied by an item.
  • Free storage units are storage units that are not occupied by items.
  • candidate storage locations need to be determined from two aspects: the width of the item involved in the projected area of the item and the number of occupied storage units.
  • the width of the item involved in the projected area of the item identifies the occupied storage unit from the perspective of the item; the number of occupied storage units identifies the occupied storage unit from the perspective of quantity.
  • FIG. 5 is a schematic diagram of a candidate storage location for an item according to an embodiment of the present disclosure.
  • Item 1 and Item 2 are already stored in the warehouse in Figure 5 .
  • the width of the storage unit is 0.1 meters.
  • the projected area of item 1 involves the width of the item: Width: 1 meter, occupying 10 storage units.
  • the width of the item involved in the projected area of item 2 is: 0.5 meters, occupying 5 storage units.
  • Item 3 needs to be placed in the warehouse.
  • the projected area of item 3 involves the width of the item: 0.5 meters, occupying 5 storage units.
  • the candidate storage locations for item 3 include candidate storage location 1, candidate storage location 2, candidate storage location 3, and candidate storage location 4.
  • candidate storage locations are determined according to the width of the storage unit as the step size. It can be seen that candidate storage location 1 and candidate storage location 2 are separated by one storage unit; candidate storage location 2 and candidate storage location 3 are separated by one storage unit; candidate storage location 3 and candidate storage location 4 are separated by one storage unit, and so on.
  • the storage location of the item in order to shorten the interval between items, can be located in the candidate storage location based on the minimum number of free storage units between the candidate storage location and the occupied storage unit. If there is only one candidate storage location, the candidate storage location can be directly used as the storage location for the item.
  • the storage location of the item is located in the candidate storage locations based on the minimum number of free storage units between the candidate storage locations and the occupied storage units.
  • the distance between candidate storage location 1 and the rightmost storage unit of item 2 is 0 free storage units; the distance between candidate storage location 2 and the rightmost storage unit of item 2 is the corresponding number of free storage units for candidate storage location 1; candidate storage location
  • the distance between location 3 and the rightmost storage unit of item 2 is, the corresponding number of free storage units for candidate storage location 1 and candidate storage location 2; the distance between candidate storage location 4 and the rightmost storage unit of item 2 is, candidate storage location 1 , the corresponding number of free storage units for candidate storage location 2 and candidate storage location 3. Since the minimum number of free storage units between candidate storage location 1 and occupied storage units is 0, candidate storage location 1 is positioned as the storage location for item 3.
  • the width of the storage unit is used as the step size to determine the candidate storage location of the item. Compared with storing items in fixed storage locations, the distance between items is greatly shortened.
  • Figure 6 is a schematic diagram of items stored in a three-dimensional library according to an embodiment of the present disclosure.
  • a lane includes two shelves, each shelf has two floors.
  • the storage location is determined according to the projected area of the item. Since the projected area of the items is different, the storage location of each item is also different.
  • the distance between items 1 and 3 is small. Compared with Figure 2, the distance between items can be greatly shortened.
  • storage items are implemented in a container model. Specifically include the following:
  • type ctn is the type of the item
  • length ctn is the length of the item
  • width ctn is the width of the item
  • high ctn is the height of the item.
  • Types of container for items include original packaging and non-original packaging.
  • the item storage location (ctnStock) is an abstraction of the container inventory. Each item corresponds to its own set of item slots.
  • the storage location of an item is defined as follows:
  • no grid is the grid number
  • type ctn is the type of item
  • storage location number of the item It is the collection of storage units corresponding to the storage locations of objects.
  • items are stored to storage locations for items.
  • a shuttle or a stacker can be used to transport and store items to their storage locations.
  • the storage unit involved in the storage location of the item needs to be marked as an occupied storage unit to store the item in the storage location of the item. In this way, when items are to be stored, the storage location is located in a free storage unit without considering occupying the storage unit.
  • Formula 5 to Formula 12 are adopted as models for implementing embodiments of the present disclosure.
  • Input parameter type ctn of the item.
  • Output parameter candidate storage list ctnStockList.
  • the returned result satisfies the following conditions:
  • the type of item is type ctn .
  • the storage units in the candidate storage location list are all free storage units.
  • Input parameters the item number no ctn , the collection of free storage units cellList mn corresponding to the item's storage location.
  • the storage location needs to be released. Specifically, the item has been moved out of the storage location of the item, and the storage unit involved in the storage location of the item is marked as a free storage unit to release the storage location occupied by the item. In this way, it is convenient to use the free storage unit after the release as a storage location when storing items.
  • Input parameter item number no ctn .
  • the number of storage units occupied by the item is known, and the storage unit is the smallest storage location in the warehouse; in the free storage unit of the warehouse, based on the projected area of the item and The number of occupied storage units is used to locate the storage location of the item in the warehouse; the item is stored in the storage location of the item, and the status of the storage unit involved in the storage location of the item is updated.
  • the storage location of the items is located, thereby reducing the distance between items and thereby increasing the storage density of the warehouse.
  • Figure 7 is a schematic diagram of the main structure of a device for storing items according to an embodiment of the present disclosure.
  • the device for storing items can implement a method for storing items.
  • the device for storing items specifically includes:
  • the container module 701 is used to learn the number of storage units occupied by the items based on the projected area of the items.
  • the storage units are the minimum storage locations in the warehouse;
  • the positioning module 702 is used to locate the storage location of the item in the free storage unit of the warehouse based on the projected area of the item and the number of occupied storage units;
  • the storage module 703 stores the item into the storage location of the item, and updates the status of the storage unit related to the storage location of the item.
  • the container module 701 is specifically configured to determine the number of storage units occupied by the items based on the width of the item involved in the projected area of the item and the width of the storage unit.
  • the positioning module 702 is specifically configured to, in an idle storage unit of the warehouse, determine the width of the item based on the projected area of the item and the number of occupied storage units.
  • the width of the unit is the step length that locates the storage location for the item.
  • the positioning module 702 is specifically configured to obtain free storage units and occupied storage units in the storage units of the warehouse;
  • the width of the item involved in the projected area of the item and the number of occupied storage units using the width of the storage unit as the step size, determine the candidate storage location of the item in the free storage unit;
  • a storage location for the item is located in the candidate storage location based on a minimum number of free storage units between the candidate storage location and the occupied storage unit.
  • the object is carried in an object container, and the projected area of the object includes the projected area of the object container.
  • the storage module 703 is specifically configured to identify the storage unit involved in the storage location of the item as an occupied storage unit, so as to store the item in the storage location of the item.
  • the storage module 703 is also used for the items that have been removed
  • the storage location of the item marks the storage unit involved in the storage location of the item as a free storage unit to release the storage location occupied by the item.
  • FIG. 8 shows an exemplary system architecture 800 in which a method for storing items or an apparatus for storing items according to embodiments of the present disclosure may be applied.
  • the system architecture 800 may include terminal devices 801, 802, 803, a network 804 and a server 805.
  • Network 804 is a medium used to provide communication links between terminal devices 801, 802, 803 and server 805.
  • Network 804 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
  • Terminal devices 801, 802, 803 Users can use terminal devices 801, 802, 803 to interact with the server 805 through the network 804 to receive or send messages, etc.
  • Various communication client applications can be installed on the terminal devices 801, 802, and 803, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only examples).
  • the terminal devices 801, 802, and 803 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and so on.
  • the server 805 may be a server that provides various services, such as a backend management server that provides support for shopping websites browsed by users using the terminal devices 801, 802, and 803 (example only).
  • the background management server can analyze and process the received product information query request and other data, and feed back the processing results (such as target push information, product information - only examples) to the terminal device.
  • the method for storing items provided by the embodiments of the present disclosure is generally executed by the server 805.
  • the device for storing items is generally provided in the server 805.
  • FIG. 9 a schematic structural diagram of a computer system 900 suitable for implementing a terminal device according to an embodiment of the present disclosure is shown.
  • the terminal device shown in FIG. 9 is only an example and should not impose any restrictions on the functions and scope of use of the embodiments of the present disclosure.
  • computer system 900 includes a central processing unit (CPU) 901, which Various appropriate actions and processes can be performed based on a program stored in the read-only memory (ROM) 902 or loaded from the storage section 908 into the random access memory (RAM) 903 .
  • ROM read-only memory
  • RAM random access memory
  • various programs and data required for the operation of the system 900 are also stored.
  • the CPU 901, ROM 902, and RAM 903 are connected to each other through a bus 904.
  • An input/output (I/O) interface 905 is also connected to bus 904.
  • the following components are connected to the I/O interface 905: an input section 906 including a keyboard, a mouse, etc.; an output section 907 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., speakers, etc.; and a storage section 908 including a hard disk, etc. ; and a communication section 909 including a network interface card such as a LAN card, a modem, etc.
  • the communication section 909 performs communication processing via a network such as the Internet.
  • Driver 910 is also connected to I/O interface 905 as needed.
  • Removable media 911 such as magnetic disks, optical disks, magneto-optical disks, semiconductor memories, etc., are installed on the drive 910 as needed, so that a computer program read therefrom is installed into the storage portion 908 as needed.
  • embodiments of the present disclosure include a computer program product including a computer program carried on a computer-readable medium, the computer program containing program code for performing the method illustrated in the flowchart.
  • the computer program may be downloaded and installed from the network via communication portion 909 and/or installed from removable media 911 .
  • the central processing unit (CPU) 901 the above-described functions defined in the system of the present disclosure are performed.
  • the computer-readable medium shown in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two.
  • the computer-readable storage medium may be, for example, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or any combination thereof. More specific examples of computer readable storage media may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard drive, random access memory (RAM), read only memory (ROM), removable Programmd read-only memory (EPROM or flash memory), fiber optics, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above.
  • a computer-readable storage medium may be any tangible medium that contains or stores a program that can be executed by instructions Use by or in connection with a system, apparatus or device.
  • a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code therein. Such propagated data signals may take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above.
  • a computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device .
  • Program code embodied on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the foregoing.
  • each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more logic functions that implement the specified executable instructions.
  • the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown one after another may actually execute substantially in parallel, or they may sometimes execute in the reverse order, depending on the functionality involved.
  • each block in the block diagram or flowchart illustration, and combinations of blocks in the block diagram or flowchart illustration can be implemented by special purpose hardware-based systems that perform the specified functions or operations, or may be implemented by special purpose hardware-based systems that perform the specified functions or operations. Achieved by a combination of specialized hardware and computer instructions.
  • the modules involved in the embodiments of the present disclosure can be implemented in software or hardware.
  • the described module can also be provided in a processor.
  • a processor includes a container module, a positioning module and a storage module.
  • the names of these modules do not constitute a limitation on the module itself under certain circumstances.
  • the container module can also be described as "used to learn the number of storage units occupied by the items based on the projected area of the items, so The storage unit is the smallest storage location in the warehouse.”
  • the present disclosure also provides a computer-readable medium.
  • the computer-readable medium may be included in the device described in the above embodiments; it may also exist separately without being assembled into the device.
  • the computer-readable medium carries one or more programs. When the one or more programs are executed by a device, the device causes the device to include:
  • the number of storage units occupied by the items is known, and the storage units are the minimum storage locations in the warehouse;
  • the storage unit is the smallest storage location in the warehouse; in the free storage unit of the warehouse, based on the The projected area and the number of occupied storage units, locating the storage location of the item in the warehouse; storing the item in the storage location of the item, and updating the storage location of the item involve the storage unit state.
  • the storage location of the items is located, thereby reducing the distance between items and thereby increasing the storage density of the warehouse.

Landscapes

  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Engineering & Computer Science (AREA)
  • Marketing (AREA)
  • Quality & Reliability (AREA)
  • Finance (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Accounting & Taxation (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)

Abstract

本公开提供了存储物品的方法、装置、设备和计算机可读介质，涉及计算机技术领域。该方法的一具体实施方式包括：依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位；在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。该实施方式能够以实际物品定位储位，提高仓库存储密度。

Description

存储物品的方法、装置、设备和计算机可读介质
相关申请的交叉引用
本申请要求享有2022年5月26日提交的公开名称为“存储物品的方法、装置、设备和计算机可读介质”的中国专利申请202210579525.X的优先权，在此全文引用上述中国专利申请公开的内容以作为本申请的一部分或全部。
技术领域
本公开涉及计算机技术领域，尤其涉及一种存储物品的方法、装置、设备和计算机可读介质。
背景技术
立体库是仓库中的一种密集存储设备。随着立体库密集存储的应用的普及，对立体库的存储又有了新的要求。立体库中的储位是固定的，即每个储位放一个物品，物品的大小和储位的大小是一一匹配的，如图1所示。
在实现本公开过程中，发明人发现现有技术中至少存在如下问题：在某些场景中，需要存储不同规格的物品或者原包装存放时，如果按照之前固定储位的方案，需要以最大容器分割储位，会存在较大的空间浪费，导致降低存储密度。
发明内容
有鉴于此，本公开实施例提供一种存储物品的方法、装置、设备和计算机可读介质，能够以实际容器定位储位，提高存储密度。
为实现上述目的，根据本公开实施例的一个方面，提供了一种存储物品的方法，包括：
依据物品的投影面积，获知所述物品占用存储单元的数量，所述 存储单元是仓库中的最小储位；
在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；
将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。
所述依据物品的投影面积，获知所述物品占用存储单元的数量，包括：
依据所述物品的投影面积涉及的物品宽度和所述存储单元的宽度，确定所述述物品占用存储单元的数量。
所述在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位，包括：
在所述仓库的空闲存储单元中，基于所述物品的投影面积涉及的物品宽度和所述占用存储单元的数量，以所述存储单元的宽度为步长，定位所述物品的储位。
所述在仓库的空闲存储单元中，基于所述物品的投影面积涉及的物品宽度和所述占用存储单元的数量，以所述存储单元的宽度为步长，定位所述物品的储位，包括：
在所述仓库的存储单元中，获知空闲存储单元和已占用存储单元；
按照所述物品的投影面积涉及的物品宽度和所述占用存储单元的数量，以所述存储单元的宽度为步长，在所述空闲存储单元中确定物品的候选储位；
基于所述候选储位与所述已占用存储单元之间空闲存储单元的最小数量，在所述候选储位中定位所述物品的储位。
所述物品承载于物品容器中，所述物品的投影面积包括所述物品容器的投影面积。
所述将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态，包括：
将所述物品的储位涉及的存储单元，标识为占用存储单元，以将所述物品存储至所述物品的储位。
所述方法还包括：
所述物品已移出所述物品的储位，将所述物品的储位涉及的存储单元，标识为空闲存储单元，以释放所述物品占用的储位。
根据本公开实施例的第二方面，提供了一种存储物品的装置，包括：
容器模块，用于依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位；
定位模块，用于在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；
存储模块，用于将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。
根据本公开实施例的第三方面，提供了一种存储物品的电子设备，包括：
一个或多个处理器；
存储装置，用于存储一个或多个程序，
当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如上述的方法。
根据本公开实施例的第四方面，提供了一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现如上述的方法。
上述发明中的一个实施例具有如下优点或有益效果：依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库 中的最小储位；在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。基于物品的投影面积，定位物品的储位，进而减少物品的间隔，继而提高仓库存储密度。
上述的非惯用的可选方式所具有的进一步效果将在下文中结合具体实施方式加以说明。
附图说明
附图用于更好地理解本公开，不构成对本公开的不当限定。其中：
图1是根据已有技术的立体库中的储位示意图；
图2是根据已有技术的立体库中另一个储位示意图；
图3是根据本公开实施例的存储物品的方法的主要流程示意图；
图4是根据本公开实施例的定位物品的储位的流程示意图；
图5是根据本公开实施例的物品的候选储位的示意图；
图6是根据本公开实施例的立体库中存储物品的示意图；
图7是根据本公开实施例的存储物品的装置的主要结构示意图；
图8是本公开实施例可以应用于其中的示例性系统架构图；
图9是适于用来实现本公开实施例的终端设备或服务器的计算机系统的结构示意图。
具体实施方式
以下结合附图对本公开的示范性实施例做出说明，其中包括本公开实施例的各种细节以助于理解，应当将它们认为仅仅是示范性的。因此，本领域普通技术人员应当认识到，可以对这里描述的实施例做出各种改变和修改，而不会背离本公开的范围和精神。同样，为了清楚和简明，以下的描述中省略了对公知功能和结构的描述。
参见图1，图1是根据已有技术的立体库中的储位示意图。图1中 包括左右两侧，2层储位，分别以A、B、C和D标出。其中，在储位C1存储有物品2；在储位D1存储有物品1；在储位D2存储有物品3。物品1、物品2和物品3的投影面积相同。
参见图2，图2是根据已有技术的立体库中另一个储位示意图。图2中物品1、物品2和物品3的投影米阿尼不同，但由于每个储位的体投影面积无法调节，因此物品1、物品2和物品3所占储位的大小相同。
也就是说，需要存储不同规格的物品或者原包装存放时，如果按照之前固定储位的方案，需要以最大物品分割储位，会存在较大的空间浪费，导致降低存储密度。
为了解决存储密度降低的技术问题，可以采用以下本公开实施例中的技术方案。
参见图3，图3是根据本公开实施例的存储物品的方法主要流程示意图，按照物品的投影面积定位储位，以提高存储密度。如图3所示，具体包括以下步骤：
S301、依据物品的投影面积，获知物品占用存储单元的数量，存储单元是仓库中的最小储位。
立体库中包括多层，每层有包括多个储位。物品可以存储在储位中。在本公开实施例中，物品容器中承载物品。也就是说，物品承载于物品容器中，物品的投影面积包括物品容器的投影面积。
需要说明的是，物品容器包括物品原包装。作为一个示例，物品容器具体包括十包卷纸。即，物品容器是十包卷纸的物品原包装。
对于物品容器来说，具备固定投影面积，以承载物品。作为一个示例，物品容器的投影面积是0.5平米，以承载多件服装。作为另一个示例，物品容器的投影面积0.2平米，以承载多本书籍。
在本公开实施例中，以存储单元作为衡量物品的基本单位。存储单元是是仓库中的最小储位。作为一个示例，基于仓库的实际情况， 预设存储单元的宽度。
下面介绍说明存储单元(baseCell)。存储单元是标识储位的最小粒度。通过存储单元能够标记物品的储位。通过公式1、公式2和公式3，标识存储单元。
＜nogrid,nocell,indexi,indexj,noctn,status＞                 公式1

其中，nogrid为格口号，表示该存储单元对应的储位组编号；nocell为存储单元编号；indexi为存储单元长度方向的编号，indexj为存储单元宽度方向的编号。indexi和indexj描述存储单元的位置关系，相邻的两个存储单元的上述两个编号是连续的。noctn为占用该存储单元的物品编号，当存储单元空闲时，该字段为空；status为存储单元的状态，占用时status＝1，空闲时status＝0。
公式2表示i的取值范围，即i的最大值为格口长度lengthgrid除以容器储位横向间隔lengthinr向下取整。
公式3表示j的取值范围，即j的最大值为格口宽度widthgrid除以容器库存的深度间隔widthinr向下取整。
存储单元涉及格口，下面示例性说明格口。格口与储物组(cellGroup)具有对应关系。储位组是格口的逻辑抽象。所有储位组构成立体库的整个库存。储位组的数据结构如下：
＜notunnel,notier,nogrid,lengthgrid,widthgrid,highgrid＞          公式4
其中，notunnel为巷道编号，notier为层级编号，nogrid为格口编号，lengthgrid为格口的长度，widthgrid为格口的宽度，即格口的深度，highgrid为格口的高度。
在立体库中，储位组成的货架设置于巷道中。货架包括多层。每层货架中包括多个依次排列的格口。其中，格口的高度即货架上层与下层的间隔。
公式2中容器储位横向间隔lengthinr，以及公式4容器库存的深度间隔widthinr，均属于容器储位间隔。由于立体库中取放容器是由穿梭 车或者堆垛机等设备执行的，穿梭车和堆垛机的叉子会有一定的宽度，因此容器存放时需要有一定的间隔，上述间隔称为容器储位间隔。穿梭车和堆垛机是在立体库中执行存取物品的设备。
在本公开的一个实施例中，考虑到需要针对不同物品定位储位。进而，需要针对物品的投影面积，获知物品所占用存储单元的数量。物品的投影面积涉及物品宽度和物品长度。考虑到货架在存储物品时，多考核物品宽度，对于物品长度，货架深度能够满足。因此，在确定物品占用存储单元的数量时，涉及物品宽度和存储单元的宽度。即，依据物品的投影面积涉及的物品宽度和存储单元的宽度，确定述物品占用存储单元的数量。
物品的投影面积涉及物品宽度，存储单元也具有宽度。需要以存储单元衡量物品。
在物品是规则形状的情况下，可以预先从外包装或通过测量的方式确定物品的投影面积。在物品是非规则形状的情况下，可以通过物品的最小外接图形，确定物品的投影面积。
作为一个示例，物品的投影面积涉及的宽度为：0.5米。存储单元的宽度为：0.2米。可知，物品占用存储单元的数量是3个。
通过存储单元衡量物品，进而为定位物品的储位奠定基础。
S302、在仓库的空闲存储单元中，基于物品的投影面积和占用存储单元的数量，在仓库中定位物品的储位。
存储单元具有两种状态，分别为空闲状态和占用状态。即，存储单元包括空闲存储单元和占用存储单元。对于占用存储单元来说，由于已经被其他物品占用，因此在存储物品的情况下，则无需考虑占用存储单元。对于空闲存储单元来说，由于未被其他物品占用，在存储物品的情况下，空闲存储单元作为存储物品的对象。
具体来说，基于物品的投影面积和占用存储单元的数量，定位物品的储位。可以理解的是，存储单元是仓库中存储物品的最小单元。为了减少物品之间的间隔，以存储单元的宽度为步长，定位物品的储 位。即，在仓库的空闲存储单元中，基于物品的投影面积涉及的物品宽度和占用存储单元的数量，以存储单元的宽度为步长，定位物品的储位。
以存储单元的宽度为步长，定位物品的储位，能够最大程度的减少物品的间隔。其中，存储单元的宽度可以按照实际仓库预设。
参见图4，图4是根据本公开实施例的定位物品的储位的流程示意图。具体包括以下步骤：
S401、在仓库的存储单元中，获知空闲存储单元和已占用存储单元。
在仓库的存储单元中，基于存储单元的状态获知空闲存储单元和已占用存储单元。已占用存储单元是已被物品占用的存储单元。空闲存储单元是未被物品占用的存储单元。
S402、按照物品的投影面积涉及的物品宽度和占用存储单元的数量，以存储单元的宽度为步长，在空闲存储单元中确定物品的候选储位。
对于物品来说，需要从物品的投影面积涉及的物品宽度和占用存储单元的数量，两方面确定候选储位。物品的投影面积涉及的物品宽度是从物品的角度标识占用存储单元；占用存储单元的数量是从数量的角度标识占用存储单元。
参见图5，图5是根据本公开实施例的物品的候选储位的示意图。图5的仓库中已存储物品1和物品2。存储单元的宽度为0.1米。
物品1的投影面积涉及的物品宽度为：宽度：1米，占用10个存储单元。
物品2的投影面积涉及的物品宽度为：0.5米，占用5个存储单元。
物品3需要放置于仓库中。物品3的投影面积涉及的物品宽度：0.5米，占用5个存储单元。
对于物品3来说，以存储单元为步长，确定物品的候选储位。物品3的候选储位包括候选储位1、候选储位2、候选储位3和候选储位 4。
需要说明的是，按照存储单元的宽度为步长，确定候选储位。可知，候选储位1与候选储位2间隔一个存储单元；候选储位2与候选储位3间隔一个存储单元；候选储位3和候选储位4间隔一个存储单元等。
S403、基于候选储位与已占用存储单元之间空闲存储单元的最小数量，在候选储位中定位物品的储位。
多个候选储位的情况下，为了缩短物品的间隔，可以基于候选储位与已占用存储单元之间空闲存储单元的最小数量，在候选储位中定位物品的储位。候选储位仅有一个的情况，则可以直接将该候选储位作为物品的储位。
继续参见图5，物品3有多个候选储位，则基于候选储位与已占用存储单元之间空闲存储单元的最小数量，在候选储位中定位物品的储位。候选储位1与物品2最右侧存储单元的间隔为0个空闲存储单元；候选储位2与物品2最右侧存储单元的间隔为，候选储位1对应数量的空闲存储单元；候选储位3与物品2最右侧存储单元的间隔为，候选储位1和候选储位2对应数量的空闲存储单元；候选储位4与物品2最右侧存储单元的间隔为，候选储位1、候选储位2和候选储位3对应数量的空闲存储单元。由于候选储位1与已占用存储单元之间空闲存储单元的最小数量为0，将候选储位1定位为物品3的储位。
在图4的实施例中，以存储单元的宽度为步长，确定物品的候选储位。与固定储位存储物品来说，大大缩短物品的间隔。
参见图6，图6是根据本公开实施例的立体库中存储物品的示意图。图6中一个巷道包括两个货架，每个货架均是两层。采用本公开实施例中的方案，按照物品的投影面积确定储位。由于物品的投影面积不同，因此每个物品的储位也是不同的。图6中物品1与物品3的间隔较小，与图2相比来说，能够大大缩短物品的间隔。
S303、将物品存储至物品的储位中，并更新物品的储位涉及存储 单元的状态。
在定位物品的储位之后，就可以将物品储至物品的储位中，并更新物品的储位涉及存储单元的状态，即将物品的储位涉及存储单元的状态，由空闲存储单元更新为占用存储单元。
在本公开实施例中，以容器模型实现存储物品。具体包括以下内容：
物品模型(ctnModel)的定义，具体参见公式4：
＜typectn,lengthctn,widthctn,highctn＞                 公式5
其中，typectn为物品的类型，lengthctn为物品的长度，widthctn为物品的宽度，highctn为物品的高度。物品容器的类型包括原包装和非原包装。
物品的储位(ctnStock)，是容器库存的抽象。每个物品都对应自己的物品储位集合。物品的储位的定义如下述公式所示：



0＜x≤lengthctn/lengthinr                          公式10
0＜y≤widthctn/widthinr                          公式11
其中，nogrid为格口编号，typectn为物品的类型，为物品的储位编号，为物的品储位对应的存储单元的集合。
在本公开的一个实施例中，将物品存储至物品的储位。可以利用穿梭车或推垛机，将物品搬运并存储至物品的储位。对于物品的储位涉及的存储单元，则需要标识为占用存储单元，以将物品存储至物品的储位。这样，再存储物品的情况下，在空闲存储单元中定位储位，无需考虑占用存储单元。
具体来说，采用公式5至公式12作为实现本公开实施例的模型。
首先，定位候选储位：
将入参输入上述模型中，得到模型的出参。
入参：物品的类型typectn。
出参：候选储位列表ctnStockList。
返回结果满足如下条件：
1、物品的类型为typectn。2、候选储位列表中的存储单元，均是空闲存储单元。
其次，占用物品的储位。
入参：物品的编号noctn，物品的储位对应的空闲存储单元的集合cellListmn。
出参：true，false。
其中，查baseCellList中对应的baseCell的存储单元状态是否为0，物品的编码是否为空，如果不满足，则直接返回false。如果满足，根据cellListmn占用baseCellLiSt中对应的baseCell，并将对应的baseCell.noctn设置成noctn，状态baseCell.status设置成1，返回true。
在本公开的一个实施例中，物品已移出物品的储位后，则需要释放该储位。具体地，物品已移出物品的储位，将物品的储位涉及的存储单元，标识为空闲存储单元，以释放物品占用的储位。这样，便于在存储物品的情况下，使用上述释放后的空闲存储单元作为储位。
在具体实现时，
入参：物品的编号noctn。
出参：true，false。
其中，在baseCellList中查询物品的编号为noctn对应的baseCell集合cellListmn；如果cellListmn不存在，则返回false；否则，将cellListmn中的元素的编号设置为空，将状态设置为0，返回true。
在上述实施例中，依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位；在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。基于物品的投影面积，定位物品的储位，进而减少物品的间隔，继而提高仓库存储密度。
参见图7，图7是根据本公开实施例的存储物品的装置的主要结构示意图，存储物品的装置可以实现存储物品的方法，如图7所示，存储物品的装置具体包括：
容器模块701，用于依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位；
定位模块702，用于在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；
存储模块703，将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。
在本公开的一个实施例中，容器模块701，具体用于依据所述物品的投影面积涉及的物品宽度和所述存储单元的宽度，确定所述述物品占用存储单元的数量。
在本公开的一个实施例中，定位模块702，具体用于在所述仓库的空闲存储单元中，基于所述物品的投影面积涉及的物品宽度和所述占用存储单元的数量，以所述存储单元的宽度为步长，定位所述物品的储位。
在本公开的一个实施例中，定位模块702，具体用于在所述仓库的存储单元中，获知空闲存储单元和已占用存储单元；
按照所述物品的投影面积涉及的物品宽度和所述占用存储单元的数量，以所述存储单元的宽度为步长，在所述空闲存储单元中确定物品的候选储位；
基于所述候选储位与所述已占用存储单元之间空闲存储单元的最小数量，在所述候选储位中定位所述物品的储位。
在本公开的一个实施例中，所述物品承载于物品容器中，所述物品的投影面积包括所述物品容器的投影面积。
存储模块703，具体用于将所述物品的储位涉及的存储单元，标识为占用存储单元，以将所述物品存储至所述物品的储位。
在本公开的一个实施例中，存储模块703，还用于所述物品已移出 所述物品的储位，将所述物品的储位涉及的存储单元，标识为空闲存储单元，以释放所述物品占用的储位。
图8示出了可以应用本公开实施例的存储物品的方法或存储物品的装置的示例性系统架构800。
如图8所示，系统架构800可以包括终端设备801、802、803，网络804和服务器805。网络804用以在终端设备801、802、803和服务器805之间提供通信链路的介质。网络804可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
用户可以使用终端设备801、802、803通过网络804与服务器805交互，以接收或发送消息等。终端设备801、802、803上可以安装有各种通讯客户端应用，例如购物类应用、网页浏览器应用、搜索类应用、即时通信工具、邮箱客户端、社交平台软件等(仅为示例)。
终端设备801、802、803可以是具有显示屏并且支持网页浏览的各种电子设备，包括但不限于智能手机、平板电脑、膝上型便携计算机和台式计算机等等。
服务器805可以是提供各种服务的服务器，例如对用户利用终端设备801、802、803所浏览的购物类网站提供支持的后台管理服务器(仅为示例)。后台管理服务器可以对接收到的产品信息查询请求等数据进行分析等处理，并将处理结果(例如目标推送信息、产品信息--仅为示例)反馈给终端设备。
需要说明的是，本公开实施例所提供的存储物品的方法一般由服务器805执行，相应地，存储物品的装置一般设置于服务器805中。
应该理解，图8中的终端设备、网络和服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的终端设备、网络和服务器。
下面参考图9，其示出了适于用来实现本公开实施例的终端设备的计算机系统900的结构示意图。图9示出的终端设备仅仅是一个示例，不应对本公开实施例的功能和使用范围带来任何限制。
如图9所示，计算机系统900包括中央处理单元(CPU)901，其 可以根据存储在只读存储器(ROM)902中的程序或者从存储部分908加载到随机访问存储器(RAM)903中的程序而执行各种适当的动作和处理。在RAM 903中，还存储有系统900操作所需的各种程序和数据。CPU 901、ROM 902以及RAM 903通过总线904彼此相连。输入/输出(I/O)接口905也连接至总线904。
以下部件连接至I/O接口905：包括键盘、鼠标等的输入部分906；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分907；包括硬盘等的存储部分908；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分909。通信部分909经由诸如因特网的网络执行通信处理。驱动器910也根据需要连接至I/O接口905。可拆卸介质911，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器910上，以便于从其上读出的计算机程序根据需要被安装入存储部分908。
特别地，根据本公开的实施例，上文参考流程图描述的过程可以被实现为计算机软件程序。例如，本公开的实施例包括一种计算机程序产品，其包括承载在计算机可读介质上的计算机程序，该计算机程序包含用于执行流程图所示的方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分909从网络上被下载和安装，和/或从可拆卸介质911被安装。在该计算机程序被中央处理单元(CPU)901执行时，执行本公开的系统中限定的上述功能。
需要说明的是，本公开所示的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本公开中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行 系统、装置或者器件使用或者与其结合使用。而在本公开中，计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、RF等等，或者上述的任意合适的组合。
附图中的流程图和框图，图示了按照本公开各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码的一部分，上述模块、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图或流程图中的每个方框、以及框图或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本公开实施例中所涉及到的模块可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的模块也可以设置在处理器中，例如，可以描述为：一种处理器包括容器模块、定位模块和存储模块。其中，这些模块的名称在某种情况下并不构成对该模块本身的限定，例如，容器模块还可以被描述为“用于依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位”。
作为另一方面，本公开还提供了一种计算机可读介质，该计算机可读介质可以是上述实施例中描述的设备中所包含的；也可以是单独存在，而未装配入该设备中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被一个该设备执行时，使得该设备 包括：
依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位；
在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；
将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。
根据本公开实施例的技术方案，依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位；在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。基于物品的投影面积，定位物品的储位，进而减少物品的间隔，继而提高仓库存储密度。
上述具体实施方式，并不构成对本公开保护范围的限制。本领域技术人员应该明白的是，取决于设计要求和其他因素，可以发生各种各样的修改、组合、子组合和替代。任何在本公开的精神和原则之内所作的修改、等同替换和改进等，均应包含在本公开保护范围之内。

Claims (10)

  1. 一种存储物品的方法，包括：
    依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位；
    在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；
    将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。
  2. 根据权利要求1所述存储物品的方法，其中，所述依据物品的投影面积，获知所述物品占用存储单元的数量，包括：
    依据所述物品的投影面积涉及的物品宽度和所述存储单元的宽度，确定所述述物品占用存储单元的数量。
  3. 根据权利要求1所述存储物品的方法，其中，所述在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位，包括：
    在所述仓库的空闲存储单元中，基于所述物品的投影面积涉及的物品宽度和所述占用存储单元的数量，以所述存储单元的宽度为步长，定位所述物品的储位。
  4. 根据权利要求3所述存储物品的方法，其中，所述在仓库的空闲存储单元中，基于所述物品的投影面积涉及的物品宽度和所述占用存储单元的数量，以所述存储单元的宽度为步长，定位所述物品的储位，包括：
    在所述仓库的存储单元中，获知空闲存储单元和已占用存储单元；
    按照所述物品的投影面积涉及的物品宽度和所述占用存储单元的数量，以所述存储单元的宽度为步长，在所述空闲存储单元中确定物 品的候选储位；
    基于所述候选储位与所述已占用存储单元之间空闲存储单元的最小数量，在所述候选储位中定位所述物品的储位。
  5. 根据权利要求1所述存储物品的方法，其中，所述物品承载于物品容器中，所述物品的投影面积包括所述物品容器的投影面积。
  6. 根据权利要求1所述存储物品的方法，其中，所述将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态，包括：
    将所述物品的储位涉及的存储单元，标识为占用存储单元，以将所述物品存储至所述物品的储位。
  7. 根据权利要求1所述存储物品的方法，其中，所述方法还包括：
    所述物品已移出所述物品的储位，将所述物品的储位涉及的存储单元，标识为空闲存储单元，以释放所述物品占用的储位。
  8. 一种存储物品的装置，包括：
    容器模块，用于依据物品的投影面积，获知所述物品占用存储单元的数量，所述存储单元是仓库中的最小储位；
    定位模块，用于在仓库的空闲存储单元中，基于所述物品的投影面积和所述占用存储单元的数量，在所述仓库中定位所述物品的储位；
    存储模块，用于将所述物品存储至所述物品的储位中，并更新所述物品的储位涉及存储单元的状态。
  9. 一种存储物品的电子设备，包括：
    一个或多个处理器；
    存储装置，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如权利要求1-7中任一所述的方法。
  10. 一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现如权利要求1-7中任一所述的方法。
PCT/CN2023/073810 2022-05-26 2023-01-30 存储物品的方法、装置、设备和计算机可读介质 WO2023226465A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210579525.X 2022-05-26
CN202210579525.XA CN114819854A (zh) 2022-05-26 2022-05-26 存储物品的方法、装置、设备和计算机可读介质

Publications (1)

Publication Number Publication Date
WO2023226465A1 true WO2023226465A1 (zh) 2023-11-30

Family

ID=82517260

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/073810 WO2023226465A1 (zh) 2022-05-26 2023-01-30 存储物品的方法、装置、设备和计算机可读介质

Country Status (2)

Country Link
CN (1) CN114819854A (zh)
WO (1) WO2023226465A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114819854A (zh) * 2022-05-26 2022-07-29 北京京东乾石科技有限公司 存储物品的方法、装置、设备和计算机可读介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110120132A (zh) * 2018-02-07 2019-08-13 长沙行深智能科技有限公司 用于空间可变柜的基于单目测量物品体积识别空间的分配方法
CN110525855A (zh) * 2019-08-19 2019-12-03 北京三快在线科技有限公司 一种货物仓储的方法及装置
CN112085424A (zh) * 2019-06-14 2020-12-15 北京京东振世信息技术有限公司 存储物品的方法、装置、设备和计算机可读介质
CN114819854A (zh) * 2022-05-26 2022-07-29 北京京东乾石科技有限公司 存储物品的方法、装置、设备和计算机可读介质

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111199614B (zh) * 2018-11-16 2022-11-08 北京京东振世信息技术有限公司 一种存储物品的方法和装置
CN112633788A (zh) * 2019-10-09 2021-04-09 北京京东振世信息技术有限公司 确定入库储位的方法、装置、电子设备和存储介质
CN113762875A (zh) * 2021-03-11 2021-12-07 北京京东乾石科技有限公司 物品入库方法、装置以及存储介质

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110120132A (zh) * 2018-02-07 2019-08-13 长沙行深智能科技有限公司 用于空间可变柜的基于单目测量物品体积识别空间的分配方法
CN112085424A (zh) * 2019-06-14 2020-12-15 北京京东振世信息技术有限公司 存储物品的方法、装置、设备和计算机可读介质
CN110525855A (zh) * 2019-08-19 2019-12-03 北京三快在线科技有限公司 一种货物仓储的方法及装置
CN114819854A (zh) * 2022-05-26 2022-07-29 北京京东乾石科技有限公司 存储物品的方法、装置、设备和计算机可读介质

Also Published As

Publication number Publication date
CN114819854A (zh) 2022-07-29

Similar Documents

Publication Publication Date Title
WO2021068645A1 (zh) 确定入库储位的方法、装置、电子设备和存储介质
WO2023226465A1 (zh) 存储物品的方法、装置、设备和计算机可读介质
CN110348771A (zh) 一种对订单进行组单的方法和装置
CN110069579A (zh) 电子围栏分块方法和装置
CN106570097A (zh) 序列生成方法及装置
CN109388654A (zh) 一种查询数据表的方法和装置
CN110304385A (zh) 一种仓库上架方法和装置
CN111932163A (zh) 一种多进深仓库出库定位的方法和装置
CN110334145A (zh) 数据处理的方法和装置
CN104408183B (zh) 数据系统的数据导入方法和装置
CN113554394A (zh) 档案存放方法、装置、电子设备和存储介质
CN112597126A (zh) 一种数据迁移方法和装置
CN109343962A (zh) 数据处理方法、装置及分布式服务系统
CN111517060B (zh) 一种基于双侧出入站台口的调度方法和装置
CN110834858B (zh) 一种在仓库中存储货物的方法和装置
CN112783887A (zh) 一种基于数据仓库的数据处理方法及装置
CN110110184B (zh) 信息查询方法、系统、计算机系统及存储介质
CN109299197A (zh) 一种数据立方体的分区方法、系统及终端设备
CN111428536B (zh) 用于检测物品类别和位置的检测网络的训练方法和装置
CN110298371A (zh) 数据聚类的方法和装置
CN110378835A (zh) 一种码垛方法和装置
CN113327284B (zh) 图像识别方法、装置、电子设备和存储介质
CN115390958A (zh) 一种任务处理方法和装置
CN112907162B (zh) 确定物品摆放方式的方法和装置
CN112256566B (zh) 一种测试案例的保鲜方法和装置

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: 23810541

Country of ref document: EP

Kind code of ref document: A1