A scheduling method, electronic device and storage medium

Abstract

The present application discloses a scheduling method applicable to a server, comprising: S11, determining whether a task to be processed in a first area satisfies a first condition; S12, if so, mobilizing a robot in a second area that satisfies a second condition to perform the task to be processed. The present application also provides an electronic device and a storage medium. The scheduling method proposed in the present application can flexibly schedule the number and work of robots in each area according to the workload of the robots in each area. In the scheduling, each area has at least one robot serving it, thereby improving the overall utilization of robot resources and improving the efficiency of robot services.

Description

Technical Field

[0001] The present application belongs to the field of automatic control, and in particular relates to a scheduling method, an electronic device and a storage medium. Background Art

[0002] The demand for online ordering has become a common demand of people from all walks of life. In addition to traditional dine-in and take-out food, food delivery software has emerged in recent years to provide restaurants and diners with a convenient tool, solving the problem of information asymmetry between restaurants and diners, and reducing the waiting time for users to pick up their meals. However, with the popularity of food delivery software users, the time required to wait for delivery when ordering food online is gradually increasing. After the user places an order for food delivery, the order is generally received by the food delivery staff, and then the food is delivered to the corresponding address according to the delivery address on the order. At present, due to some special areas (for example, science and technology parks, buildings, etc.), or special reasons (such as epidemic reasons), delivery robots are increasingly used in life.

[0003] With the popularization of robots, more and more places, such as stores, hotels, restaurants, shopping malls, etc., are equipped with at least one robot to provide services. However, since robots can only serve in the corresponding configured areas, when facing chain stores, hotels, restaurants and other areas, robots cannot provide cross-regional services. This results in low resource utilization of robots, low efficiency, and poor user experience.

[0004] The preceding description is intended to provide general background information and does not necessarily constitute prior art.

[0005] Application Contents

[0006] The purpose of this application is to solve the problems and defects in the prior art, and propose a scheduling method, electronic device and storage medium. The scheduling method proposed in this application can flexibly schedule the number and work of robots in each area according to the workload of containers and robots in each area, thereby improving the resource utilization of robots and containers as a whole and thoroughly improving the service efficiency of robots.

[0007] The present application provides a scheduling method, applicable to a server, the method comprising:

[0008] S11, determining whether the tasks to be processed in the first area meet the first condition;

[0009] S12: If yes, mobilize the robots in the second area that meet the second condition to execute the task to be processed.

[0010] Preferably, the first condition includes at least one of the following:

[0011] The amount of tasks to be processed in the first area meets a first preset amount;

[0012] The first area does not have item information corresponding to the task to be processed.

[0013] Preferably, the second condition includes at least one of the following:

[0014] The second area robot is in a movable state;

[0015] The distance between the second area and the first area satisfies a preset first distance;

[0016] The second area contains item information corresponding to the task to be processed.

[0017] Preferably, it also includes:

[0018] Determining whether the tasks to be processed in the first area meet a third condition;

[0019] If so, the robot is mobilized to return to the second area.

[0020] Preferably, the third condition includes at least one of the following:

[0021] The amount of tasks to be processed in the first area meets a second preset amount;

[0022] The first area obtains item information corresponding to the task to be processed;

[0023] The second area has and / or obtains item information corresponding to the task to be processed.

[0024] Preferably, it also includes:

[0025] Determine whether the tasks to be processed in the second area meet the fourth condition;

[0026] If so, the robot is mobilized to return to the second area.

[0027] Preferably, the fourth condition includes at least one of the following:

[0028] The amount of tasks to be processed in the second area meets a third preset amount;

[0029] The second area does not have item information corresponding to the task to be processed, and the first area has and / or obtains item information corresponding to the task to be processed.

[0030] Preferably, after the step in which the tasks to be processed in the second area meet the fourth condition, the method further includes:

[0031] Mobilize the robots in the third area that meet the fifth condition;

[0032] The fifth condition includes at least one of the following:

[0033] The third area robot is in a movable state;

[0034] The third area meets a preset second distance condition.

[0035] The present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor is configured to implement the steps of the scheduling method described above when executing the computer program stored in the memory.

[0036] The present application also provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of the scheduling method described above are implemented.

[0037] Beneficial effects of this application:

[0038] The scheduling method proposed in this application can flexibly schedule the number and work of robots in each area according to the workload of the robots in each area. In the scheduling, there is at least one robot serving each area, thereby improving the overall utilization of robot resources and thoroughly improving the robot service efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present application, and together with the specification, are used to explain the principles of the present application. 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 are 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.

[0040] Figure 1 A flowchart of a scheduling method provided in an embodiment of the present application;

[0041] Figure 2 A schematic diagram of a process for mobilizing a robot to return provided in an embodiment of the present application;

[0042] Figure 3 A schematic diagram of a process for mobilizing a robot to return provided in an embodiment of the present application;

[0043] Figure 4 Schematic diagram of the arrangement of containers and robots in the embodiment.

[0044] Description of Figure Numbers:

[0045] 1- First robot;

[0046] 2- Second robot;

[0047] 3- The third robot;

[0048] 4- The fourth robot. DETAILED DESCRIPTION

[0049] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0050] It should be noted that, in this article, the terms "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "includes a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element. In addition, components, features, and elements with the same name in different embodiments of the present application may have the same meaning or different meanings, and their specific meanings need to be determined by their explanation in the specific embodiment or further combined with the context of the specific embodiment.

[0051] It should be understood that, although the terms first, second, third, etc. may be used to describe various information in this article, these information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of this article, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein can be interpreted as "at the time of" or "when" or "in response to determination". Furthermore, as used in this article, the singular forms "one", "one" and "the" are intended to also include plural forms, unless there is an opposite indication in the context. It should be further understood that the terms "comprising" and "including" indicate the presence of the described features, steps, operations, elements, components, projects, kinds, and / or groups, but do not exclude the presence, occurrence or addition of one or more other features, steps, operations, elements, components, projects, kinds, and / or groups. The terms "or", "and / or", "including at least one of the following" used in this application, etc. can be interpreted as inclusive, or mean any one or any combination. For example, “comprising at least one of the following: A, B, C” means “any of the following: A; B; C; A and B; A and C; B and C; A and B and C”, and for another example, “A, B or C” or “A, B and / or C” means “any of the following: A; B; C; A and B; A and C; B and C; A and B and C”. An exception to this definition will only occur when a combination of elements, functions, steps or operations are inherently mutually exclusive in some manner.

[0052] It should be understood that, although the various steps in the flowchart in the embodiment of the present application are displayed in sequence according to the indication of the arrows, these steps are not necessarily performed in sequence in the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and it can be performed in other orders. Moreover, at least a portion of the steps in the figure may include a plurality of sub-steps or a plurality of stages, and these sub-steps or stages are not necessarily performed at the same time, but can be performed at different times, and their execution order is not necessarily performed in sequence, but can be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.

[0053] As used herein, the words "if" and "if" may be interpreted as "at the time of" or "when" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrases "if it is determined" or "if (stated condition or event) is detected" may be interpreted as "when it is determined" or "in response to determining" or "when detecting (stated condition or event)" or "in response to detecting (stated condition or event)", depending on the context.

[0054] It should be noted that, in this article, step codes such as S1, S2, etc. are used for the purpose of expressing the corresponding content more clearly and concisely, and do not constitute a substantial limitation on the order. When implementing the step, those skilled in the art may execute S4 first and then S3, etc., but these should all be within the scope of protection of this application.

[0055] It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0056] In the subsequent description, the suffixes such as "module", "component" or "unit" used to represent elements are only used to facilitate the description of the present application and have no specific meaning. Therefore, "module", "component" or "unit" can be used in a mixed manner.

[0057] like Figure 1 As shown, the process of a scheduling method provided in an embodiment of the present application is intended, and the method is applicable to a server, including:

[0058] S11, determining whether the tasks to be processed in the first area meet the first condition;

[0059] S12: If yes, mobilize the robots in the second area that meet the second condition to execute the task to be processed.

[0060] In one embodiment of the present application, in order to reasonably allocate robot resources to improve the utilization rate of robots, that is, to enable robots to be dispatched in multiple service areas to provide cross-regional services. Since the services that robots in each area can provide within a period of time are limited, for example, the maximum number of tasks processed in one hour is 10. When the tasks to be processed exceed the upper limit of the services that the robot can provide, the tasks are in a backlog state, that is, a pending state. Therefore, in an embodiment of the present application, it is necessary to monitor the pending tasks in the first area. When the number of pending tasks reaches a certain value, such as 50 pending tasks, it is necessary to mobilize robots in other areas to assist in processing; in an embodiment of the present application, since the robot mainly provides services to the configured area, when the first area receives the pending tasks, the robots in the first area cannot provide corresponding services, for example, there is no commodity information corresponding to the pending tasks in the first area, then it is necessary to mobilize robots in other areas to obtain the corresponding commodities from the corresponding area, and then go to the first area to assist in processing.

[0061] In the actual business processing procedure, the specific pending tasks are processed by the robots of which area or counter, and the corresponding pending tasks must also belong to that area or counter. Therefore, a better implementation method is that when the amount of pending tasks in the first area reaches a certain value and the robot cannot process them in time, resulting in a backlog of tasks, or when the robot cannot provide corresponding services for the pending tasks received by the first area, the corresponding pending tasks will be assigned to other areas that can handle them for processing.

[0062] In an embodiment of the present application, when the pending tasks in the first area need to mobilize robots in other areas to assist in processing, or the pending tasks need to be assigned to other areas for processing. In practice, a brand of goods is usually set up with counters or specialty stores in multiple areas, so when assigning pending tasks to other areas other than the first area, it is necessary to screen these areas, for example, the robots in other areas are in a state that can be mobilized; for example, other areas should be close to the first area and can meet the processing time limit or processing distance of the pending tasks; for example, other areas store goods that are not in the first area, or goods corresponding to the pending tasks; preferably, in this embodiment, when the amount of pending tasks in the first area reaches a certain value, the second area where the robot is in a mobilized state is selected for mobilization; when the first area does not have the item information corresponding to the pending tasks, the second area with the item is selected for mobilization; in an embodiment, for the aforementioned selection of the second area based on the amount of tasks or item information, the distance between the other areas and the first area can be further judged, and the second area closest to the first area is selected, or the second area that can meet the processing distance or processing time limit corresponding to the pending tasks is selected for mobilization.

[0063] like Figure 2 As shown, it is a schematic diagram of the process of mobilizing the robot to return provided in an embodiment of the present application, and the method includes:

[0064] Determining whether the tasks to be processed in the first area meet a third condition;

[0065] If so, the robot is mobilized to return to the second area.

[0066] In one embodiment of the present application, after the mobilized robot has completed the pending tasks in the first area, it will automatically return to the configured area to provide services; in order to save unnecessary power consumption caused by the robot running back and forth, a better way is that after the robot completes the task, it stays in the first area to continue to provide services. In practice, considering that after the robot completes the pending tasks in the first area, the amount of pending tasks in the first area decreases, so that the robots configured in the first area can meet the completion, it is necessary to control the mobilized robot to return to the configured area to provide services; another better way is to control the mobilized robot to return to the second area after obtaining the information that the corresponding items have been delivered in the first area.

[0067] In a preferred implementation of the present application, when the first area continues to receive the same tasks to be processed, that is, there is no corresponding product in the first area but there is one in the second area, the mobilized robot is controlled to return to the second area to obtain the product and continue to be mobilized to the first area to perform the processing task.

[0068] like Figure 3 As shown, it is a schematic diagram of the process of mobilizing the robot to return provided in an embodiment of the present application, and the method includes:

[0069] Determine whether the tasks to be processed in the second area meet the fourth condition;

[0070] If so, the robot is mobilized to return to the second area.

[0071] In one embodiment of the present application, after the robot in the second area is mobilized to the first area to provide services, the level of pending tasks that the second area can handle decreases. When the pending tasks in the second area reach a certain value, such as 100 orders, it is necessary to control the mobilized robot to return to the second area to provide services. Since the first area still needs to mobilize robots to assist in providing services after the robot is mobilized to return to the second area, a better third area is selected to mobilize the corresponding robot to continue to provide services. In an embodiment of the present application, when the second area does not receive the commodity information corresponding to the pending tasks, and the first area has the corresponding commodity information, the mobilized robot is controlled to obtain the commodity and then return to the second area; in another embodiment of the present application, when the second area does not receive the commodity information corresponding to the pending tasks, and the third area has the corresponding commodity information, according to the aforementioned method, the third area closest to the second area is selected. When there are not enough robots in the second area or the third area to perform the pending tasks, the mobilized robot is controlled to go to the third area to obtain the commodity and then return to the second area.

[0072] In one embodiment of the present application, after the second area's pending tasks meet the fourth condition, when the robot in the second area returns and still cannot handle the pending tasks, the third area where the robot is in a movable state is selected for mobilization; in a preferred embodiment, when selecting the third area, the third area that meets a certain distance condition with the second area is preferably selected, such as 10 kilometers. The above is only an exemplary description of selecting the third area. Within the scope of the present application, other judgment bases for mobilizing the robot in the third area are all within the protection scope of the present application. Specific embodiment 1

[0074] like Figure 4 As shown, in this embodiment 1, three service areas are provided, namely area A, area B and area C. A first robot 1 and a first container are arranged in area A, a second robot 2, a fourth robot 4 and a second container are arranged in area B, and a third robot 3 and a third container are arranged in area C.

[0075] When a user in area A places an order for a product, user order information is generated. The user order information includes goods order information (goods, contents, etc.), delivery address information (user address) and delivery deadline information (calculated from the time the order is placed, the duration is a default value or a variable value).

[0076] After the backend receives the user's order information, it checks the first container in area A to see whether there is corresponding goods.

[0077] If the first container is found to be sold out or does not exist after querying, the backend will send a query request to the second container in area B and the third container in area C. If the second and third containers are found to have the same product after querying, the backend will compare the distances of area B and area C relative to area A. After comparison, the backend will find that area B is closer to area A, so the backend will assign the user's order information to area B.

[0078] After confirming that the product is taken from the second container in area B, the background determines whether the second robot 2 and the fourth robot 4 in area B are idle at the current moment. At this time, if the second robot 2 is idle and the fourth robot 4 is busy, the second robot 2 will take the product from the second container and perform the delivery task to the location of the user in area A. More preferably, picking up the product from containers in different areas and then delivering it will likely extend the delivery time. Therefore, in order to avoid waiting for the user, the background sends the user an estimated timeout reminder. Only after the user confirms can the delivery deadline be extended and the delivery be performed.

[0079] After the second robot 2 completes the delivery, the backend checks whether there are other robots working in area B. After checking, it is found that the fourth robot 4 is still in area B, so the backend instructs the second robot 2 to stay in area A to assist the first robot 1. That is, on the basis of leaving at least one robot in each area, the principle of robots following the principle of not running with empty goods as much as possible is followed.

[0080] The multi-machine and multi-container scheduling method proposed in this embodiment 1 can flexibly schedule the number and work of robots in each area according to the workload and cargo supply of containers and robots in each area. During the scheduling, there is at least one robot serving each area, thereby improving the overall resource utilization of robots and containers and thoroughly improving the robot service efficiency. Specific embodiment 2

[0082] Another example Figure 4 As shown, in this embodiment 2, three service areas are provided, namely area A, area B and area C. A first robot 1 and a first container are arranged in area A, a second robot 2, a fourth robot 4 and a second container are arranged in area B, and a third robot 3 and a third container are arranged in area C.

[0083] When a user in area A places an order for a product, user order information is generated. The user order information includes goods order information (goods, contents, etc.), delivery address information (user address) and delivery deadline information (calculated from the time the order is placed, the duration is a default value or a variable value).

[0084] After the backend receives the user's order information, it checks the first container in area A to see whether there is corresponding goods.

[0085] If the first container is found to be sold out or does not exist after querying, the backend will send a query request to the second container in area B and the third container in area C. If the second and third containers are found to have the same product after querying, the backend will compare the distances of area B and area C relative to area A. After comparison, the backend will find that area B is closer to area A, so the backend will assign the user's order information to area B.

[0086] After confirming that the product is taken from the second container in area B, the background determines whether the second robot 2 and the fourth robot 4 in area B are idle at the current moment. At this time, the second robot 2 and the fourth robot 4 are busy, and the first robot 1 goes to area B to pick up the product from the second container and performs the delivery task to the user's location in area A. More preferably, picking up the product from containers in different areas and then delivering it may extend the delivery time. Therefore, in order to avoid users waiting, the background sends an estimated timeout reminder to the user. Only after the user confirms can the delivery deadline be extended and the delivery be performed.

[0087] The multi-machine and multi-container scheduling method proposed in this embodiment 2 can flexibly schedule the number and work of robots in each area according to the workload and cargo supply of containers and robots in each area. During the scheduling, there is at least one robot serving each area, thereby improving the overall resource utilization of robots and containers and thoroughly improving the robot service efficiency. Specific embodiment 3

[0089] Another example Figure 4 As shown, in this embodiment 3, three service areas are provided, namely area A, area B and area C. A first robot 1 and a first container are arranged in area A, a second robot 2, a fourth robot 4 and a second container are arranged in area B, and a third robot 3 and a third container are arranged in area C.

[0090] When the number of tasks to be completed received by the first robot 1 in area A is greater than or equal to 6 (6 is the threshold value, the value is adjustable), the background queries whether the robots in areas B and C are in an idle state. If the second robot 2, the fourth robot 4 and the third robot 3 are all in an idle state (the number of tasks to be completed is less than or equal to 1), further determine whether the number of robots in areas B and C is greater than 2. After judgment, there is only the third robot 3 in area C. If the third robot 3 goes to area A for assistance, area C cannot perform the delivery task. Therefore, one of the second robot 2 and the fourth robot 4 is selected, and the second robot 2 goes to area A to assist the first robot 1.

[0091] When the number of tasks to be completed in area A is less than 3 (3 is the threshold, the value is adjustable), the second robot 2 returns to area B to serve and wait for orders; or when the cumulative number of orders received by the second container in area B is greater than or equal to 2, the second robot 2 returns to area B to serve and wait for orders.

[0092] Furthermore, before the second robot 2 returns to area B for service, if it receives a cargo transfer instruction from area B, the second robot 2 loads cargo from the first container in area A and returns to area B to replenish cargo in the second container.

[0093] The multi-machine and multi-container scheduling method proposed in this embodiment 3 can flexibly schedule the number and work of robots in each area according to the workload and cargo supply of containers and robots in each area. In the scheduling, there is at least one robot serving each area, thereby improving the overall resource utilization of robots and containers and thoroughly improving the robot service efficiency.

[0094] The present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor is configured to implement the steps of the scheduling method described above when executing the computer program stored in the memory.

[0095] The present application also provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of the scheduling method described above are implemented.

[0096] In the embodiments of the mobile terminal and computer-readable storage medium provided in the present application, all technical features of any of the above-mentioned data processing method embodiments may be included, and the expanded and explained contents of the specification are basically the same as those of the above-mentioned method embodiments, and will not be repeated here.

[0097] The embodiment of the present application further provides a computer program product, which includes a computer program code. When the computer program code runs on a computer, the computer executes the methods in the above various possible implementation modes.

[0098] An embodiment of the present application also provides a chip, including a memory and a processor, the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that a device equipped with the chip executes the methods in various possible implementation modes as described above.

[0099] It is understood that the above scenarios are only examples and do not constitute a limitation on the application scenarios of the technical solutions provided in the embodiments of the present application. The technical solutions of the present application can also be applied to other scenarios. For example, it is known to those skilled in the art that with the evolution of the system architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0100] Those skilled in the art can understand that the process of implementing the task allocation method of the above embodiment can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the process of the embodiments of the above methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in the present application can include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0101] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0102] In the present application, the same or similar terminology concepts, technical solutions and / or application scenario descriptions are generally described in detail only the first time they appear. When they appear again later, they are generally not repeated for the sake of brevity. When understanding the technical solutions and other contents of the present application, for the same or similar terminology concepts, technical solutions and / or application scenario descriptions that are not described in detail later, reference can be made to the previous related detailed descriptions.

Claims

1. A scheduling method, applicable to a server, characterized in that: The method comprises: S11, determining whether the tasks to be processed in the first area meet the first condition; S12: If yes, mobilizing the robots in the second area that meet the second condition to perform the task to be processed; The first condition includes at least one of the following: The amount of tasks to be processed in the first area meets a first preset amount; The first area does not have item information corresponding to the task to be processed; The second condition includes at least one of the following: The second area robot is in a movable state; The distance between the second area and the first area satisfies a preset first distance; The second area has item information corresponding to the task to be processed; After the robots in the second area have completed the tasks to be processed, the background checks whether there are other robots still working in the second area; if the query finds that there are still other robots providing services in the second area, the background instructs the robots in the second area to stay in the first area and assist the robots in the first area.

2. The method according to claim 1, characterized in that Also includes: Determining whether the tasks to be processed in the first area meet a third condition; If yes, mobilizing the robot to return to the second area; The third condition includes at least one of the following: The amount of tasks to be processed in the first area meets a second preset amount; The first area obtains item information corresponding to the task to be processed; The second area has and / or obtains item information corresponding to the task to be processed.

3. The method according to claim 1, characterized in that Also includes: Determine whether the tasks to be processed in the second area meet the fourth condition; If yes, mobilizing the robot to return to the second area; The fourth condition includes at least one of the following: The amount of tasks to be processed in the second area meets a third preset amount; The second area does not have item information corresponding to the task to be processed, and the first area has and / or obtains item information corresponding to the task to be processed.

4. The method according to claim 3, characterized in that After the step in which the tasks to be processed in the second area meet the fourth condition, the method further includes: Mobilize the robots in the third area that meet the fifth condition; The fifth condition includes at least one of the following: The third area robot is in a movable state; The third area meets a preset second distance condition.

5. An electronic device, characterized in that: The method comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor is configured to implement the steps of the scheduling method according to any one of claims 1 to 4 when executing the computer program stored in the memory.

6. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and when the computer program is executed by a processor, the steps of the scheduling method according to any one of claims 1 to 4 are implemented.

Images