Task allocation method and device, equipment and medium

Abstract

The invention discloses a task allocation method and device, equipment and a medium. The method comprises the following steps: determining the state of a to-be-executed task according to the to-be-executed task created in a scene, wherein the state comprises an unprocessed state and a processed state; sorting the to-be-executed tasks in the unprocessed state; and distributing the to-be-executed tasks to the split type robots in sequence according to the sorting result. According to the embodiment of the invention, after the to-be-executed tasks are reordered, the tasks are allocated to the split robot, and the chassis of the split robot is scheduled to orderly complete the to-be-executed tasks. The scheduling scheme of the split robot in the hotel scene is perfected, the task execution efficiency of the split robot applied to the hotel is improved, and orderly operation of the split robot in the man-machine environment is facilitated. The complaint rate that the robot does not complete the task is reduced, and a hotel can schedule the split robot to execute the task in a low-cost and high-efficiency mode.

Description

Technical Field

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

[0002] At present, split robots are often used in the fields of industry and manufacturing; for service robots that are closer to human daily life, the functions of split robots are very limited. Generally, if split robots are used in hotel scenarios, countless services require the use of robot chassis; in the case of limited robot chassis, it is inevitable that multi-task conflicts will occur, and the robot will fall into a stagnant state, which increases the difficulty of scheduling robots in hotels. Therefore, how to avoid task interruption based on the situation of split robots facing multi-task common transportation capacity in hotels and schedule the robot chassis of the split robots to operate in an orderly manner has become an urgent problem to be solved. Summary of the invention

[0003] The present invention provides a task allocation method, device, equipment and medium, which solve the problem of allocating tasks to a robot chassis and scheduling the robot chassis to perform tasks in an orderly manner when a split robot encounters multi-task conflicts in a hotel scene.

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

[0005] Determine the status of the task to be executed according to the task to be executed created in the scenario, wherein the status includes an unprocessed status and a processed status;

[0006] Sorting the unprocessed tasks to be executed;

[0007] The tasks to be executed are allocated to the split robots in order according to the results of the sorting.

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

[0009] A first determining module is configured to determine the status of the to-be-executed task according to the to-be-executed task created in the scenario, wherein the status includes an unprocessed status and a processed status;

[0010] A 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 robots in order according to the results of the sorting.

[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 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 the computer instructions are used to enable the computer to execute a task allocation method as described in any embodiment of the present invention.

[0014] The present invention discloses a task allocation method, device, equipment and medium. The method comprises: determining the status of the tasks to be executed according to the tasks to be executed created in the scene, wherein the status includes an unprocessed state and a processed state; sorting the tasks to be executed in the unprocessed state; and assigning the tasks to be executed to the split robot in order according to the results of the sorting. According to the embodiment of the present invention, after re-sorting the tasks to be executed, tasks are assigned to the split robot, and the chassis of the split robot is scheduled to complete the tasks to be executed in an orderly manner. Not only does it improve the scheduling scheme for the split robot in the hotel scene, but it also improves the task execution efficiency of the split robot used 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's unfinished tasks is reduced, so that the hotel can schedule the split robot to perform tasks in a low-cost and high-efficiency manner.

[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 It is a schematic diagram of an application scenario in which a task allocation method according to an embodiment of the present invention can be implemented;

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

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

[0020] Figure 4 The block diagram is a block diagram of an electronic device for implementing a task allocation 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 in which a task allocation method according to an embodiment of the present invention can be implemented is provided. Figure 1 As shown, the computing device 110 can achieve: determining the status of the tasks to be executed according to the tasks to be executed created in the scene, the status including an unprocessed status and a processed status; sorting the tasks to be executed in the unprocessed status; and assigning the tasks to be executed to the split robot in order according to the sorting result. It is worth noting that: Figure 1 The illustrated application scenario is an example of a task allocation method based on an embodiment of the present invention, but is not intended to be 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] It is worth noting that the split robot used to execute a task allocation method in an embodiment of the present invention is represented in this specification as the chassis of the split robot.

[0027] Embodiment 1

[0028] According to an embodiment of the present application, a task allocation method 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 order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here. Figure 2 As shown, the task allocation method includes the following steps: S210, S220 and S230.

[0029] S210: Determine the status of the task to be executed according to the task to be executed created in the scenario, where the status includes an unprocessed status and a processed status.

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

[0031] S230: Allocate the tasks to be executed to the split robots in order according to the sorting result.

[0032] The step of sorting the unprocessed tasks to be executed comprises: obtaining a task queue in the scene; confirming the unprocessed tasks to be executed in the task queue; and sorting the tasks to be executed according to the priority of each task to be executed.

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

[0034] Exemplarily, the pending tasks are created in the business system, wherein the business system is used to assign the pending tasks to the split robots and receive the completion status of the pending tasks. The split robots execute the received pending tasks in sequence and upload the working status after completing the pending tasks. On the one hand, if the robot completes the pending tasks, the system is requested to change the status of the pending tasks to completed. On the other hand, if the robot does not complete the pending tasks, the system is requested to re-enter the pending tasks into the task queue, waiting for re-assignment, and scheduling a new split robot to complete the pending tasks.

[0035] Specifically, the reordering of the tasks to be executed in the task queue is achieved through the scheduling value assessment system, and the split robot is further scheduled to execute the corresponding task according to the result after the reordering. The value assessment system can connect the customer feedback system and the business system, and provide negative feedback for the tasks to be executed that exceed the working time limit according to the customer feedback system. By evaluating the value of each task to be executed, adjusting the order between different tasks to be executed, and then scheduling the split robot to execute the task, the complaints generated by the uncompleted tasks of the split robot can be reduced; and the task completion rate can be improved.

[0036] Optionally, the working time limit of the tasks to be executed is obtained; tasks to be executed that exceed the working time limit are determined based on a customer feedback system, and corresponding evaluation results are generated; and service revenue is determined based on the service orders created by the user and the corresponding tasks to be executed.

[0037] Optionally, the split robot is configured to process the task to be performed according to evaluation rules set by an administrator.

[0038] Optionally, the pending tasks that exceed the working time limit are determined based on the customer feedback system, and corresponding evaluation results are generated, including: updating the customer feedback system based on the allocation results of historical tasks and the delivery evaluation feedback from users in the scenario; evaluating the pending tasks that exceed the working time limit based on the customer feedback system, and obtaining allocation principles corresponding to this task allocation mechanism.

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

[0040] Furthermore, the task duration consumed by executing the high-priority task inserted later in the task queue is calculated; the task queue is reconstructed according to the working duration and the task duration to obtain a target task queue; the priority of each task to be executed in the task flow is re-sorted according to the target task queue; and the split robot is scheduled to process the task to be executed according to the result of the secondary sorting.

[0041] The present invention discloses a task allocation method. The method comprises: determining the status of the tasks to be executed according to the tasks to be executed created in the scene, wherein the status includes an unprocessed state and a processed state; sorting the tasks to be executed in the unprocessed state; and assigning the tasks to be executed to the split robot in order according to the results of the sorting. According to the embodiment of the present invention, after re-sorting the tasks to be executed, tasks are assigned to the split robot, and the chassis of the split robot is scheduled to complete the tasks to be executed in an orderly manner. Not only does it improve the scheduling scheme for the split robot in the hotel scene, but it also improves the task execution efficiency of the split robot used 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's unfinished tasks is reduced, so that the hotel can schedule the split robot to perform tasks in a low-cost and high-efficiency manner.

[0042] Embodiment 2

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

[0044] The first determining module 310 is configured to determine the status of the to-be-executed task according to the to-be-executed task created in the scenario, wherein the status includes an unprocessed status and a processed status.

[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 performed to the split robots in order according to the sorting result.

[0047] Optionally, the sorting module 320 includes:

[0048] An acquisition unit, configured to acquire a task queue in the scenario;

[0049] A confirmation unit, configured to confirm the tasks to be executed that are in an unprocessed state in the task queue;

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

[0051] Optionally, the device further comprises:

[0052] A sending module, configured to send the task to be performed to the actuator of the split robot;

[0053] a change module, configured to change the state according to the completion status of each to-be-executed task reported by the executor;

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

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

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

[0057] Optionally, the second determination module includes: updating the customer feedback system according to the allocation results of historical tasks and the delivery evaluation feedback from users in the scenario; evaluating the pending tasks that have exceeded the working time limit according to the customer feedback system to obtain the allocation principles corresponding to this task allocation mechanism.

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

[0059] Furthermore, the task duration consumed by executing the high-priority task inserted later in the task queue is calculated; the task queue is reconstructed according to the working duration and the task duration to obtain a target task queue; the priority of each task to be executed in the task flow is re-sorted according to the target task queue; and the split robot is scheduled to process the task to be executed according to the result of the secondary sorting.

[0060] The present invention discloses a task allocation device. The device comprises: a first determination module, configured to determine the state of the task to be executed according to the task to be executed created in the scene, the state including an unprocessed state and a processed state; a sorting module, configured to sort the tasks to be executed in the unprocessed state; and an allocation module, configured to allocate the tasks to be executed to the split robot in order according to the result of the sorting. According to the embodiment of the present invention, after re-sorting the tasks to be executed, tasks are allocated to the split robot, and the chassis of the split robot is scheduled to complete the tasks to be executed in an orderly manner. Not only the scheduling scheme for the split robot in the hotel scene is improved, but also the task execution efficiency of the split robot applied in the hotel is improved, which is conducive to the orderly operation of the split robot in the human-machine environment. The complaint rate of the robot's unfinished tasks is reduced, so that the hotel can schedule the split robot to perform tasks in a low-cost and high-efficiency manner.

[0061] Embodiment 3

[0062] 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.

[0063] like Figure 4 As 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.

[0064] 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.

[0065] 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.

[0066] 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-transient 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): determine the state of the task to be executed according to the task to be executed created in the scene, and the state includes an unprocessed state and a processing completed state; sort the tasks to be executed in the unprocessed state; and assign the tasks to be executed to the split robot in order according to the result of the sorting.

[0067] Embodiment 4

[0068] 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.

[0069] 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.

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

[0071] 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 status of the tasks to be executed based on the tasks to be executed created in the scene, and the status includes an unprocessed status and a processed status; sorts the tasks to be executed in the unprocessed status; and distributes the tasks to be executed to the split robot in order according to the results of the sorting.

[0072] 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).

[0073] 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.

[0074] 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.

[0075] 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.

[0076] 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.

[0077] 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.

[0078] 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).

[0079] 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.

[0080] 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.

[0081] 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.

[0082] 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.

[0083] 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.

[0084] 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 task allocation method, characterized in that: Applied to a split-type robot, the method comprises: Determine the status of the task to be executed according to the task to be executed created in the scenario, wherein the status includes an unprocessed status and a processed status; Sorting the unprocessed tasks to be executed; The tasks to be executed are allocated to the split robots in order according to the results of the sorting.

2. The method according to claim 1, characterized in that The step of sorting the unprocessed tasks to be executed includes: Get the task queue in the scenario; Confirming the pending tasks in the task queue that are in an unprocessed state; The tasks to be executed are sorted according to their priorities.

3. The method according to claim 1, characterized in that: The method further comprises: Sending the task to be executed to the actuator of the split robot; Changing the state according to the completion status of each task to be executed reported by the executor; The tasks to be executed in the task queue are scheduled according to the changed state.

4. The method according to claim 1, characterized in that The method further comprises: Obtaining the working time of the task to be executed; Determine the pending tasks that exceed the time limit according to the customer feedback system, and generate corresponding evaluation results; Determine the service revenue based on the service orders created by the user and the corresponding tasks to be performed.

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

6. The method according to claim 4, characterized in that Determining the tasks to be performed that exceed the working time limit according to the customer feedback system and generating corresponding evaluation results includes: Updating the customer feedback system according to the historical task allocation results and the delivery evaluation feedback from users in the scenario; The to-be-performed tasks that have exceeded the working time limit are evaluated according to the customer feedback system, and an allocation principle corresponding to this task allocation mechanism is obtained.

7. The method according to any one of claims 1 to 6, characterized in that: The working time consumed by the split robot in executing the task flow in the task queue is determined according to the working time efficiency, the evaluation result and the service income.

8. The method according to claim 7, characterized in that The method further comprises: Calculate the task duration consumed by executing the high-priority task inserted later in the task queue; Reconstruct the task queue according to the working duration and the task duration to obtain a target task queue; Re-sorting the priorities of the tasks to be executed in the task flow according to the target task queue; The split robot is scheduled to process the task to be performed according to the result of the secondary sorting.

9. A task allocation device, characterized in that: Applied to a split-type robot, the device comprises: A first determining module is configured to determine the status of the to-be-executed task according to the to-be-executed task created in the scenario, wherein the status includes an unprocessed status and a processed status; A 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 robots in order according to the results of the sorting.

10. The device according to claim 9, characterized in that The sorting module comprises: An acquisition unit, configured to acquire a task queue in the scenario; A confirmation unit, configured to confirm the tasks to be executed that are in an unprocessed state in the task queue; The sorting unit is configured to sort the tasks to be executed according to the priority of each task to be executed.

11. The device according to claim 9, characterized in that The device also includes: A sending module, configured to send the task to be performed to the actuator of the split robot; a change module, configured to change the state according to the completion status of each to-be-executed task reported by the executor; The scheduling module is configured to schedule the tasks to be executed in the task queue according to the changed state.

12. The device according to claim 9, characterized in that The device also includes: An acquisition module is configured to acquire the working time efficiency of the task to be executed; A second determination module is configured to determine the pending tasks that exceed the work time limit according to the customer feedback system, and generate corresponding evaluation results; The third determination module is configured to determine the service revenue according to the service order created by the user and the corresponding task to be executed.

13. The device according to claim 12, characterized in that Also includes: The configuration module is configured to configure the split robot to process the task to be executed according to the evaluation rules set by the administrator.

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