CN115345447A - Task management method, electronic device and storage medium - Google Patents
Task management method, electronic device and storage medium Download PDFInfo
- Publication number
- CN115345447A CN115345447A CN202210889808.4A CN202210889808A CN115345447A CN 115345447 A CN115345447 A CN 115345447A CN 202210889808 A CN202210889808 A CN 202210889808A CN 115345447 A CN115345447 A CN 115345447A
- Authority
- CN
- China
- Prior art keywords
- target
- task
- roadway
- storage
- lane
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
Images
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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
-
- 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
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
Abstract
Description
技术领域technical field
本申请涉及物流领域,具体涉及任务管理方法、电子设备及存储介质。The application relates to the field of logistics, and specifically relates to a task management method, electronic equipment and a storage medium.
背景技术Background technique
管理仓库例如密集存储仓库中的巷道的任务是仓库的管理的关键环节。在管理相应的巷道的任务期间,需要避免出现常见的阻碍任务的执行的情况,例如,如果巷道的一个入库任务或移库任务的容器在该巷道的一个出库任务的容器离开该巷道之前进入该巷道,则将会导致该出库任务的容器被该入库任务或移库任务的容器阻挡,导致该出库任务的容器无法离开巷道。例如,对于从巷道的同一个巷道口进入该巷道的两个入库任务,如果第一入库任务的容器进入目标巷道的时间早于第二入库任务的容器进入该巷道的时间,而该第一入库任务对应的储位又位于该第二入库任务对应的储位的阻碍位置上,导致在第二入库任务的容器进入该巷道之后,该第二入库任务的容器被该第一入库任务的容器阻挡,该第二入库任务的容器无法被放置到该第二入库任务对应的储位上,该第二入库任务无法完成。The task of managing the aisles in a warehouse such as a dense storage warehouse is a key aspect of the management of the warehouse. During the task of managing the corresponding aisle, it is necessary to avoid common situations that hinder the execution of the task, for example, if the container of an inbound task or a transfer task of the aisle leaves the aisle before the container of an outbound task of the aisle leaves the aisle Entering the aisle will cause the container of the outbound task to be blocked by the container of the inbound task or the warehouse transfer task, so that the container of the outbound task cannot leave the aisle. For example, for two warehousing tasks entering the aisle from the same aisle entrance of the aisle, if the container of the first warehousing task enters the target aisle earlier than the container of the second warehousing task enters the aisle, and the The storage position corresponding to the first warehousing task is located in the obstructed position of the storage position corresponding to the second warehousing task, so that after the container of the second warehousing task enters the lane, the container of the second warehousing task is blocked by the The container of the first storage task is blocked, the container of the second storage task cannot be placed on the storage position corresponding to the second storage task, and the second storage task cannot be completed.
发明内容Contents of the invention
为克服相关技术中存在的问题,本申请提供一种任务管理方法、电子设备及存储介质。In order to overcome the problems existing in the related technologies, the present application provides a task management method, electronic equipment and a storage medium.
本申请实施例提供一种任务管理方法,包括:An embodiment of the present application provides a task management method, including:
从目标巷道的储位集合中确定出所述目标巷道的多个任务中的每一个目标任务对应的储位,所述目标任务为入库任务或移库任务;Determining the storage location corresponding to each target task in the multiple tasks of the target roadway from the storage location set of the target roadway, and the target task is a storage task or a storage transfer task;
基于所述每一个目标任务对应的储位的位置和所述多个任务中的任务的容器当前所处的位置,控制所述每一个目标任务的执行过程。The execution process of each target task is controlled based on the position of the storage position corresponding to each target task and the current position of the container of the task in the plurality of tasks.
本申请实施例提供一种电子设备,包括:存储器、处理器及存储在存储器上的计算机程序,该处理器执行该计算机程序以实现上述任务管理方法。An embodiment of the present application provides an electronic device, including: a memory, a processor, and a computer program stored on the memory, and the processor executes the computer program to implement the above task management method.
本申请实施例提供一种计算机可读存储介质,其上存储有计算机程序/指令,该计算机程序/指令被处理器执行时实现上述任务管理方法。An embodiment of the present application provides a computer-readable storage medium on which a computer program/instruction is stored, and when the computer program/instruction is executed by a processor, the foregoing task management method is implemented.
本申请实施例提供一种计算机程序产品,包括计算机程序/指令,该计算机程序/指令被处理器执行时实现上述任务管理方法。An embodiment of the present application provides a computer program product, including a computer program/instruction, and when the computer program/instruction is executed by a processor, the foregoing task management method is implemented.
本申请实施例提供的任务管理方法,从目标巷道的储位集合中确定出目标巷道的多个任务中的每一个目标任务对应的储位;基于每一个目标任务对应的储位的位置和多个任务中的任务的容器当前所处的位置,控制每一个目标任务的执行过程,避免阻碍任务的执行的情况。对于目标巷道的多个任务中的任意一个目标任务,一旦下发该目标任务,即可立即执行该目标任务,该目标任务无需在多个任务中的其他目标任务进入目标巷道后执行,该目标任务也无需多个任务中的出库任务离开目标巷道后执行,作业效率较高。The task management method provided in the embodiment of the present application determines the storage location corresponding to each target task in the multiple tasks of the target roadway from the storage location set of the target roadway; The current position of the container of the task in each task, control the execution process of each target task, and avoid the situation that hinders the execution of the task. For any target task in the multiple tasks of the target lane, once the target task is issued, the target task can be executed immediately, and the target task does not need to be executed after other target tasks in the multiple tasks enter the target lane. The task does not need to be executed after the outbound task among multiple tasks leaves the target lane, so the operation efficiency is high.
附图说明Description of drawings
此处的附图被并入说明书中并构成本说明书的一部分,示出了符合本申请的实施例,并与说明书一起用于解释本申请的原理。The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description serve to explain the principles of the application.
图1示出了本申请实施例提供的任务管理方法的流程图;FIG. 1 shows a flowchart of a task management method provided by an embodiment of the present application;
图2示出了本申请实施例提供的任务管理装置的结构框图。Fig. 2 shows a structural block diagram of a task management device provided by an embodiment of the present application.
具体实施方式Detailed ways
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是,此处所描述的具体实施例仅仅用于解释相关发明,而非对该发明的限定。另外还需要说明的是,为了便于描述,附图中仅示出了与有关发明相关的部分。The application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain related inventions, rather than to limit the invention. It should also be noted that, for the convenience of description, only the parts related to the related invention are shown in the drawings.
需要说明的是,在不冲突的情况下,本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本申请。It should be noted that, in the case of no conflict, the embodiments in the present application and the features in the embodiments can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and embodiments.
随着物联网、人工智能、大数据等智能化技术的发展,利用这些智能化技术对传统物流业进行转型升级的需求愈加强劲,智慧物流(Intelligent Logistics System)成为物流领域的研究热点。智慧物流利用人工智能、大数据以及各种信息传感器、射频识别技术、全球定位系统(GPS)等物联网装置和技术,广泛应用于物料的运输、仓储、配送、包装、装卸和信息服务等基本活动环节,实现物料管理过程的智能化分析决策、自动化运作和高效率优化管理。物联网技术包括传感设备、RFID技术、激光红外扫描、红外感应识别等,物联网能够将物流中的物料与网络实现有效连接,并可实时监控物料,还可感知仓库的湿度、温度等环境数据,保障物料的储存环境。通过大数据技术可感知、采集物流中所有数据,上传至信息平台数据层,对数据进行过滤、挖掘、分析等作业,最终对业务流程(如运输、入库、存取、拣选、包装、分拣、出库、盘点、配送等环节)提供精准的数据支持。人工智能在物流中的应用方向可以大致分为两种:1)以AI技术赋能的如无人卡车、AGV、AMR、叉车、穿梭车、堆垛机、无人配送车、无人机、服务机器人、机械臂、智能终端等智能设备代替部分人工;2)通过计算机视觉、机器学习、运筹优化等技术或算法驱动的如运输设备管理系统、仓储管理、设备调度系统、订单分配系统等软件系统提高人工效率。随着智慧物流的研究和进步,该项技术在众多领域展开了应用,例如零售及电商、电子产品、烟草、医药、工业制造、鞋服、纺织、食品等领域。With the development of intelligent technologies such as the Internet of Things, artificial intelligence, and big data, the demand for using these intelligent technologies to transform and upgrade the traditional logistics industry has become increasingly strong, and intelligent logistics (Intelligent Logistics System) has become a research hotspot in the field of logistics. Smart logistics uses artificial intelligence, big data, various information sensors, radio frequency identification technology, global positioning system (GPS) and other Internet of Things devices and technologies, and is widely used in basic logistics such as material transportation, warehousing, distribution, packaging, loading and unloading, and information services. The activity link realizes the intelligent analysis and decision-making, automatic operation and high-efficiency optimized management of the material management process. The Internet of Things technology includes sensing equipment, RFID technology, laser infrared scanning, infrared induction recognition, etc. The Internet of Things can effectively connect the materials in the logistics with the network, monitor the materials in real time, and sense the humidity and temperature of the warehouse. Data, guarantee the storage environment of materials. Through big data technology, all the data in the logistics can be sensed and collected, uploaded to the data layer of the information platform, and the data can be filtered, mined, analyzed and other operations, and finally the business process (such as transportation, storage, access, picking, packaging, distribution Picking, delivery, inventory, distribution and other links) to provide accurate data support. The application direction of artificial intelligence in logistics can be roughly divided into two types: 1) Unmanned trucks, AGVs, AMRs, forklifts, shuttles, stackers, unmanned delivery vehicles, unmanned aerial vehicles, Smart devices such as service robots, robotic arms, and smart terminals replace part of the labor force; 2) Software such as transportation equipment management systems, warehouse management, equipment scheduling systems, and order distribution systems driven by computer vision, machine learning, and operational optimization technologies or algorithms The system improves labor efficiency. With the research and progress of smart logistics, this technology has been applied in many fields, such as retail and e-commerce, electronic products, tobacco, medicine, industrial manufacturing, shoes and clothing, textiles, food and other fields.
图1示出了本申请实施例提供的任务管理方法的流程图,该方法包括:Figure 1 shows a flow chart of a task management method provided by an embodiment of the present application, the method including:
步骤101,从目标巷道的储位集合中确定出目标巷道的多个任务中的每一个目标任务对应的储位。
本申请实施例提供的任务管理方法可以应用于仓库例如密集存储仓库,容器可以为托盘、货架等。The task management method provided in the embodiment of the present application can be applied to a warehouse such as a dense storage warehouse, and the container can be a pallet, a shelf, and the like.
目标巷道并不特指某一个巷道,本申请实施例提供的任务管理方法应用于的仓库中的任意一个巷道均可以作为目标巷道。The target lane does not specifically refer to a certain lane, and any lane in the warehouse to which the task management method provided in the embodiment of the present application is applied can be used as the target lane.
在本申请中,对于目标巷道的任意一个任务,该任务可以为以下之一:入库任务、出库任务、移库任务。In this application, for any task of the target lane, the task may be one of the following: storage task, storage task, storage transfer task.
在本申请中,对于目标巷道的任意一个目标任务,该目标任务为目标巷道的一个入库任务或目标巷道的一个移库任务。In this application, for any target task of the target lane, the target task is a storage task of the target lane or a storage transfer task of the target lane.
在本申请中,对于目标巷道的每一个目标任务,该目标任务的容器通过目标巷道的对应于该目标任务的巷道口进入目标巷道。In the present application, for each target task of the target lane, the container of the target task enters the target lane through the lane opening of the target lane corresponding to the target task.
对于目标巷道的每一个出库任务,该出库任务的容器通过目标巷道的对应于该出库任务的巷道口离开目标巷道。For each outbound task of the target aisle, the container of the outbound task leaves the target aisle through the aisle opening of the target aisle corresponding to the outbound task.
若目标巷道具有一个巷道口,目标巷道的每一个任务均对应于目标巷道的一个巷道口,相应的,该巷道口对应于每一个任务。If the target lane has a laneway opening, each task of the target laneway corresponds to a laneway opening of the target laneway, and correspondingly, the laneway opening corresponds to each task.
若目标巷道具有两个巷道口,目标巷道的每一个任务对应于目标巷道的两个巷道口中的一个巷道口。If the target lane has two lane openings, each task of the target lane corresponds to one of the two lane openings of the target lane.
若目标巷道具有两个巷道口,对于目标巷道的任意一个目标任务,当确定对应于该目标任务的巷道口时,可以从两个巷道口中随机选择出对应于该目标任务的巷道口,也可以将两个巷道口中的目标任务数量少的巷道口作为对应于该目标任务的巷道口,巷道口的目标任务数量为对应于该巷道口的目标任务的数量。If the target laneway has two laneway openings, for any target task of the target laneway, when determining the laneway opening corresponding to the target task, the laneway opening corresponding to the target task can be randomly selected from the two laneway mouths, or The tunnel entrance with the smaller number of target tasks among the two tunnel entrances is taken as the tunnel entrance corresponding to the target task, and the number of target tasks at the tunnel entrance is the number of target tasks corresponding to the tunnel entrance.
对于目标巷道的任意一个出库任务,当确定对应于该出库任务对应的巷道口时,可以从两个巷道口中随机选择出对应于该出库任务对应的巷道口,也可以将两个巷道口中的出库任务数量少的巷道作为对应于该出库任务的巷道,巷道口的出库任务数量为对应于该巷道口的出库任务的数量。For any outbound task of the target roadway, when determining the roadway opening corresponding to the outbound task, the roadway entrance corresponding to the outbound task can be randomly selected from the two roadway mouths, or the two roadway The laneway with a small number of outbound tasks in the mouth is the laneway corresponding to the outbound task, and the number of outbound tasks at the entrance of the lane is the number of outbound tasks corresponding to the entrance of the aisle.
在本申请中,对于目标巷道的任意一个任务,可以将在该任务的执行过程中,装载该任务的容器的搬运机器人称之为该任务的搬运机器人。搬运机器人可以为四向穿梭车、自动导引运输车等。In this application, for any task in the target lane, the handling robot that loads the container of the task during the execution of the task may be referred to as the handling robot of the task. The handling robot can be a four-way shuttle vehicle, an automatic guided transport vehicle, and the like.
目标巷道的一个入库任务包括:该入库任务的搬运机器人通过目标巷道对应于该入库任务的巷道口进入目标巷道;该入库任务的搬运机器人将该入库任务的容器放置到该入库任务对应的储位上。A warehousing task of the target aisle includes: the handling robot of the warehousing task enters the target aisle through the aisle opening of the target aisle corresponding to the warehousing task; the handling robot of the warehousing task places the container of the warehousing task in the on the storage slot corresponding to the library task.
目标巷道的一个出库任务包括:该出库任务的搬运机器人将该出库任务的容器从该出库任务对应的储位装载到该出库任务的搬运机器人上;该出库任务的搬运机器人通过目标巷道的对应于该出库任务的巷道口离开目标巷道。An outbound task of the target roadway includes: the handling robot of the outbound task loads the container of the outbound task from the storage position corresponding to the outbound task onto the handling robot of the outbound task; the handling robot of the outbound task Leave the target aisle through the aisle opening of the target aisle corresponding to the outbound task.
目标巷道的一个移库任务包括:该移库任务的搬运机器人携带来自一个其他巷道的该移库任务的容器,通过目标巷道的对应于该移库任务的巷道口进入目标巷道;该移库任务的搬运机器人将该移库任务的容器放置到该移库任务对应的储位上。A library transfer task of the target laneway includes: the handling robot of the warehouse transfer task carries the container of the warehouse transfer task from another laneway, and enters the target laneway through the laneway opening corresponding to the warehouse transfer task of the target laneway; The handling robot puts the container of the storage transfer task on the storage position corresponding to the storage transfer task.
在本申请中,对于目标巷道的任意一个任务,在完成该任务之后,任务管理系统可以删除该任务,在完成该任务之后,该任务不再作为目标巷道的任务。In this application, for any task of the target lane, after the task is completed, the task management system can delete the task, and after the task is completed, the task is no longer a task of the target lane.
在本申请中,在对目标巷道的任务进行管理期间,多次执行步骤101-102。在首次执行步骤101-102之后,可以每间隔预设时长,确定目标巷道的所有任务是否包括以下任务组合中的一个:相对于最近一次执行的步骤101中的目标任务而言的目标巷道的新的目标任务和目标巷道的至少一个出库任务、相对于最近一次执行的步骤101中的目标任务而言的目标巷道的多个新的目标任务、相对于最近一次执行的步骤101中的目标任务而言的目标巷道的多个新的目标任务和目标巷道的至少一个出库任务。若确定目标巷道的所有任务包括一个任务组合,可以执行步骤101-102。In this application, steps 101-102 are performed multiple times during the task management of the target roadway. After executing steps 101-102 for the first time, it may be determined at each preset time interval whether all tasks of the target lane include one of the following task combinations: new The target task and at least one outbound task of the target lane, a plurality of new target tasks of the target lane relative to the target task in the last executed
首次执行的步骤101中的多个任务可以包括以下之一:目标巷道的一个目标任务和目标巷道的至少一个出库任务、目标巷道的多个目标任务、目标巷道的多个目标任务和目标巷道的多个出库任务。The plurality of tasks in
N大于1,第N次执行的步骤101中的多个任务可以是指以下之一:目标巷道的新的一个目标任务和第N-1次执行的步骤101中的目标巷道的至少一个出库任务、相对于第N-1次执行的步骤101中的目标任务而言的目标巷道的新的多个目标任务、相对于第N-1次执行的步骤101中的目标任务而言的目标巷道的新的多个目标任务和第N-1次执行的步骤101中的目标巷道的至少一个出库任务。N is greater than 1, and the plurality of tasks in
在本申请中,可以在执行步骤101之后,确定目标巷道的储位集合。然后,执行步骤102。当确定目标巷道的储位集合时,可以确定目标巷道中的所有可用储位,将所有可用储位作为目标巷道的储位集合。In this application, after
在本申请中,可以将没有作为相应目标任务对应的储位的储位称之为可用储位。可以将作为相应目标任务对应的储位的储位称之为非可用储位。非可用储位上可能有相应的容器,也可能由于相应的容器还没有被放置到非可用储位上,非可用储位上没有相应的容器。In the present application, a storage location that does not correspond to a corresponding target task may be referred to as an available storage location. A storage location corresponding to a corresponding target task may be referred to as an unavailable storage location. There may be a corresponding container on the unavailable storage slot, or there may be no corresponding container on the unavailable storage slot because the corresponding container has not been placed on the unavailable storage slot.
在本申请中,对于目标巷道的任意一个出库任务,由于该出库任务的容器必然离开该出库任务的容器占据的储位,则当确定目标巷道的储位集合时,将该出库任务的容器占据的储位视为不再作为该出库任务对应的储位,该出库任务的容器占据的储位可以作为一个可用储位。In this application, for any outbound task of the target lane, since the container of the outbound task must leave the storage position occupied by the container of the outbound task, when the storage position set of the target lane is determined, the outbound The storage space occupied by the container of the task is no longer regarded as the storage space corresponding to the outbound task, and the storage space occupied by the container of the outbound task can be used as an available storage space.
在本申请中,对于目标巷道中的任意一个巷道口,一个储位的在该巷道口上的序号i表示相对于该巷道口而言,该储位为第i个储位。In this application, for any roadway opening in the target roadway, the serial number i of a storage position on the roadway opening indicates that the storage position is the i-th storage position relative to the roadway opening.
对于目标巷道中的任意一个巷道口,储位的在该巷道口上的序号越小,储位与该巷道口的距离越近,与该巷道口的距离最近的储位的在该巷道口上的序号为1。对于目标巷道中的任意一个巷道口,储位的在该巷道口上的序号越大,储位与该巷道口的距离越远。For any roadway entrance in the target roadway, the smaller the serial number of the storage position on the roadway entrance is, the closer the distance between the storage position and the roadway entrance is, and the serial number of the storage position closest to the roadway entrance is is 1. For any roadway opening in the target roadway, the greater the serial number of the storage position on the roadway opening, the farther the distance between the storage position and the roadway opening is.
在本申请中,若目标巷道具有一个巷道口,每一个目标任务均对应于该巷道口。若多个任务包括多个对应于该巷道口的目标任务,则对于每一个对应于该巷道口的目标任务,可以根据目标任务的下发时间从早至晚,对多个对应于该巷道口的目标任务进行排序,得到一个相对于目标任务的次序。在本申请中,对于任意一个任务,一旦生成任务,立即下发该任务,因此,可以将生成该任务的时间视为该任务的下发时间。按照该相对于目标任务的次序,依次确定多个对应于该巷道口的目标任务中的每一个目标任务对应的储位。对多个对应于该巷道口的目标任务中的任意一个对应于该巷道口的目标任务,当确定该对应于该巷道口的目标任务对应的储位时,可以从目标巷道的储位集合中确定出所有可选的可用储位,可选的可用储位与该巷道口的距离小于目标巷道中的任意一个非可用储位与该巷道口的距离,从所有可选的可用储位中确定出对应于该巷道口的目标任务对应的储位,可以将与该巷道口距离最远的可选的可用储位确定为该对应于该巷道口的目标任务对应的储位。In this application, if the target lane has a lane opening, each target task corresponds to the lane opening. If multiple tasks include multiple target tasks corresponding to the roadway entrance, then for each target task corresponding to the roadway entrance, according to the delivery time of the target task from morning to night, multiple tasks corresponding to the roadway entrance The target tasks are sorted to obtain an order relative to the target tasks. In this application, for any task, once the task is generated, the task will be delivered immediately. Therefore, the time when the task is generated can be regarded as the delivery time of the task. According to the sequence relative to the target task, the storage location corresponding to each target task among the plurality of target tasks corresponding to the roadway entrance is sequentially determined. For any one of the target tasks corresponding to the roadway mouth, when determining the storage position corresponding to the target task corresponding to the roadway mouth, it can be selected from the storage position set of the target roadway Determine all optional available storage locations, the distance between the optional available storage locations and the roadway entrance is smaller than the distance between any unavailable storage location in the target roadway and the roadway entrance, and determine from all optional available storage locations The storage position corresponding to the target task corresponding to the entrance of the roadway can be determined, and the optional available storage position farthest from the entrance of the roadway can be determined as the storage position corresponding to the target task of the entrance of the roadway.
在本申请中,若目标巷道具有一个巷道口,多个任务仅包括一个对应于该巷道口的目标任务,当确定该对应于该巷道口的目标任务的容器储位时,从目标巷道的储位集合确定出所有可选的可用储位,可选的可用储位与该巷道口的距离小于目标巷道中的任意一个非可用储位的序号与该巷道口的距离,从所有可选的可用储位中确定出对应于该巷道口的目标任务对应的储位,可以将与该巷道口的距离最远的可选的可用储位确定为对应于该巷道口的目标任务对应的储位。In the present application, if the target roadway has a roadway opening, the multiple tasks only include one target task corresponding to the roadway opening, and when the container storage position corresponding to the target task of the roadway opening is determined, the storage space of the target roadway The location set determines all the optional available storage locations. The distance between the optional available storage locations and the roadway entrance is smaller than the distance between the sequence number of any unavailable storage location in the target roadway and the roadway entrance. From all optional available storage locations The storage position corresponding to the target task corresponding to the entrance of the roadway is determined among the storage positions, and the optional available storage position farthest from the entrance of the roadway may be determined as the storage position corresponding to the target task of the entrance of the roadway.
若目标巷道具有一个巷道口,多个任务包括多个对应于该巷道口的目标任务,每一个对应于该巷道口的目标任务对应的储位满足以下条件:对应于该巷道口的目标任务在该相对于目标任务的次序中的位置越靠前,对应于该巷道口的目标任务对应的储位与该巷道口的距离越大,对应于该巷道口的目标任务的容器进入目标巷道的时间越早。If the target roadway has a roadway mouth, multiple tasks include a plurality of target tasks corresponding to the roadway mouth, and the storage position corresponding to each target task corresponding to the roadway mouth satisfies the following conditions: the target task corresponding to the roadway mouth is in The higher the position in the sequence relative to the target task, the greater the distance between the storage position corresponding to the target task at the entrance of the lane and the entrance of the lane, and the time when the container corresponding to the target task at the entrance of the lane enters the target lane sooner.
在本申请中,若目标巷道具有两个巷道口,可以随机确定相对于巷道口的次序,也可以按照目标任务数量从多至少,对两个巷道口进行排序,得到相对于巷道口的次序。对于每一个巷道口,该巷道口的目标任务数量为多个任务中的对应于该巷道口的目标任务的数量。按照相对于巷道口的次序,依次对每一个巷道口执行确定操作。In this application, if the target roadway has two roadway entrances, the order relative to the roadway entrances can be randomly determined, or the order relative to the roadway entrances can be obtained by sorting the two roadway entrances according to the number of target tasks from the most to the least. For each roadway opening, the number of target tasks at the roadway opening is the number of target tasks corresponding to the roadway opening among the multiple tasks. According to the order relative to the roadway mouth, the determination operation is performed on each roadway mouth in turn.
对于目标巷道的两个巷道口中的任意一个巷道口,当按照相对于巷道口的次序对该巷道口执行确定操作时,对该巷道口的确定操作包括:若多个任务包括多个对应于该巷道口的目标任务,则对于每一个对应于该巷道口的目标任务,可以根据目标任务的下发时间从早至晚,对多个对应于该巷道口的目标任务进行排序,得到一个相对于目标任务的次序。按照该相对于目标任务的次序,依次确定多个对应于该巷道口的目标任务中的每一个对应于该巷道口的目标任务对应的储位。对多个对应于该巷道口的目标任务中的任意一个对应于该巷道口的目标任务,当确定该对应于该巷道口的目标任务对应的储位时,从目标巷道的储位集合确定出所有可选可用储位,可选可用储位的序号小于目标巷道中的任意一个非可用储位的序号;从所有可选可用储位中确定为该目标任务对应的储位,可以将与该巷道口距离最远的可选的可用储位确定为该目标任务对应的储位。For any one of the two lane openings of the target lane, when the determination operation is performed on the lane opening according to the order relative to the lane opening, the determination operation of the lane opening includes: if multiple tasks include multiple For the target task at the entrance of the roadway, for each target task corresponding to the entrance of the roadway, multiple target tasks corresponding to the entrance of the roadway can be sorted according to the delivery time of the target task from early to late, and a relative The order of the target tasks. According to the sequence relative to the target task, the storage location corresponding to each target task corresponding to the roadway entrance among the plurality of target tasks corresponding to the roadway entrance is sequentially determined. For any one of the target tasks corresponding to the entrance of the roadway, when the storage position corresponding to the target task corresponding to the entrance of the roadway is determined, it is determined from the storage position set of the target roadway All optional available storage positions, the sequence number of the optional available storage position is less than the sequence number of any non-available storage position in the target roadway; the storage position corresponding to the target task can be determined from all optional available storage positions, and the The optional available storage space with the farthest distance from the entrance of the roadway is determined as the storage space corresponding to the target task.
对于目标巷道的两个巷道口中的任意一个巷道口,若多个任务包括多个对应于该巷道口的目标任务,每一个对应于该巷道口的目标任务对应的储位的序号满足以下条件:对应于该巷道口的目标任务在该相对于目标任务的次序中的位置越靠前,对应于该巷道口的目标任务对应的储位与该巷道口的距离越大,对应于该巷道口的目标任务通过该巷道口进入目标巷道的时间越早。For any one of the two lane openings of the target lane, if multiple tasks include a plurality of target tasks corresponding to the lane opening, the sequence number of each storage position corresponding to the target task corresponding to the lane opening satisfies the following conditions: The higher the position of the target task corresponding to the roadway entrance in the order relative to the target task, the greater the distance between the storage position corresponding to the target task corresponding to the roadway entrance and the roadway entrance, and the greater the distance corresponding to the roadway entrance. The earlier the target task enters the target lane through the lane entrance.
在本申请中,若目标巷道具有两个巷道口,对于目标巷道的两个巷道口中的任意一个巷道口,对该巷道口的确定操作包括:若多个任务仅包括一个对应于该巷道口的目标任务,从目标巷道的储位集合确定出所有可选可用储位,可选可用储位与该巷道口的距离小于目标巷道中的任意一个非可用储位与该巷道口的距离;从所有可选可用储位中确定出该目标任务对应的储位,可以将与该巷道口距离最远的可选可用储位确定为该目标任务对应的储位。In this application, if the target roadway has two roadway openings, for any one of the two roadway openings of the target roadway, the determination operation of the roadway opening includes: if multiple tasks only include one corresponding to the roadway opening The target task is to determine all optional available storage locations from the storage location set of the target roadway, and the distance between the optional available storage location and the roadway entrance is smaller than the distance between any unavailable storage location in the target roadway and the roadway entrance; from all The storage location corresponding to the target task is determined from the optional available storage locations, and the optional available storage location farthest from the entrance of the roadway can be determined as the storage location corresponding to the target task.
步骤102,基于每一个目标任务对应的储位的位置和多个任务中的任务的容器当前所处的位置,控制每一个目标任务的执行过程。
在本申请中,对于对应于目标巷道的同一巷道口的多个目标任务,目标任务对应的储位与该同一巷道口的距离越大,目标任务的容器通过该同一巷道口进入目标巷道的时间越早。In this application, for multiple target tasks corresponding to the same lane opening of the target lane, the greater the distance between the storage position corresponding to the target task and the same lane opening, the time it takes for the container of the target task to enter the target lane through the same lane opening sooner.
对于对应于目标巷道的同一巷道口的多个目标任务,目标任务对应的储位与该同一巷道口的距离越小,目标任务的容器通过该同一巷道口进入目标巷道的时间越晚。For multiple target tasks corresponding to the same lane opening of the target lane, the smaller the distance between the storage position corresponding to the target task and the same lane opening, the later the time for the container of the target task to enter the target lane through the same lane opening.
在本申请中,基于目标巷道的多个目标任务中的每一个目标任务的储位,控制每一个目标任务的执行过程可以包括:通知目标巷道的多个任务中的每一个目标任务的搬运机器人:在目标任务的搬运机器人到达相应的巷道口时,停在对应于该目标任务的巷道口。In the present application, based on the storage position of each target task in the multiple target tasks of the target lane, controlling the execution process of each target task may include: notifying the handling robot of each target task in the multiple target tasks of the target lane : When the handling robot of the target task arrives at the corresponding tunnel entrance, it stops at the tunnel entrance corresponding to the target task.
基于每一个目标任务对应的储位的位置和多个任务中的任务的容器当前所处的位置,控制每一个目标任务的执行过程可以包括:实时确定目标巷道中是否有相应的出库任务的容器;对于目标巷道的任意一个巷道口,每一次确定目标巷道中没有对应于该巷道口的出库任务的容器并且多个目标任务中的至少一个对应于该巷道的目标任务的搬运机器人停在该巷道口,通知该至少一个对应于该巷道的目标任务的搬运机器人中的目标搬运机器人进入目标巷道,在至少一个对应于该巷道的目标任务的搬运机器人中,目标搬运机器人所属的目标任务对应的储位与该巷道口的距离最大。目标搬运机器人通过该巷道口进入目标巷道,目标搬运机器人装载的容器进入目标巷道。Based on the position of the storage location corresponding to each target task and the current positions of the containers of the tasks in the multiple tasks, controlling the execution process of each target task may include: determining in real time whether there is a corresponding outbound task in the target lane container; for any laneway mouth of the target lane, every time it is determined that there is no container corresponding to the outbound task of the laneway mouth in the target lane, and at least one of the multiple target tasks corresponds to the handling robot of the laneway’s target task. The entrance of the lane notifies the target transport robot among the at least one transport robot corresponding to the target task of the lane to enter the target lane, and among the at least one transport robot corresponding to the target task of the lane, the target task to which the target transport robot belongs corresponds to The distance between the storage position and the entrance of the roadway is the largest. The target handling robot enters the target lane through the lane opening, and the container loaded by the target handling robot enters the target lane.
在本申请中,从目标巷道的储位集合中确定出目标巷道的多个任务中的每一个目标任务对应的储位;基于每一个目标任务对应的储位的位置和所述多个任务中的任务的容器当前所处的位置,控制每一个目标任务的执行过程。基于该每一个目标任务对应的储位的位置和多个任务中的任务的容器当前所处的位置,控制该每一个目标任务的执行过程,避免阻碍任务的执行的情况。对于目标巷道的多个任务中的任意一个目标任务,一旦下发该目标任务,即可执行该目标任务,该目标任务无需在多个任务中的其他目标任务进入目标巷道后执行,该目标任务也无需多个任务中的出库任务离开目标巷道后执行,作业效率较高。In this application, the storage location corresponding to each target task in the multiple tasks of the target roadway is determined from the storage location set of the target roadway; based on the location of the storage location corresponding to each target task and the The current location of the task container controls the execution process of each target task. Based on the position of the storage location corresponding to each target task and the current positions of the task containers in the multiple tasks, the execution process of each target task is controlled to avoid hindering the execution of the task. For any target task in the multiple tasks of the target lane, once the target task is issued, the target task can be executed, and the target task does not need to be executed after other target tasks in the multiple tasks enter the target lane. There is also no need for the outbound tasks among multiple tasks to be executed after leaving the target lane, and the operation efficiency is high.
在一些实施例中,还包括以下至少一项:在下发新的出库任务时,若所述目标巷道的每一个巷道口存在对应的入库任务时,则将新的出库任务分配至其他巷道口;在下发新的入库任务时,若目标巷道的每一个巷道口存在对应的出库任务时,则将新的入库任务分配至其他巷道口;在下发新的移库任务时,若目标巷道的每一个巷道口存在对应的出库任务时,则将新的移库任务分配至其他巷道口;在下发新的入库任务时,若目标巷道存在对应的出库任务并且目标巷道内放置有其他容器时,将新的入库任务分配至其他巷道,其中,其他容器为除了出库任务的容器之外的容器;以及在下发新的入库任务时,若目标巷道存在对应的出库任务并且目标巷道内未放置其他容器时,将新的入库任务分配至目标巷道,其中,其他容器为除了出库任务的容器之外的容器。In some embodiments, at least one of the following is also included: when issuing a new outbound task, if there is a corresponding inbound task at each laneway entrance of the target lane, then assign the new outbound task to other Roadway entrance; when issuing a new warehouse-in task, if there is a corresponding warehouse-out task at each laneway entrance of the target lane, the new warehouse-in task will be assigned to other laneway entrances; when issuing a new warehouse-transfer task, If there is a corresponding outbound task at each laneway entrance of the target lane, the new warehouse transfer task will be assigned to other laneway entrances; When there are other containers placed in the warehouse, assign the new storage task to other lanes, where the other containers are containers other than the container of the warehouse-out task; and when issuing a new warehouse-in task, if there is a corresponding When there is an outbound task and no other containers are placed in the target aisle, a new inbound task is assigned to the target aisle, wherein the other containers are containers other than the ones in the outbound task.
在本申请中,在下发新的出库任务时,目标巷道的每一个巷道口存在对应的入库任务可以是指:在下发新的出库任务时,对于目标巷道的每一个巷道口,存在对应于该巷道口的入库任务。在下发新的出库任务时,若目标巷道的每一个巷道口存在对应的入库任务,可以将新的出库任务分配至其他巷道口,该其他巷道口所属的其他巷道的每一个巷道口不存在对应的入库任务。In this application, when a new outbound task is issued, there is a corresponding inbound task for each aisle opening of the target aisle may refer to: when a new outbound task is issued, for each aisle entrance of the target aisle, there is Corresponding to the warehousing task at the entrance of this roadway. When issuing a new outbound task, if there is a corresponding warehousing task at each laneway entrance of the target laneway, the new outbound task can be assigned to other laneway entrances, and each laneway entrance of other laneways to which the other laneway entrance belongs There is no corresponding storage task.
在本申请中,在下发新的入库任务时,目标巷道的每一个巷道口存在对应的出库任务可以是指:对于目标巷道的每一个巷道口,存在对应于该巷道口的出库任务。在下发新的入库任务时,若目标巷道的每一个巷道口存在对应的出库任务,可以将新的入库任务分配至其他巷道口,该其他巷道口所属的其他巷道的每一个巷道口不存在对应的出库任务。In this application, when a new storage task is issued, the presence of a corresponding outbound task at each aisle opening of the target aisle may refer to: for each aisle opening of the target aisle, there is an outbound task corresponding to the aisle opening . When issuing a new warehousing task, if there is a corresponding outbound task for each aisle entrance of the target aisle, the new warehousing task can be assigned to other aisle entrances, and each aisle entrance of other aisles to which the other aisle entrance belongs There is no corresponding outbound task.
在本申请中,在下发新的移库任务时,若目标巷道的每一个巷道口存在对应的出库任务,可以将新的移库任务分配至其他巷道口,该其他巷道口所属的其他巷道的每一个巷道口不存在对应的出库任务。In this application, when issuing a new warehouse transfer task, if there is a corresponding outbound task at each laneway entrance of the target laneway, the new warehouse transfer task can be assigned to other laneway entrances, and the other laneway entrances to which the other laneway gates belong There is no corresponding outbound task for each laneway entrance of .
在本申请中,在下发新的入库任务时,若目标巷道存在对应的出库任务并且目标巷道内放置有其他容器时,可以将新的入库任务分配至其他巷道,其他容器为除了出库任务的容器之外的容器,该其他巷道满足以下项中的一个:该其他巷道不存在出库任务、该其他巷道存在对应的出库任务但在该其他巷道内没有放置除了该其他巷道的出库任务的容器之外的容器。In this application, when issuing a new warehousing task, if there is a corresponding outbound task in the target aisle and other containers are placed in the target aisle, the new warehousing task can be assigned to other aisles. The container other than the storage task container, the other lane meets one of the following items: there is no outbound task in the other lane, there is a corresponding outbound task in the other lane, but no other lane is placed in the other lane A container other than the container for the outbound task.
在本申请中,在下发新的入库任务时,若目标巷道存在对应的出库任务并且目标巷道内未放置其他容器时,可以将新的入库任务分配至目标巷道,其他容器为除了出库任务的容器之外的容器。In this application, when issuing a new warehousing task, if there is a corresponding outbound task in the target aisle and no other containers are placed in the target aisle, the new warehousing task can be assigned to the target aisle. A container other than the library task's container.
在本申请中,若目标巷道的每一个巷道口存在对应的入库任务时,则将所述新的出库任务分配至其他巷道口,可以避免以下情况:在执行步骤102期间,若新的出库任务分配至目标巷道的巷道口,在多个任务中的出库任务的容器通过目标巷道的巷道口离开目标巷道之后,目标巷道的入库任务的搬运机器人并不能通过目标巷道的巷道口进入目标巷道,控制目标巷道的入库任务的搬运机器人停在目标巷道的巷道口,等待新的出库任务的容器离开目标巷道的巷道口,造成目标巷道的入库任务的搬运机器人需要等待较长时间才能进入目标巷道,降低作业效率。In this application, if there is a corresponding warehouse-in task at each laneway entrance of the target lane, then the new warehouse-out task is assigned to other laneway entrances, which can avoid the following situation: during the execution of
在本申请中,在下发新的入库任务时,若目标巷道的每一个巷道口存在对应的出库任务时,则将新的入库任务分配至其他巷道口,可以避免以下情况:在执行步骤102期间,如果将新的入库任务分配至该目标巷道的巷道口,新的入库任务与多个任务中的入库任务构成较多的目标巷道的入库任务。较多的目标巷道的入库任务的搬运机器人停止该巷道口,等待目标巷道的出库任务的容器通过目标巷道的巷道口离开目标巷道,造成目标巷道的巷道口阻塞。In this application, when a new warehousing task is issued, if there is a corresponding outbound task at each aisle entrance of the target aisle, the new warehousing task is assigned to other aisle entrances, which can avoid the following situation: During
在本申请中,在下发新的移库任务时,若目标巷道的每一个巷道口存在对应的出库任务时,则将新的移库任务分配至其他巷道口,可以避免以下情况:在执行步骤102期间,如果将新的移库任务分配至其他巷道口,新的入库任务与多个任务中的入库任务构成较多的需要进入目标巷道的任务。较多的需要进入目标巷道的任务停在目标巷道的巷道口,等待目标巷道的出库任务的容器通过目标巷道的巷口离开目标巷道,造成目标巷道的巷道口阻塞。In this application, when issuing a new warehouse transfer task, if there is a corresponding outbound task at each roadway entrance of the target roadway, the new warehouse transfer task is assigned to other roadway entrances, which can avoid the following situation: During
在本申请中,在下发新的入库任务时,若目标巷道存在对应的出库任务并且目标巷道内放置有其他容器时,将新的入库任务分配至其他巷道,可以避免以下情况:出库任务的容器与目标巷道中的其他容器属于相关联的多个容器,相关联的多个容器可以为对应于同一个订单的多个容器,相关联的多个容器需要在一个具有较短的时长的时间段内离开目标巷道,尽快将相关联的多个容器装载到同一个货车上。如果将新的入库任务分配至目标巷道,在目标巷道的出库任务的容器离开目标巷道之后,新的入库任务的容器进入目标巷道,在新的入库任务的容器进入目标巷道之后,需要将其他容器出库。由于新的入库任务的容器阻挡其他容器,必须对新的入库任务的容器进行移动,造成降低作业效率。In this application, when issuing a new warehousing task, if there is a corresponding outbound task in the target aisle and there are other containers placed in the target aisle, assign the new warehousing task to another aisle to avoid the following situation: The container of the library task and other containers in the target lane belong to the associated multiple containers. The associated multiple containers can be multiple containers corresponding to the same order. The associated multiple containers need to be in a Leave the target lane within a long period of time, and load the associated multiple containers onto the same truck as soon as possible. If a new storage task is assigned to the target lane, after the container of the storage task of the target lane leaves the target lane, the container of the new storage task enters the target lane, and after the container of the new storage task enters the target lane, Other containers need to be taken out of the warehouse. Because the container of the new warehousing task blocks other containers, the container of the new warehousing task must be moved, resulting in reduced operation efficiency.
在本申请中,在下发新的入库任务时,若目标巷道存在对应的出库任务并且目标巷道内未放置其他容器时,则在出库任务的容器离开目标巷道之后目标巷道是空巷道,不会出现新的入库任务的容器在进入目标巷道之后阻挡其他容器情况,可以将新的入库任务分配至目标巷道。In this application, when a new storage task is issued, if there is a corresponding output task in the target lane and no other containers are placed in the target lane, then the target lane is empty after the container of the output task leaves the target lane. The container of the new storage task will not block other containers after entering the target aisle, and the new storage task can be assigned to the target aisle.
在一些实施例中,目标巷道的每一个巷道口的每个目标任务的容器属于同一个容器集合。In some embodiments, the containers of each target task at each lane opening of the target lane belong to the same container set.
在本申请中,容器集合由相关联的多个容器组成,容器集合可以由任务管理系统定义。例如,包括目标巷道的每一个巷道口的每个目标任务的容器的容器集合可以对应一个订单,包括目标巷道的每一个巷道口的每个目标任务的容器的容器集合用于装载该订单指示的所有货物。例如,包括目标巷道的每一个巷道口的每个目标任务的容器的容器集合为需要装载到一个货车上的所有容器。In this application, a container set is composed of multiple associated containers, and the container set may be defined by a task management system. For example, the container collection of the container of each target task including each lane opening of the target lane can correspond to an order, and the container collection of the container of each target task including each lane opening of the target lane is used to load the order indicated All goods. For example, the container set of the containers of each target task including each roadway opening of the target roadway is all containers that need to be loaded onto a truck.
在本申请中,目标巷道的每一个巷道口的每个目标任务的容器属于同一个容器集合,可以避免以下情况:在管理仓库期间,需要对一个容器集合整体进行出库,如果目标巷道的每一个巷道口的每个目标任务的容器不属于同一个容器集合,则需要整体出库的容器集合中的相应的两个容器之间存在其他容器,必须对其他容器进行移动,造成降低作业效率。In this application, the containers of each target task at each lane opening of the target lane belong to the same container set, which can avoid the following situation: during the management of the warehouse, a container set needs to be shipped as a whole, if each of the target lanes If the containers of each target task at the entrance of an aisle do not belong to the same container set, it is necessary to have other containers between the corresponding two containers in the overall outbound container set, and the other containers must be moved, resulting in reduced operating efficiency.
在一些实施例中,从目标巷道的储位集合中确定出目标巷道的多个任务中的每一个目标任务对应的储位包括:对于每一个目标任务,当该目标任务的容器到达目标巷道的对应于该目标任务的目标巷道口时,从目标巷道口的储位集合中确定出该目标任务对应的储位,其中,目标任务对应的储位上的容器不会阻挡即将被放置到其他可用储位的容器,其他可用储位为晚于目标任务到达该目标巷道口的其他目标任务对应的储位。In some embodiments, determining the storage position corresponding to each target task in the multiple tasks of the target lane from the storage position set of the target lane includes: for each target task, when the container of the target task reaches the target lane When corresponding to the target roadway opening of the target task, the storage position corresponding to the target task is determined from the storage position set of the target roadway opening, wherein the container on the storage position corresponding to the target task will not block the container that is about to be placed in other available storage container, and other available storage positions are storage positions corresponding to other target tasks that arrive at the target roadway entrance later than the target task.
在本申请中,可以将目标巷道的对应于目标任务的巷道口称之为对应于该目标任务的目标巷道口。其他目标任务是相对于某一个目标任务而言的。对于一个目标任务而言,不是该目标任务并且对应于该目标任务对应的目标巷道口的目标任务为其他目标任务。In the present application, the roadway opening corresponding to the target task of the target roadway may be referred to as the target roadway opening corresponding to the target task. Other target tasks are relative to a certain target task. For a target task, the target tasks that are not the target task and correspond to the target roadway entrance corresponding to the target task are other target tasks.
在本申请中,对于目标巷道的每一个目标任务,该目标任务的容器通过目标巷道的对应于该目标任务的巷道口进入目标巷道。In the present application, for each target task of the target lane, the container of the target task enters the target lane through the lane opening of the target lane corresponding to the target task.
在本申请中,若目标巷道具有一个巷道口,每一个目标任务均对应于目标巷道的一个巷道口,可以在执行步骤101之后,确定该巷道口的储位集合。然后,执行步骤102。当确定该巷道口的储位集合时,可以确定目标巷道中的所有可用储位,将所有可用储位作为该巷道口的储位集合。In the present application, if the target roadway has a roadway opening, and each target task corresponds to a roadway opening of the target roadway, the storage position set of the roadway opening may be determined after
在本申请中,若目标巷道具有两个巷道口,可以在执行步骤101之后,确定每一个巷道口的储位集合。然后,执行步骤102。In the present application, if the target roadway has two roadway openings, after
将目标巷道中的储位的数量记为N,若目标巷道具有两个巷道口,可以在执行步骤101之后,确定每一个巷道口的储位集合。然后,执行步骤102。将目标巷道中的储位的数量记为N,将2/N的取整结果记为N’。The number of storage spaces in the target roadway is denoted as N. If the target roadway has two roadway openings, after
对于一个巷道口,可以将在该巷道口上的序号为1的储位...在该一个巷道口的序号为N’的储位确定为该一个巷道口的储位集合。For a roadway entrance, the storage position with the serial number 1 on the roadway entrance...the storage position with the serial number N' at the one roadway entrance can be determined as the storage position set of the one roadway entrance.
对于另一个巷道口,可以将在该另一个巷道口上序号为1的储位...在该另一个巷道口上的序号为N’-1的储位确定为该另一个巷道口的储位集合。For another roadway opening, the storage position with the serial number 1 on the other roadway entrance...the storage position with the serial number N'-1 on the other roadway entrance can be determined as the storage position set of the other roadway entrance .
在本申请中,对于多个目标任务中的每一个目标任务,当该目标任务的容器到达目标巷道的对应于该目标任务的目标巷道口时,从对应于该目标任务的目标巷道口的储位集合中确定出目标任务对应的储位。In the present application, for each target task in a plurality of target tasks, when the container of the target task reaches the target laneway opening corresponding to the target task, the storage of the target laneway opening corresponding to the target task Determine the storage position corresponding to the target task in the bit set.
对于目标巷道的任意一个目标任务,该目标任务对应的储位上的容器不会阻挡即将被放置到其他可用储位的容器,其他可用储位为晚于目标任务到达对应于该目标任务的目标巷道口的其他目标任务对应的储位。For any target task in the target lane, the container on the storage slot corresponding to the target task will not block the container that is about to be placed in other available storage slots, and the other available storage slots will arrive at the target corresponding to the target task later than the target task Storage positions corresponding to other objective tasks at the entrance of the roadway.
对于目标巷道的任意一个目标任务,该目标任务到达对应于该目标任务的目标巷道口可以是指:该目标任务的容器到达该目标巷道口,对于该目标任务而言,即将被放置到其他可用储位的容器可以是指晚于该目标任务到达该目标巷道口的其他目标任务的容器。For any target task in the target lane, the arrival of the target task at the target lane opening corresponding to the target task may refer to: the container of the target task arrives at the target lane opening, and for the target task, it is about to be placed in other available The storage container may refer to the container of other target tasks that arrive at the target roadway entrance later than the target task.
对于目标巷道的任意一个目标任务,该目标任务对应的储位与对应于该目标任务的目标巷道口的距离大于其他目标任务对应的储位与该目标巷道口的距离。For any target task of the target roadway, the distance between the storage position corresponding to the target task and the target roadway entrance corresponding to the target task is greater than the distance between the storage positions corresponding to other target tasks and the target roadway entrance.
在本申请中,对于对应于同一巷道口的多个目标任务中的目标任务,该目标任务到达该同一巷道口的时间越早,该目标任务对应的储位与该同一巷道口的距离越大,该目标任务的容器通过该同一巷道口进入目标巷道的时间越早。In this application, for a target task among multiple target tasks corresponding to the same roadway opening, the earlier the target task arrives at the same roadway opening, the greater the distance between the storage position corresponding to the target task and the same roadway opening , the earlier the container of the target task enters the target lane through the same lane opening.
对于对应于同一巷道口的多个目标任务中的目标任务,该目标任务到达该同一巷道口的时间越晚,该目标任务对应的储位与该同一巷道口的距离越小,该目标任务的容器通过该同一巷道口进入目标巷道的时间越晚。For the target task in the multiple target tasks corresponding to the same roadway mouth, the later the time the target task arrives at the same roadway mouth, the smaller the distance between the storage position corresponding to the target task and the same roadway mouth, the The later the container enters the target aisle through the same aisle opening.
在本申请中,对于多个目标任务中的每一个目标任务,当从目标巷道的对应于该目标任务的目标巷道口的储位集合中确定出目标任务对应的储位时,可以从对应于目标任务的目标巷道口的储位集合中确定出所有可选的可用储位,其中,可选的可用储位与该目标巷道口的距离小于目标巷道中的任意一个非可用储位与该目标巷道口的距离;从所有可选可用储位中确定为该目标任务对应的储位,可以将与该目标巷道口的距离最远的可选的可用储位确定为该目标任务对应的储位。In this application, for each target task in multiple target tasks, when the storage position corresponding to the target task is determined from the storage position set corresponding to the target roadway entrance of the target roadway, the storage position corresponding to the target task can be obtained from the All optional available storage locations are determined from the storage location set at the target roadway entrance of the target task, and the distance between the optional available storage location and the target roadway entrance is smaller than the distance between any unavailable storage location in the target roadway and the target The distance from the entrance of the roadway; from all the optional available storage positions, it is determined as the storage position corresponding to the target task, and the optional available storage position which is the farthest from the target roadway entrance can be determined as the storage position corresponding to the target task .
在本申请中,对于目标巷道的任意一个目标任务,该目标任务对应的储位与对应于该目标任务的目标巷道口的距离大于其他目标任务对应的储位与该目标巷道口的距离,可以确保目标任务对应的储位上的容器不会阻挡即将被放置到其他可用储位的容器即其他目标任务对应的储位。因此,对于多个目标任务中的每一个目标任务,一旦下发该目标任务,即可立即执行该目标任务,一个目标任务的容器无需在其他目标任务的容器进入目标巷道之后执行。对于多个目标任务中的任意一个目标任务,该目标任务的容器到达对应于该目标任务的巷道口时,该目标任务的容器可以无需等待晚于目标任务到达目标巷道口的其他目标任务的容器到达巷道口,通过对应于该目标任务的目标巷道口进入目标巷道,执行目标任务的效率较高。In this application, for any target task of the target roadway, the distance between the storage position corresponding to the target task and the target roadway opening corresponding to the target task is greater than the distance between the storage positions corresponding to other target tasks and the target roadway opening, which can be Make sure that the containers on the storage slots for the targeted missions do not block containers that are about to be placed in other available storage slots, i.e. storage slots for other targeted missions. Therefore, for each target task among the multiple target tasks, once the target task is issued, the target task can be executed immediately, and the container of one target task does not need to be executed after the containers of other target tasks enter the target lane. For any target task among multiple target tasks, when the container of the target task arrives at the entrance of the lane corresponding to the target task, the container of the target task does not need to wait for the container of other target tasks that arrive at the entrance of the target lane later than the target task Arriving at the entrance of the roadway, entering the target roadway through the entrance of the target roadway corresponding to the target task, the efficiency of executing the target task is relatively high.
在一些实施例中,目标巷道具有两个巷道口;还包括:对于每一个目标任务,将目标巷道的两个巷道口中的与该目标任务的容器的起始位置距离最近的巷道口确定为对应于该目标任务的目标巷道口。In some embodiments, the target lane has two lane openings; it also includes: for each target task, determining the lane opening closest to the starting position of the container of the target task among the two lane openings of the target lane as corresponding at the target laneway entrance of the target task.
该目标任务的容器的起始位置为开始执行该目标任务时该目标任务的容器的位置。The starting position of the container of the target task is the position of the container of the target task when the target task starts to be executed.
对于每一个目标任务,将目标巷道的两个巷道口中的与该目标任务的容器的起始位置距离最近的巷道口确定为对应于该目标任务的目标巷道口,可以使得该目标任务的搬运机器人尽快到达巷道口,尽快进入目标巷道,以尽快完成目标任务。For each target task, determining the aisle opening closest to the starting position of the container of the target task among the two aisle openings of the target aisle as the target aisle opening corresponding to the target task can make the handling robot of the target task Arrive at the entrance of the lane as soon as possible and enter the target lane as soon as possible to complete the target task as soon as possible.
在一些实施例中,对应于目标任务的目标巷道口的储位集合包括:目标巷道中距离目标巷道口最近、且连续的多个可用储位。In some embodiments, the set of storage positions corresponding to the target roadway entrance of the target task includes: a plurality of continuous available storage positions closest to the target roadway entrance in the target roadway.
在本申请中,对于目标巷道中的任意一个巷道口,一个储位的在该巷道口上的序号i表示相对于该巷道口而言,该储位为第i个储位。In this application, for any roadway opening in the target roadway, the serial number i of a storage position on the roadway opening indicates that the storage position is the i-th storage position relative to the roadway opening.
对于目标巷道中的任意一个巷道口,储位的在该巷道口上的序号越小,储位与该巷道口的距离越近,与该巷道口的距离最近的储位的在该巷道口上的序号为1,相对于该巷道口而言的第1个储位的在该巷道口上的序号为1。For any roadway entrance in the target roadway, the smaller the serial number of the storage position on the roadway entrance is, the closer the distance between the storage position and the roadway entrance is, and the serial number of the storage position closest to the roadway entrance is is 1, and the serial number of the first storage position on the roadway entrance relative to the roadway entrance is 1.
对于目标巷道中的任意一个巷道口,储位的在该巷道口上的序号越大,储位与该巷道口的距离越远。For any roadway opening in the target roadway, the greater the serial number of the storage position on the roadway opening, the farther the distance between the storage position and the roadway opening is.
在本申请中,若目标巷道具有一个巷道口,多个目标任务中的每一个目标任务均对应于该巷道口,对于每一个任务,该巷道口为对应于该目标任务的目标巷道口。可以在执行步骤101之后,确定该巷道口的储位集合。然后,执行步骤102。当确定该巷道口的储位集合时,可以确定目标巷道中的在该巷道口上的序号最小的非可用储位,确定出的非可用储位的在该巷道口上的序号记为M,在该巷道口上的序号为1的储位...在该巷道口上的序号为M-1的储位为目标巷道中距离该巷道口最近、且连续的多个可用储位,可以将在该巷道口上的序号为1的储位...在该巷道口上的序号为M-1的储位确定为该巷道口的储位集合。In the present application, if the target roadway has a roadway opening, each target task among the multiple target tasks corresponds to the roadway opening, and for each task, the roadway opening is the target roadway opening corresponding to the target task. After
若目标巷道具有第一巷道口和第二巷道口,可以在执行步骤101之后,确定每一个巷道口的储位集合。然后,执行步骤102。将目标巷道中的储位的数量记为N,将2/N的取整结果记为N’。If the target roadway has a first roadway opening and a second roadway opening, after
对于任意一个目标任务,若该目标任务的容器通过第一巷道口进入目标巷道,则第一巷道口为对应于该目标任务的目标巷道口。可以从在第一巷道口上的序号为1的储位...在第一巷道口上的序号为N’的储位中的所有非可用储位中确定出在第一巷道口的序号最小的非可用储位,确定出的非可用储位的在第一巷道口的序号记为M1,在第一巷道口的序号为1的储位...在第一巷道口的序号为M1-1为目标巷道中距离第一巷道口最近、且连续的多个可用储位,将在第一巷道口的序号为1的储位...在第一巷道口的序号为M1-1的储位确定为第一巷道口的储位集合。For any target task, if the container of the target task enters the target lane through the first lane opening, the first lane opening is the target lane opening corresponding to the target task. The non-available storage position with the smallest serial number at the first laneway entrance can be determined from all the unavailable storage positions in the storage position with the serial number 1 on the first laneway entrance ... the storage position with the serial number N' on the first laneway entrance. The available storage position, the serial number of the determined unavailable storage position at the first roadway entrance is marked as M1, the storage position with the serial number at the first roadway entrance is 1... the serial number at the first roadway entrance is M1-1 is For the multiple available storage locations closest to the first aisle entrance and continuous in the target aisle, the storage location with the serial number 1 at the first aisle entrance...the storage location with the serial number M1-1 at the first aisle entrance is determined is the collection of storage positions at the first roadway entrance.
对于任意一个目标任务,若该目标任务的容器通过第二巷道口进入目标巷道,则第二巷道口为对应于该目标任务的目标巷道口。可以从在第二巷道口的序号为1的储位...在第二巷道口上的序号为N’-1的储位中的所有非可用储位中确定出在第二巷道口上的序号最小的非可用储位,确定出的非可用储位在第二巷道口上的序号记为M2,将在第二巷道口上的序号为1的储位...在第二巷道口上的序号为M2-1的储位确定为该另一个巷道口的储位集合。For any target task, if the container of the target task enters the target lane through the second lane opening, the second lane opening is the target lane opening corresponding to the target task. It can be determined from all non-available storage positions in the storage position with the serial number 1 at the second laneway entrance ... the storage position with the serial number N'-1 at the second laneway entrance, and determine that the serial number on the second laneway entrance is the smallest The unavailable storage position of the determined non-available storage position is marked as M2 on the second roadway entrance, and the storage position with the serial number 1 on the second roadway entrance ... is M2- on the second roadway entrance. The storage position of 1 is determined as the storage position set of the other roadway entrance.
在本申请中,对应于目标任务的目标巷道口的储位集合包括:目标巷道中距离目标巷道口最近、且连续的多个可用储位,可以避免以下情况:目标巷道口的储位集合不是连续的多个可用储位,目标巷道口的储位集合中的相应的两个可用储位之间存在其他储位,其他储位为可用储位,但由于其他储位没有在目标巷道口的储位集合中,无法将其他储位确定为相应目标任务对应的储位,导致无法充分地利用可用储位。In this application, the storage position set of the target roadway opening corresponding to the target task includes: multiple available storage positions closest to the target roadway entrance in the target roadway and continuous, and the following situation can be avoided: the storage position set of the target roadway opening is not Continuous multiple available storage locations, there are other storage locations between the corresponding two available storage locations in the storage location set at the target roadway entrance, and the other storage locations are available storage locations, but because the other storage locations are not in the In the storage slot set, other storage slots cannot be determined as the storage slots corresponding to the corresponding target tasks, resulting in the inability to fully utilize the available storage slots.
在一些实施例中,从目标巷道口的储位集合中确定出目标任务对应的储位,包括:将目标巷道口的储位集合中与目标巷道口距离最远的可用储位确定为目标任务对应的储位。In some embodiments, determining the storage location corresponding to the target task from the storage location set of the target roadway entrance includes: determining the available storage location farthest from the target roadway entrance in the storage location set of the target roadway entrance as the target task the corresponding storage position.
在本申请中,对于目标巷道的多个任务中的任意一个目标任务,当从目标巷道的对应于该目标任务的目标巷道口的储位集合中确定出该目标任务对应的储位时,可以直接将该目标巷道口的储位集合中与该目标巷道口距离最远的可用储位确定为该目标任务对应的储位,将目标巷道口的储位集合中与目标巷道口距离最远的可用储位确定为该目标任务对应的储位可以确保在将该目标任务的容器放置到该目标任务对应的储位之后,该目标任务的容器不会阻挡晚于该目标任务到达目标巷道口并且通过该目标巷道口进入目标巷道的其他目标任务的容器。无需确定对应于该目标任务的巷道口的储位集合中的可选的可用储位,也无需确定目标巷道中的非可用储位,可以快速地确定目标任务对应的储位。In this application, for any target task among the multiple tasks of the target roadway, when the storage position corresponding to the target task is determined from the storage position set of the target roadway entrance corresponding to the target task, the storage position corresponding to the target task can be Directly determine the available storage position that is farthest from the target roadway entrance in the storage position set of the target roadway entrance as the storage position corresponding to the target task, and set the storage position that is farthest from the target roadway entrance in the storage position set of the target roadway entrance Determining the available storage position as the storage position corresponding to the target task can ensure that after the container of the target task is placed in the storage position corresponding to the target task, the container of the target task will not block the arrival of the target task later than the target roadway and Containers for other target tasks that enter the target lane through the target lane entrance. The storage location corresponding to the target task can be quickly determined without determining the optional available storage location in the storage location set at the entrance of the roadway corresponding to the target task, and without determining the unavailable storage location in the target roadway.
请参考图2,其示出了本申请实施例提供的任务管理装置的结构框图。任务管理装置包括:储位确定单元201,控制单元202。Please refer to FIG. 2 , which shows a structural block diagram of a task management device provided by an embodiment of the present application. The task management device includes: a storage
储位确定单元201被配置为从目标巷道的储位集合中确定出所述目标巷道的多个任务中的每一个目标任务对应的储位,所述目标任务为入库任务或移库任务;The storage
控制单元202被配置为基于所述每一个目标任务对应的储位的位置和所述多个任务中的任务的容器当前所处的位置,控制所述每一个目标任务的执行过程。The
在一些实施例中,任务管理装置还包括:In some embodiments, the task management device also includes:
分配单元,被配置为执行以下至少一项:在下发新的出库任务时,若所述目标巷道的每一个巷道口存在对应的入库任务时,则将所述新的出库任务分配至其他巷道口;在下发新的入库任务时,若所述目标巷道的每一个巷道口存在对应的出库任务时,则将所述新的入库任务分配至其他巷道口;在下发新的移库任务时,若所述目标巷道的每一个巷道口存在对应的出库任务时,则将所述新的移库任务分配至其他巷道口;在下发新的入库任务时,若所述目标巷道存在对应的出库任务并且所述目标巷道内放置有其他容器时,将所述新的入库任务分配至其他巷道,其中,其他容器为除了所述出库任务的容器之外的容器;以及在下发新的入库任务时,若所述目标巷道存在对应的出库任务并且所述目标巷道内未放置其他容器时,将所述新的入库任务分配至所述目标巷道,其中,其他容器为除了所述出库任务的容器之外的容器。The allocation unit is configured to perform at least one of the following: when issuing a new outbound task, if there is a corresponding warehousing task at each laneway entrance of the target lane, then assign the new outbound task to Other roadway entrances; when issuing new storage tasks, if there is a corresponding outbound task at each laneway entrance of the target roadway, the new storage tasks will be assigned to other roadway entrances; When moving the warehouse task, if there is a corresponding outbound task at each laneway opening of the target lane, then the new warehouse moving task is assigned to other laneway entrances; when issuing a new warehouse-in task, if the When there is a corresponding outbound task in the target aisle and other containers are placed in the target aisle, assign the new inbound task to other aisles, wherein the other containers are containers other than the container in the outbound task ; and when issuing a new warehousing task, if there is a corresponding outbound task in the target aisle and no other container is placed in the target aisle, assign the new warehousing task to the target aisle, wherein , other containers are containers other than the container of the outbound task.
在一些实施例中,所述目标巷道的每一个巷道口的每个目标任务的容器属于同一个容器集合。In some embodiments, the containers of each target task at each lane opening of the target lane belong to the same container set.
在一些实施例中,储位确定单元201被配置为对于所述每一个目标任务,当所述目标任务的容器到达所述目标巷道的对应于所述目标任务的目标巷道口时,从所述目标巷道口的储位集合中确定出所述目标任务对应的储位,其中,所述目标任务对应的储位上的容器不会阻挡即将被放置到其他可用储位的容器,所述其他可用储位为晚于所述目标任务到达所述目标巷道口的其他目标任务对应的储位。In some embodiments, the storage
在一些实施例中,所述目标巷道具有两个巷道口;任务管理装置还包括:巷道口确定单元,被配置为对于所述每一个目标任务,将所述两个巷道口中的与所述目标任务的起始位置距离最近的巷道口确定为对应于所述目标任务的目标巷道口。In some embodiments, the target roadway has two roadway openings; the task management device further includes: a roadway opening determining unit configured to, for each target task, combine the two roadway openings with the target The roadway entrance closest to the starting position of the task is determined as the target roadway entrance corresponding to the target task.
在一些实施例中,所述目标巷道口的储位集合包括:所述目标巷道中距离所述目标巷道口最近、且连续的多个可用储位。In some embodiments, the storage position set of the target roadway opening includes: a plurality of available storage positions in the target roadway that are closest to the target roadway opening and are continuous.
在一些实施例中,储位确定单元201被配置为将所述目标巷道口的储位集合中与所述目标巷道口距离最远的可用储位确定为所述目标任务对应的储位。In some embodiments, the storage
在示例性实施例中,还提供了一种包括指令的存储介质,例如包括指令的存储器,上述指令可由服务器执行以完成上述任务管理方法。可选地,存储介质可以是非临时性计算机可读存储介质,例如,所述非临时性计算机可读存储介质可以是ROM、随机存取存储器(RAM)、CD-ROM、磁带、软盘和光数据存储设备等。In an exemplary embodiment, there is also provided a storage medium including instructions, such as a memory including instructions, which can be executed by a server to complete the above task management method. Alternatively, the storage medium may be a non-transitory computer readable storage medium such as ROM, random access memory (RAM), CD-ROM, magnetic tape, floppy disk, and optical data storage medium. equipment etc.
本领域技术人员在考虑说明书及实践这里公开的发明后,将容易想到本申请的其它实施方案。本申请旨在涵盖本申请的任何变型、用途或者适应性变化,这些变型、用途或者适应性变化遵循本申请的一般性原理并包括本申请未公开的本技术领域中的公知常识或惯用技术手段。说明书和实施例仅被视为示例性的,本申请的真正范围和精神由下面的权利要求指出。Other embodiments of the present application will be readily apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any modification, use or adaptation of the application, these modifications, uses or adaptations follow the general principles of the application and include common knowledge or conventional technical means in the technical field not disclosed in the application . The specification and examples are to be considered exemplary only, with a true scope and spirit of the application indicated by the following claims.
应当理解的是,本申请并不局限于上面已经描述并在附图中示出的精确结构,并且可以在不脱离其范围进行各种修改和改变。本申请的范围仅由所附的权利要求来限制。It should be understood that the present application is not limited to the precise constructions which have been described above and shown in the accompanying drawings, and various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (10)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210889808.4A CN115345447A (en) | 2022-07-27 | 2022-07-27 | Task management method, electronic device and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210889808.4A CN115345447A (en) | 2022-07-27 | 2022-07-27 | Task management method, electronic device and storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
CN115345447A true CN115345447A (en) | 2022-11-15 |
Family
ID=83950856
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210889808.4A Pending CN115345447A (en) | 2022-07-27 | 2022-07-27 | Task management method, electronic device and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115345447A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2024114473A1 (en) * | 2022-11-29 | 2024-06-06 | 杭州海康机器人股份有限公司 | Lane warehouse management method and system, and device |
-
2022
- 2022-07-27 CN CN202210889808.4A patent/CN115345447A/en active Pending
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2024114473A1 (en) * | 2022-11-29 | 2024-06-06 | 杭州海康机器人股份有限公司 | Lane warehouse management method and system, and device |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10943210B2 (en) | Optimization of warehouse layout based on customizable goals | |
CN110239868B (en) | Pick-up task allocation method and goods sorting system | |
JP6757490B2 (en) | Autonomous replacement of pallets of items in the warehouse | |
JP2019531990A (en) | Automatic collection of pallet items in a warehouse | |
US20200231185A1 (en) | Systems and methods for automated guided vehicle control | |
US20220402698A1 (en) | Transport control device, transport control method, and computer-readable storage medium | |
CN114358680A (en) | Task assignment method, electronic device and computer program product | |
CN115311441A (en) | Automatic warehousing system, goods checking method and server | |
CN114728746B (en) | Management system and article warehouse-in and warehouse-out management method | |
CN115345447A (en) | Task management method, electronic device and storage medium | |
CN113998352B (en) | Sorting and dispatching method and device, electronic equipment, storage medium and warehousing system | |
CN115293680A (en) | Warehouse management method, electronic device and storage medium | |
CN114021771A (en) | Shelf management method, device, system, control terminal and readable storage medium | |
WO2024021758A1 (en) | Robot control method, electronic device and storage medium | |
CN113449906B (en) | A storage location optimization method, device, inventory management equipment and system | |
CN115630895A (en) | Cargo management method and device, carrying equipment and computer readable storage medium | |
CN115504145A (en) | Cargo carrying method, device and equipment and automatic carrying system | |
CN115115301A (en) | Scheduling method, apparatus, medium, and program product for transport apparatus | |
CN115310899A (en) | Scheduling method, electronic device and storage medium | |
CN114399247A (en) | Task allocation method, electronic device, storage medium, and computer program product | |
JP2004001944A (en) | Entry and exit control method and apparatus, and automatic warehouse having the entry and exit control apparatus | |
CN115310778A (en) | Scheduling method and device, warehousing system and storage medium | |
JP2023129905A (en) | Warehouse management system and pallet-shaped member | |
JP2023129906A (en) | warehouse management system | |
JP2023129904A (en) | warehouse management system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
CB02 | Change of applicant information | ||
CB02 | Change of applicant information |
Country or region after: China Address after: 100096 No.125, 1st floor, building 1, Xisanqi building materials City, Haidian District, Beijing Applicant after: Beijing Force Aggregation Robot Technology Co.,Ltd. Address before: 100096 No.125, 1st floor, building 1, Xisanqi building materials City, Haidian District, Beijing Applicant before: BEIJING KUANGSHI ROBOT TECHNOLOGY Co.,Ltd. Country or region before: China |
|
TA01 | Transfer of patent application right | ||
TA01 | Transfer of patent application right |
Effective date of registration: 20250126 Address after: No. 257, 2nd Floor, Building 9, No. 2 Huizhu Road, Kangmei Street, Liangjiang New District, Yubei District, Chongqing 401120 Applicant after: Force Aggregation (Chongqing) Robot Technology Co.,Ltd. Country or region after: China Address before: 100096 No.125, 1st floor, building 1, Xisanqi building materials City, Haidian District, Beijing Applicant before: Beijing Force Aggregation Robot Technology Co.,Ltd. Country or region before: China |