Transport capacity dispatching method, device, equipment and medium

Abstract

The invention discloses a transport capacity scheduling method and device, equipment and a medium. The method comprises the following steps: determining a first task of a robot according to a to-be-delivered order, wherein the first task is stored in a task queue of the robot according to order placing time; sequentially scheduling the robot to execute the first task according to the order placing time; and determining a second task which can be executed in advance according to the destination address of the newly added task in the task queue, wherein the creation time of the second task is after the first task. By adopting the embodiment of the invention, the task execution sequence of the robot in the task queue is adjusted according to the second task, the waste of robot resources is avoided, and the overall delivery efficiency of the robot is improved by reasonably planning the tasks, coordinating the priority of each task and scheduling the transport capacity according to requirements, so that the delivery efficiency of the robot is improved. And the user experience can be improved.

Description

Technical Field

[0001] The present invention relates to the field of artificial intelligence technology, and in particular to a transportation capacity scheduling method, device, equipment and medium. Background Art

[0002] The value of hotel service robots lies in helping hotels complete low-value repetitive labor, thereby freeing up manpower to provide warmer and more valuable services. The emergence of service robots greatly reduces labor costs. As long as the service robots are sufficiently powered, they can work 24 hours a day. With the introduction of relevant government policies, many hotels and buildings have started digital transformation, so service robots have become a key link in digital transformation. At present, when existing service robots deliver items to users, multiple items can be placed in their storage compartments. Usually, delivery is carried out according to the principle of first order first delivery. Following this principle to deliver items, service robots spend too much time in the elevator, reducing delivery efficiency. It can be seen that for service robots that open cabins to deliver items, how to adjust the order of task delivery based on the existing principle of first order first delivery and improve the overall delivery efficiency of the robot has become an urgent problem to be solved. Summary of the invention

[0003] The present invention provides a capacity scheduling method, device, equipment and medium, which solves the problem of adjusting the task delivery sequence of the robot and improving the delivery efficiency based on the method of first order and first delivery by the robot.

[0004] According to a first aspect of the present invention, a capacity scheduling method is provided, the method comprising:

[0005] Determine a first task of the robot according to the order to be delivered, wherein the first task is stored in a task queue of the robot according to the order placement time;

[0006] Scheduling the robots to perform the first tasks in sequence according to the order time;

[0007] A second task that can be executed first is determined according to a destination address of the newly added task in the task queue, and the creation time of the second task is after the first task.

[0008] According to a second aspect of the present invention, a transport capacity scheduling device is provided, the device comprising:

[0009] A first determination module is configured to determine a first task of the robot according to the order to be delivered, wherein the first task is stored in a task queue of the robot according to the order placement time;

[0010] A scheduling module, configured to sequentially schedule the robot to perform the first task according to the order time;

[0011] The second determining module is configured to determine a second task that can be executed first according to a destination address of a newly added task in the task queue, wherein the creation time of the second task is after the creation time of the first task.

[0012] According to a third aspect of the present invention, there is provided an electronic device comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor implements a capacity scheduling method as described in any embodiment of the present invention.

[0013] According to a fourth aspect of the present invention, a computer-readable storage medium is provided, wherein the computer instructions are used to enable the computer to execute a capacity scheduling method as described in any embodiment of the present invention.

[0014] The present invention discloses a method, device, equipment and medium for dispatching transportation capacity. The method comprises: determining a first task of a robot according to an order to be delivered, wherein the first task is stored in a task queue of the robot according to the order time; dispatching the robot to perform the first task in sequence according to the order time; determining a second task that can be executed first according to the destination address of a newly added task in the task queue, wherein the creation time of the second task is after the first task. By adopting an embodiment of the present invention, the order of task execution of the robot in the task queue is adjusted according to the second task, thereby avoiding waste of robot resources, and dispatching transportation capacity according to demand through reasonable planning of tasks and coordination of the priorities of various tasks, which not only improves the overall delivery efficiency of the robot, but also improves the user experience.

[0015] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0017] Figure 1 is a schematic diagram of an application scenario of a transport capacity scheduling method that can implement an embodiment of the present invention;

[0018] Figure 2is a flow chart of a transport capacity scheduling method provided according to an embodiment of the present invention;

[0019] Figure 3 is a structural schematic diagram of a transport capacity scheduling device provided according to an embodiment of the present invention;

[0020] Figure 4 The block diagram is a block diagram of an electronic device used to implement a transportation capacity scheduling method according to an embodiment of the present invention. DETAILED DESCRIPTION

[0021] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0023] Figure 1 A schematic diagram of an application scenario of a transport capacity scheduling method that can implement an embodiment of the present invention is provided. Figure 1 As shown, the computing device 110 can achieve: determining the first task of the robot according to the order to be delivered, the first task is stored in the task queue of the robot according to the order time; scheduling the robot to perform the first task in sequence according to the order time; determining the second task that can be performed first according to the destination address of the newly added task in the task queue, the creation time of the second task is after the first task. It is worth noting that: Figure 1 The application scenario shown is an example of a capacity scheduling method based on an embodiment of the present invention, but is not limiting.

[0024] It should be noted that the above-mentioned computing device 110 can be hardware or software. When the computing device 110 is hardware, it can be implemented as a distributed cluster consisting of multiple servers or terminal devices, or it can be implemented as a single server or a single terminal device. When the computing device 110 is embodied as software (for example, a program or system for controlling a robot), it can be installed in the hardware devices listed above. It can be implemented as multiple software or software modules for providing distributed services, for example, or it can be implemented as a single software or software module. No specific limitation is made here.

[0025] It should be understood that Figure 1 The number of computing devices in the embodiment is only illustrative. Any number of computing devices may be provided according to implementation requirements.

[0026] Embodiment 1

[0027] According to an embodiment of the present application, a method for dispatching transportation capacity is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical sequence is shown in the flowchart, in some cases, the steps shown or described can be executed in a different order than that shown here. Figure 2 As shown, the transport capacity scheduling method includes the following steps: S210, S220 and S230.

[0028] S210. Determine a first task of the robot according to the order to be delivered, and store the first task in a task queue of the robot according to the order placement time.

[0029] The first tasks in the task queue are generated according to the order placement time, and the robot implements the delivery according to the time sequence of the first tasks.

[0030] S220. Scheduling the robots to perform the first tasks in sequence according to the order time.

[0031] S230: Determine a second task that can be executed first according to the destination address of the newly added task in the task queue, where the creation time of the second task is after the creation time of the first task.

[0032] The newly added task is a task added to the task queue after the creation time of the first task. According to the destination address of the newly added task, it is queried whether the location of the robot is in the area where the newly added task is allowed to be executed first. In short, if the destination address corresponding to the newly added task is in the area passed by the robot during the execution of the first task, the newly added task inserted into the task queue later is allowed, that is, the second task "queue jumps in", and the second task is executed first after the robot completes the current corresponding first task. In addition, if the newly added task cannot be allowed to be executed first, that is, the location of the robot is not within the area where "queue jumps in", then the newly added task is added to the task queue according to the current time, waiting for the first robot to execute the first task in the task queue in chronological order. Therefore, if the newly added task is allowed to be executed by the robot first, that is, the newly added task is allowed to "queue jump in", then the newly added task is defined as the second task. If the newly added task is not allowed to be executed by the robot first, that is, the newly added task is not allowed to "queue jump in", then the newly added task is defined as the first task and waits for the robot to execute it.

[0033] Among them, determining the second task that can be executed first according to the destination address of the newly added task in the task queue includes: obtaining the destination address of the second task; determining the predetermined path for the robot to execute the second task according to the destination address; querying the target robot whose actual path when executing the first task intersects with the predetermined path, and the target robot executes the second task after completing the first task.

[0034] Optionally, the query for the target robot whose actual path intersects with the predetermined path when executing the first task includes: determining a first position point included in the actual path; determining a second position point overlapping with the first position point according to the predetermined path; and sending an instruction to execute the second task to the target robot passing through the second position point.

[0035] Optionally, if the second task does not exist in the task queue, the robot is assigned to perform the first task according to the remaining working time of the robot.

[0036] Optionally, after determining the second task that can be executed first according to the destination address of the newly added task in the task queue, it also includes: determining the task to be executed according to the remaining power of the target robot; determining a new order to be delivered by the target robot according to the task to be executed; when the task to be executed does not exist, controlling the target robot to return to the charging pile.

[0037] It should be noted that: the task to be executed includes the first task and the second task in the task queue, wherein, when the task to be executed is the first task, it means that there is no second task in the task queue that is allowed to be executed first, that is, the robot is not in the area where "queue jumping" is allowed; when the task to be executed is the second task, it means that the robot is in the area where "queue jumping" is allowed, the second task is executed first, and the other remaining first tasks in the task queue are executed later.

[0038] Further, the determining of the new order to be delivered by the target robot according to the task to be performed includes: determining whether the current position of the target robot and the destination address of the task to be performed are in the same area; and allocating the new order corresponding to the task to be performed in the same area to the target robot. Further, calculating the shortest path from the current position to the destination address corresponding to the new order; and scheduling the target robot to complete the delivery task of the new order according to the shortest path. Optionally, if the current position and the destination address of the task to be performed are not in the same area, scheduling the target robot to perform the first task according to the task queue.

[0039] The present invention discloses a capacity scheduling method. The method comprises: determining a first task of a robot according to an order to be delivered, wherein the first task is stored in a task queue of the robot according to the order time; scheduling the robot to perform the first task in sequence according to the order time; determining a second task that can be performed first according to the destination address of a newly added task in the task queue, wherein the creation time of the second task is after the first task. By adopting the embodiment of the present invention, the order of task execution of the robot in the task queue is adjusted according to the second task, thereby avoiding the waste of robot resources, and scheduling capacity according to demand through reasonable planning of tasks and coordination of the priorities of various tasks, which not only improves the overall delivery efficiency of the robot, but also improves the user experience.

[0040] Embodiment 2

[0041] According to an embodiment of the present invention, a schematic diagram of the structure of a transport capacity scheduling device is provided, and the device can execute a transport capacity scheduling method provided in the above embodiment 1. Figure 3 As shown, the device includes: a first determination module 310, a scheduling module 320, and a second determination module 330. Among them:

[0042] The first determination module 310 is configured to determine the first task of the robot according to the order to be delivered, and the first task is stored in the task queue of the robot according to the order placement time.

[0043] The scheduling module 320 is configured to schedule the robot to perform the first task in sequence according to the order time.

[0044] The second determining module 330 is configured to determine a second task that can be executed first according to a destination address of the newly added task in the task queue, and the creation time of the second task is after the creation time of the first task.

[0045] Optionally, the second determining module 330 includes:

[0046] an acquiring unit, configured to acquire a destination address of the second task;

[0047] a determination unit, configured to determine a predetermined path for the robot to perform the second task according to the destination address;

[0048] The query unit is configured to query a target robot whose actual path intersects with the predetermined path when executing the first task, and the target robot executes the second task after completing the first task.

[0049] Furthermore, the query unit includes:

[0050] A first determining subunit is configured to determine a first position point included in the actual path;

[0051] A second determining subunit is configured to determine a second position point that coincides with the first position point according to the predetermined path;

[0052] The sending unit is configured to send an instruction to execute the second task to the target robot passing the second location point.

[0053] Optionally, the device further includes: an allocation module configured to allocate the robot to perform the first task according to the remaining working time of the robot if the second task does not exist in the task queue.

[0054] Optionally, after the second determining module 330, the method further includes:

[0055] A third determination module is configured to determine a task to be performed according to the remaining power of the target robot;

[0056] A fourth determination module is configured to determine a new order to be delivered by the target robot according to the task to be performed;

[0057] The control module is configured to control the target robot to return to the charging station when there is no task to be performed.

[0058] Optionally, the fourth determination module includes: determining whether the current position of the target robot and the destination address of the task to be executed are in the same area; and allocating new orders corresponding to the task to be executed in the same area to the target robot.

[0059] Furthermore, the fourth determination module also includes: calculating the shortest path from the current position to the destination address corresponding to the new order; and scheduling the target robot to complete the delivery task of the new order according to the shortest path.

[0060] Optionally, if the current position and the destination address of the task to be performed are not in the same area, the target robot is scheduled to perform the first task according to the task queue.

[0061] The present invention discloses a capacity scheduling device, equipment and medium. The device includes: a first determination module, configured to determine the first task of the robot according to the order to be delivered, and the first task is stored in the task queue of the robot according to the order time; a scheduling module, configured to schedule the robot to perform the first task in sequence according to the order time; a second determination module, configured to determine the second task that can be executed first according to the destination address of the newly added task in the task queue, and the creation time of the second task is after the first task. Using the embodiment of the present invention, the task execution order of the robot in the task queue is adjusted according to the second task, thereby avoiding the waste of robot resources. Through reasonable planning of tasks, coordinating the priorities of various tasks, and scheduling capacity according to demand, not only the overall delivery efficiency of the robot is improved, but also the user experience can be improved.

[0062] Embodiment 3

[0063] Reference below Figure 4 , which shows a block diagram of an electronic device 400 suitable for implementing an embodiment of the present invention. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or claimed herein.

[0064] like Figure 4As shown, the electronic device 400 may include a processing device 410, which may perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 420 or a program loaded from a storage device 480 into a random access memory (RAM) 430. The processing device 410 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processing device 410 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processing device 410 performs the various methods and processes described above.

[0065] In the RAM 430, various programs and data required for the operation of the electronic device 400 are also stored. The processing device 410, the ROM 420, and the RAM 430 are connected to each other through a bus 440. An input / output (I / O) interface 450 is also connected to the bus 440.

[0066] Typically, the following devices may be connected to the I / O interface 450: an input device 460 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 470 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 480 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 490. The communication device 490 may allow the electronic device 400 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 4 The electronic device 400 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0067] In particular, according to an embodiment of the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present invention includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through a communication device 490, or installed from a storage device 480, or installed from a ROM 420. When the computer program is executed by the processing device 410, the above functions defined in the method of the embodiment of the present invention are executed. Alternatively, in other embodiments, the processing device 410 can be configured to execute the method in any other appropriate manner (for example, by means of firmware): determining the first task of the robot according to the order to be delivered, the first task is stored in the task queue of the robot according to the order time; scheduling the robot to perform the first task in sequence according to the order time; determining the second task that can be executed first according to the destination address of the newly added task in the task queue, and the creation time of the second task is after the first task.

[0068] Embodiment 4

[0069] The computer-readable medium of the present invention can be a computer-readable signal medium or a computer-readable storage medium or any combination of the two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media can include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal can take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0070] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0071] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0072] The above-mentioned computer-readable medium carries one or more programs. When the above-mentioned one or more programs are executed by the electronic device, the electronic device: determines the first task of the robot according to the order to be delivered, and the first task is stored in the task queue of the robot according to the order time; schedules the robot to execute the first task in sequence according to the order time; determines the second task that can be executed first according to the destination address of the newly added task in the task queue, and the creation time of the second task is after the first task.

[0073] Computer program code for performing the operations of the present invention may be written in one or more programming languages ​​or a combination thereof, including, but not limited to, object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0074] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0075] The modules involved in the embodiments of the present invention may be implemented by software or hardware, wherein the name of a module does not limit the module itself in some cases.

[0076] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip systems (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof, etc.

[0077] The program code for implementing the method of the present invention can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code can be executed entirely on the machine, partially on the machine, partially on the machine as a stand-alone software package and partially on a remote machine, or entirely on a remote machine or server.

[0078] In the context of the present invention, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0079] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0080] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0081] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship between the client and the server is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or a cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services. The server may also be a server of a distributed system, or a server combined with a blockchain.

[0082] Artificial intelligence is a discipline that studies how to use computers to simulate certain human thought processes and intelligent behaviors (such as learning, reasoning, thinking, planning, etc.). It includes both hardware-level and software-level technologies. Artificial intelligence hardware technologies generally include technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, and big data processing; artificial intelligence software technologies mainly include computer vision technology, speech recognition technology, natural language processing technology, machine learning / deep learning technology, big data processing technology, knowledge graph technology, and other major directions.

[0083] Cloud computing refers to a technology system that uses network access to elastically scalable shared physical or virtual resource pools. Resources can include servers, operating systems, networks, software, applications, and storage devices, and can be deployed and managed on demand and in a self-service manner. Cloud computing technology can provide efficient and powerful data processing capabilities for technical applications such as artificial intelligence and blockchain, as well as model training.

[0084] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution provided by the present invention can be achieved, and this document does not limit this.

[0085] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A transport capacity dispatching method, characterized in that: The method comprises: Determine a first task of the robot according to the order to be delivered, wherein the first task is stored in a task queue of the robot according to the order placement time; Scheduling the robots to perform the first tasks in sequence according to the order time; A second task that can be executed first is determined according to a destination address of the newly added task in the task queue, and the creation time of the second task is after the first task.

2. The method according to claim 1, characterized in that The determining, according to the destination address of the newly added task in the task queue, the second task that can be executed first includes: Obtaining a destination address of the second task; determining a predetermined path for the robot to perform the second task according to the destination address; A target robot whose actual path of the robot intersects with the predetermined path when executing the first task is queried, and the target robot executes the second task after completing the first task.

3. The method according to claim 2, characterized in that The querying of a target robot whose actual path of the robot intersects with the predetermined path when executing the first task includes: Determine a first position point included in the actual path; Determine a second position point that coincides with the first position point according to the predetermined path; An instruction to execute the second task is sent to the target robot passing the second location point.

4. The method according to claim 1, characterized in that: The method further comprises: If the second task does not exist in the task queue, the robot is assigned to perform the first task according to the remaining working time of the robot.

5. The method according to claim 2, characterized in that: After determining the second task that can be executed first according to the destination address of the newly added task in the task queue, the method further includes: Determining a task to be performed according to the remaining power of the target robot; Determining a new order to be delivered by the target robot according to the task to be performed; When there is no task to be performed, the target robot is controlled to return to the charging station.

6. The method according to claim 5, characterized in that The step of determining a new order to be delivered by the target robot according to the task to be performed includes: Determine whether the current position of the target robot and the destination address of the task to be performed are in the same area; Allocate new orders corresponding to the tasks to be executed in the same area to the target robot.

7. The method according to claim 6, characterized in that The method further comprises: Calculating the shortest path from the current location to the destination address corresponding to the new order; The target robot is dispatched according to the shortest path to complete the delivery task of the new order.

8. The method according to claim 6, characterized in that If the current position and the destination address of the task to be executed are not in the same area, the target robot is scheduled to execute the first task according to the task queue.

9. A transport capacity dispatching device, characterized in that: The device comprises: A first determination module is configured to determine a first task of the robot according to the order to be delivered, wherein the first task is stored in a task queue of the robot according to the order placement time; A scheduling module, configured to sequentially schedule the robot to perform the first task according to the order time; The second determining module is configured to determine a second task that can be executed first according to a destination address of a newly added task in the task queue, wherein the creation time of the second task is after the creation time of the first task.

10. The device according to claim 9, characterized in that The second determining module includes: an acquiring unit, configured to acquire a destination address of the second task; a determination unit, configured to determine a predetermined path for the robot to perform the second task according to the destination address; The query unit is configured to query a target robot whose actual path intersects with the predetermined path when executing the first task, and the target robot executes the second task after completing the first task.

11. The device according to claim 10, characterized in that The query unit comprises: A first determining subunit is configured to determine a first position point included in the actual path; A second determining subunit is configured to determine a second position point that coincides with the first position point according to the predetermined path; The sending unit is configured to send an instruction to execute the second task to the target robot passing the second location point.

12. The device according to claim 9, characterized in that The device also includes: The allocation module is configured to allocate the robot to perform the first task according to the remaining working time of the robot if the second task does not exist in the task queue.

13. The device according to claim 10, characterized in that After the second determining module, the method further includes: A third determination module is configured to determine a task to be performed according to the remaining power of the target robot; A fourth determination module is configured to determine a new order to be delivered by the target robot according to the task to be performed; The control module is configured to control the target robot to return to the charging station when there is no task to be performed.

14. An electronic device comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor implements the method as described in any one of claims 1-8.

15. A computer-readable storage medium, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-8.

Images