A task allocation method, apparatus, device and medium

Abstract

A task allocation method, device, equipment and medium are disclosed. The method comprises: determining the state of a to-be-executed task created in a scene, the state comprising an unprocessed state and a processing completed state; sorting the to-be-executed task in the unprocessed state; and allocating the to-be-executed task to the split robot in order according to the sorting result. By reordering the to-be-executed task and allocating the task to the split robot, the chassis of the split robot is scheduled to complete the to-be-executed task in order. The method not only improves the scheduling scheme of the split robot in the hotel scene, but also improves the task execution efficiency of the split robot in the hotel, which is conducive to the orderly operation of the split robot in the human-machine environment. The complaint rate of the robot not completing the task is reduced, and the hotel can schedule the split robot to execute the task in a low-cost and efficient manner.

Description

Technical Field

[0001] This invention relates to the field of artificial intelligence technology, and in particular to a task allocation method, apparatus, device, and medium. Background Technology

[0002] Currently, modular robots are primarily used in industrial and manufacturing sectors. However, their functionality is significantly limited for service robots, which are more closely integrated into daily life. For example, if modular robots are used in a hotel setting, numerous services require the use of robot chassis. Given the limited number of chassis, this inevitably leads to multi-tasking conflicts and stagnation, increasing the difficulty of robot scheduling within the hotel. Therefore, how to prevent task interruptions and ensure the orderly operation of the robot chassis in hotels when faced with multiple tasks requiring shared capacity has become a pressing issue. Summary of the Invention

[0003] This invention provides a task allocation method, apparatus, device, and medium, which solves the problem of allocating tasks to the robot chassis and scheduling the robot chassis to execute tasks in an orderly manner when multiple tasks conflict in a hotel setting.

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

[0005] The status of the task to be executed is determined based on the task to be executed created in the scenario, and the status includes an unprocessed status and a processed status.

[0006] Sort the unprocessed tasks to be executed.

[0007] The tasks to be executed are assigned to the split-type robots in order according to the sorting results.

[0008] According to a second aspect of the present invention, a task allocation device is provided, the device comprising:

[0009] The first determining module is configured to determine the state of the task to be executed based on the task to be executed created in the scenario, the state including an unprocessed state and a processed state.

[0010] The sorting module is configured to sort the unprocessed tasks to be executed;

[0011] The allocation module is configured to allocate the tasks to be executed to the split-type robot in order according to the sorting result.

[0012] According to a third aspect of the present invention, an electronic device is provided, 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, the instructions being executed by the at least one processor to cause the at least one processor to implement a task allocation 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 computer instructions are provided for causing the computer to perform a task allocation method as described in any embodiment of the present invention.

[0014] This invention discloses a task allocation method, apparatus, device, and medium. The method includes: determining the state of the tasks to be executed based on tasks created in a scenario, the states including unprocessed and completed states; sorting the unprocessed tasks; and allocating the tasks to be executed to a split-type robot in order according to the sorting result. Using this embodiment, by reordering the tasks to be executed and then assigning them to the split-type robot, the chassis of the split-type robot is scheduled to complete the tasks in an orderly manner. This not only improves the scheduling scheme for split-type robots in hotel scenarios but also enhances the task execution efficiency of split-type robots in hotels, facilitating the orderly operation of split-type robots in human-machine environments. It reduces the complaint rate of robots failing to complete tasks, enabling hotels to schedule split-type robots to perform tasks in a low-cost and high-efficiency manner.

[0015] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description

[0016] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0017] Figure 1 This is a schematic diagram of an application scenario that can implement a task allocation method according to an embodiment of the present invention;

[0018] Figure 2 This is a flowchart illustrating a task allocation method according to an embodiment of the present invention;

[0019] Figure 3This is a schematic diagram of the structure of a task allocation device according to an embodiment of the present invention;

[0020] Figure 4 This is a block diagram of an electronic device used to implement a task allocation method according to an embodiment of the present invention. Detailed Implementation

[0021] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort 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, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0023] Figure 1 A schematic diagram illustrating an application scenario for implementing a task allocation method according to an embodiment of the present invention is provided. For example... Figure 1 As shown, the computing device 110 can: determine the state of the tasks to be executed based on the tasks created in the scene, the states including an unprocessed state and a processed state; sort the tasks to be executed in the unprocessed state; and assign the tasks to be executed to the split-type robot in order according to the sorting result. It is worth noting that: Figure 1 The application scenario shown is an example of a task allocation method based on an embodiment of the present invention, and is not intended to limit the scope of the invention.

[0024] It should be noted that the aforementioned computing device 110 can be either 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 as a single server or a single terminal device. When the computing device 110 is software (e.g., a program or system for controlling a robot), it can be installed in the hardware devices listed above. It can be implemented as, for example, multiple software programs or software modules used to provide distributed services, or as a single software program or software module. No specific limitations are made here.

[0025] It should be understood that Figure 1 The number of computing devices shown is merely illustrative. Any number of computing devices can be used depending on implementation needs.

[0026] It is worth noting that the split robot used to perform a task allocation method in an embodiment of the present invention is referred to in this specification as the chassis of the split robot.

[0027] Example 1

[0028] According to embodiments of this application, a task allocation method is provided. It should be noted that the steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowcharts, in some cases, the steps shown or described may be executed in a different order than that presented here. Figure 2 As shown, this task allocation method includes the following steps: S210, S220 and S230.

[0029] S210. Determine the status of the task to be executed based on the task to be executed created in the scenario. The status includes an unprocessed status and a completed status.

[0030] S220. Sort the unprocessed tasks to be executed.

[0031] S230. The tasks to be executed are assigned to the split-type robot in order according to the sorting results.

[0032] The step of sorting the unprocessed tasks to be executed includes: obtaining the task queue in the scenario; identifying the unprocessed tasks to be executed in the task queue; and sorting the tasks to be executed according to their priority.

[0033] Optionally, the tasks to be executed are sent to the actuators of the split-type robot; the status is changed according to the completion status of each task to be executed reported by the actuators; and the tasks to be executed in the task queue are scheduled according to the changed status.

[0034] For example, the task to be executed is created in the business system, which assigns the task to the split robot and receives the completion status of the task. The split robot executes the received tasks sequentially and uploads its work status after completing the task. On one hand, if the robot completes the task, it requests the system to change the status of the task to "completed". On the other hand, if the robot does not complete the task, it requests the system to re-enter the task into the task queue, waiting for reassignment and scheduling a new split robot to complete the task.

[0035] Specifically, a scheduling value assessment system reorders the tasks in the task queue, and then schedules the split-type robots to execute the corresponding tasks based on the reordering results. The value assessment system connects to the customer feedback system and the business system, providing negative feedback on tasks exceeding their time limits based on customer feedback. By evaluating the value of each task and adjusting the order between different tasks, the split-type robots are scheduled to execute tasks, thereby reducing complaints arising from unfinished tasks by the split-type robots and improving the task completion rate.

[0036] Optionally, the timeframe of the tasks to be executed is obtained; tasks exceeding the timeframe are identified based on customer feedback and corresponding evaluation results are generated; and service revenue is determined based on user-created service orders and corresponding tasks to be executed.

[0037] Optionally, the split-type robot can be configured to handle the task to be performed according to the evaluation rules set by the administrator.

[0038] Optionally, the step of determining the pending tasks that exceed the working time limit based on the customer feedback system and generating corresponding evaluation results includes: updating the customer feedback system based on the historical task allocation results and the delivery evaluations provided by users in the scenario; evaluating the pending tasks that exceed the working time limit based on the customer feedback system to obtain the allocation principle corresponding to the current task allocation mechanism.

[0039] Optionally, the working time consumed by the split robot in executing the task flow in the task queue is determined based on the working efficiency, the evaluation results, and the service revenue.

[0040] Furthermore, the task duration consumed by the high-priority tasks inserted later in the task queue is calculated; the task queue is reconstructed based on the work duration and the task duration to obtain a target task queue; the priority of each task to be executed in the task flow is reordered a second time based on the target task queue; and the split robot is scheduled to process the tasks to be executed based on the result of the second sorting.

[0041] This invention discloses a task allocation method. The method includes: determining the state of the tasks to be executed based on tasks created in a scenario, the states including unprocessed and completed states; sorting the unprocessed tasks; and allocating the tasks to be executed to the split-type robot in order according to the sorting result. Using this embodiment, by reordering the tasks to be executed and then assigning them to the split-type robot, the chassis of the split-type robot is scheduled to complete the tasks in an orderly manner. This not only improves the scheduling scheme for split-type robots in hotel scenarios but also enhances the task execution efficiency of split-type robots in hotels, facilitating the orderly operation of split-type robots in human-machine environments. It reduces the complaint rate of robots failing to complete tasks, enabling hotels to schedule split-type robots to perform tasks in a low-cost and high-efficiency manner.

[0042] Example 2

[0043] According to an embodiment of the present invention, a schematic diagram of a task allocation device is provided, which can execute a task allocation method provided in Embodiment 1 above. Figure 3 As shown, the device includes: a first determining module 310, a sorting module 320, and an allocation module 330. Wherein:

[0044] The first determining module 310 is configured to determine the state of the task to be executed based on the task to be executed created in the scenario, the state including an unprocessed state and a processed state.

[0045] The sorting module 320 is configured to sort the unprocessed tasks to be executed.

[0046] The allocation module 330 is configured to allocate the tasks to be executed to the split-type robot in order according to the sorting result.

[0047] Optionally, the sorting module 320 includes:

[0048] The acquisition unit is configured to acquire the task queue in the scenario;

[0049] The confirmation unit is configured to confirm the unprocessed tasks in the task queue.

[0050] The sorting unit is configured to sort the tasks to be executed according to their priority.

[0051] Optionally, the device further includes:

[0052] The sending module is configured to send the task to be executed to the actuator of the split robot;

[0053] The change module is configured to change the status based on the completion status of each task to be executed reported by the executor;

[0054] The scheduling module is configured to schedule the tasks to be executed in the task queue based on the changed state.

[0055] Furthermore, the device also includes: an acquisition module configured to acquire the working timeliness of the task to be executed; a second determination module configured to determine the task to be executed that exceeds the working timeliness based on the customer feedback system, and generate a corresponding evaluation result; and a third determination module configured to determine the service revenue based on the service order created by the user and the corresponding task to be executed.

[0056] Optionally, the device further includes a configuration module configured to configure the split-type robot to handle the task to be performed according to evaluation rules set by the administrator.

[0057] Optionally, the second determining module includes: updating the customer feedback system based on the allocation results of historical tasks and the delivery evaluations provided by users in the scenario; and evaluating the pending tasks that have exceeded the working time limit based on the customer feedback system to obtain the allocation principle corresponding to the current task allocation mechanism.

[0058] Optionally, the working time consumed by the split robot in executing the task flow in the task queue is determined based on the working efficiency, the evaluation results, and the service revenue.

[0059] Furthermore, the task duration consumed by the high-priority tasks inserted later in the task queue is calculated; the task queue is reconstructed based on the work duration and the task duration to obtain a target task queue; the priority of each task to be executed in the task flow is reordered a second time based on the target task queue; and the split robot is scheduled to process the tasks to be executed based on the result of the second sorting.

[0060] This invention discloses a task allocation device. The device includes: a first determining module, configured to determine the state of the tasks to be executed based on tasks created in a scenario, the states including an unprocessed state and a completed state; a sorting module, configured to sort the unprocessed tasks; and an allocation module, configured to allocate the tasks to be executed to the split-type robot in order according to the sorting result. By reordering the tasks to be executed and then allocating them to the split-type robot, the chassis of the split-type robot is scheduled to complete the tasks in an orderly manner. This not only improves the scheduling scheme for split-type robots in hotel scenarios but also enhances the task execution efficiency of split-type robots in hotels, facilitating the orderly operation of split-type robots in human-machine environments. It reduces the complaint rate of robots failing to complete tasks, enabling hotels to schedule split-type robots to perform tasks in a low-cost and high-efficiency manner.

[0061] Example 3

[0062] The following is for reference. Figure 4 This document illustrates a structural diagram of an electronic device 400 suitable for implementing embodiments 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 processors, cellular phones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.

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

[0064] The RAM 430 also stores various programs and data required for the operation of the electronic device 400. The processing device 410, ROM 420, and RAM 430 are interconnected via bus 440. The input / output (I / O) interface 450 is also connected to bus 440.

[0065] Typically, the following devices can be connected to I / O interface 450: input devices 460 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 470 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices 480 including, for example, magnetic tapes, hard disks, etc.; and communication devices 490. Communication device 490 allows electronic device 400 to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 4 An electronic device 400 with various devices is shown; however, it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed alternatively.

[0066] In particular, according to embodiments of the present invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of the present invention include a computer program product comprising a computer program carried on a non-transitory computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via 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, it performs the functions defined in the methods of the embodiments of the present invention. Alternatively, in other embodiments, the processing device 410 can be configured by any other suitable means (e.g., by means of firmware) to perform the following: determining the state of the tasks to be performed based on tasks created in a scenario, the states including an unprocessed state and a processed state; sorting the tasks to be performed in the unprocessed state; and assigning the tasks to be performed to the split-type robot in order according to the sorting result.

[0067] Example 4

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

[0069] In some implementations, clients and servers can communicate using any currently known or future-developed network protocol such as HTTP (Hypertext Transfer Protocol) and can interconnect with digital data communication (e.g., communication networks) of any form or medium. Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), the Internet (e.g., the Internet of Things), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future-developed networks.

[0070] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device.

[0071] The aforementioned computer-readable medium carries one or more programs, which, when executed by the electronic device, cause the electronic device to: determine the state of the tasks to be executed based on the tasks created in the scenario, the states including an unprocessed state and a processed state; sort the tasks to be executed in the unprocessed state; and assign the tasks to be executed to the split-type robot in order according to the sorting result.

[0072] Computer program code for performing the operations of this invention can 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, and C++, as well as conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone 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 remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0073] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0074] The modules described in the embodiments of the present invention can be implemented in software or hardware. The names of the modules are not, in some cases, limiting the scope of the module itself.

[0075] The functions described above herein can be performed at least in part by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, 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-a-chip (SoCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof, etc.

[0076] The program code used to implement the methods of the present invention can be written in any combination of one or more programming languages. This program code can be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing device, such that when executed by the processor or controller, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code can be executed entirely on the machine, partially on the machine, as a standalone software package partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0077] In the context of this invention, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. Machine-readable media can include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0078] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor); and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the computer. Other types of devices can also be used to provide interaction with the user; for example, 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 sound input, voice input, or tactile input).

[0079] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or computing systems that include middleware components (e.g., application servers), or computing systems that include frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0080] Computer systems can include clients and servers. Clients and servers are generally geographically separated and typically interact via communication networks. The client-server relationship is established by computer programs running on the respective computers and having a client-server relationship with each other. A server can be a cloud server, also known as a cloud computing server or cloud host, a hosting product within the cloud computing service ecosystem that addresses the management difficulties and weak business scalability inherent in traditional physical hosting and VPS services. Servers can also be servers for distributed systems or servers integrated with blockchain technology.

[0081] Artificial intelligence (AI) is the study of enabling computers to simulate certain human thought processes and intelligent behaviors (such as learning, reasoning, thinking, and planning). It encompasses both hardware and software technologies. AI hardware technologies generally include sensors, dedicated AI chips, cloud computing, distributed storage, and big data processing. AI software technologies mainly include computer vision, speech recognition, natural language processing, machine learning / deep learning, big data processing, and knowledge graph technologies.

[0082] Cloud computing refers to a technology system that enables access to a shared pool of physical or virtual resources via a network. These 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 applications such as artificial intelligence and blockchain, as well as for model training.

[0083] It should be understood that the various forms of processes shown above can be used to rearrange, add, or delete steps. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution provided by this invention can be achieved, and this is not limited herein.

[0084] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A task allocation method, characterized in that, Applied to split-type robots, the method includes: The status of the task to be executed is determined based on the task to be executed created in the scenario, and the status includes an unprocessed status and a processed status. Sort the unprocessed tasks to be executed. The tasks to be executed are assigned to the split-type robots in order according to the sorting results; The process of sorting the unprocessed tasks to be executed includes: Obtain the task queue in the scenario; Confirm the tasks in the task queue that are in an unprocessed state and await execution; The tasks to be executed are sorted according to their priority.

2. The method according to claim 1, characterized in that, The method further includes: Send the task to be executed to the actuator of the split robot; The status is changed according to the completion status of each task to be executed reported by the actuator; The tasks to be executed in the task queue are scheduled according to the changed state.

3. The method according to claim 1, characterized in that, The method further includes: Obtain the timeframe for the task to be executed; Based on the customer feedback system, tasks that have exceeded the specified timeframe are identified and corresponding evaluation results are generated. Service revenue is determined based on the service orders created by the user and the corresponding tasks to be executed.

4. The method according to claim 3, characterized in that, Also includes: The split-type robot is configured to handle the task to be performed according to the evaluation rules set by the administrator.

5. The method according to claim 3, characterized in that, The step of identifying pending tasks that exceed the work deadline based on the customer feedback system and generating corresponding evaluation results includes: The customer feedback system is updated based on the historical task allocation results and the delivery evaluations provided by users in the scenario. Based on the customer feedback system, tasks that have exceeded the work time limit are evaluated, and the allocation principle corresponding to this task allocation mechanism is obtained.

6. The method according to any one of claims 3-5, characterized in that, The working time consumed by the split robot in executing the task flow in the task queue is determined based on the working efficiency, the evaluation results, and the service revenue.

7. The method according to claim 6, characterized in that, The method further includes: Calculate the time consumed by executing the high-priority task inserted later in the task queue; The task queue is reconstructed based on the working duration and the task duration to obtain the target task queue; The priorities of each task to be executed in the task flow are reordered a second time according to the target task queue; The split-type robot is scheduled to process the task to be executed based on the result of the secondary sorting.

8. A task allocation device, characterized in that, The device, applied to a split-type robot, includes: The first determining module is configured to determine the state of the task to be executed based on the task to be executed created in the scenario, the state including an unprocessed state and a processed state. The sorting module is configured to sort the unprocessed tasks to be executed; The allocation module is configured to allocate the tasks to be executed to the split-type robot in order according to the sorting result; The sorting module includes: The acquisition unit is configured to acquire the task queue in the scenario; The confirmation unit is configured to confirm the unprocessed tasks in the task queue. The sorting unit is configured to sort the tasks to be executed according to their priority.

9. The apparatus according to claim 8, characterized in that, The device further includes: The sending module is configured to send the task to be executed to the actuator of the split robot; The change module is configured to change the status based on the completion status of each task to be executed reported by the executor; The scheduling module is configured to schedule the tasks to be executed in the task queue based on the changed state.

10. The apparatus according to claim 8, characterized in that, The device further includes: The acquisition module is configured to acquire the working timeframe of the task to be executed; The second determination module is configured to determine tasks to be performed that have exceeded the work time limit based on the customer feedback system, and generate corresponding evaluation results; The third determination module is configured to determine service revenue based on the service orders created by the user and the corresponding tasks to be executed.

11. The apparatus according to claim 10, characterized in that, Also includes: The configuration module is configured to configure the split-type robot to handle the task to be executed according to the evaluation rules set by the administrator.

12. 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 to cause the at least one processor to implement the method as described in any one of claims 1-7.

13. A computer-readable storage medium storing computer instructions, wherein, The computer instructions are used to cause the computer to perform the method according to any one of claims 1-7.

Images