A scheduling method, electronic device and storage medium

Abstract

The present application discloses a scheduling method applicable to a server, the method comprising: S1, judging whether there is corresponding item information in the first area based on the acquired pending tasks; S2, if not, obtaining the second area that meets the first preset condition; S3, mobilizing the robot in the second area that meets the second preset condition to perform the pending tasks. The present application also provides an electronic device and a storage medium, through which the scheduling method proposed in the present application can flexibly schedule the number and work of robots in each area according to the workload and supply of the robots in each area, thereby improving the overall utilization of robot resources and the items stored in each area, 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 information asymmetry problem 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. Summary of the invention

[0005] 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 and cargo supply of the robots in each area, thereby improving the resource utilization of robots and containers as a whole and thoroughly improving the service efficiency of robots.

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

[0007] S1. Determine whether there is corresponding item information in the first area based on the acquired task to be processed;

[0008] S2. If not, obtaining a second area that meets the first preset condition;

[0009] S3. Mobilize the robots in the second area that meet the second preset condition to execute the task to be processed.

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

[0011] There is information corresponding to the task to be processed;

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

[0013] The delivery time of the second area meets the first preset time.

[0014] Preferably, before the S3 step, the following steps are also included:

[0015] The distance between the second area and the first area is greater than the first preset distance, and / or the delivery time of the second area is greater than the first preset time;

[0016] According to the obtained confirmation instruction, the robot is mobilized to execute the task to be processed.

[0017] Preferably, before the S3 step, the following steps are also included:

[0018] determining whether the first area is in a specific time period; and / or,

[0019] It is determined whether the amount of tasks to be processed in the first area meets a first preset amount of tasks.

[0020] Preferably, the step S3 further includes:

[0021] If there is no robot satisfying the second preset condition in the second area;

[0022] Then the robot in the first area and / or the robot in the third area that meets the second preset condition is controlled to execute the task to be processed.

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

[0024] The robot is in a movable state;

[0025] The amount of tasks to be processed in the non-first area meets the second preset amount of tasks;

[0026] The non-first area is currently in a non-specific time period;

[0027] Areas other than the first one are currently empty.

[0028] Preferably, after the step S3, the method further comprises:

[0029] The mobilized robot continues to serve the first area after completing the pending task.

[0030] Preferably, after the step S3, the method further comprises:

[0031] If it is detected that the area corresponding to the robot meets a third preset condition, controlling the robot to return to the corresponding area;

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

[0033] The amount of tasks to be processed in the region meets the third preset amount of tasks;

[0034] The area does not have item information corresponding to the task to be processed, and the first area has corresponding item information.

[0035] The present application also provides an electronic device, comprising 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 in the present application when executing the computer program stored in the memory.

[0036] The present application also provides a 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 described above are implemented.

[0037] Beneficial effects of the present invention:

[0038] The scheduling method proposed in this application can flexibly schedule the number and work of robots in each area according to the workload and supply situation of the robots in each area, thereby improving the utilization rate of robot resources and stored items in each area, and completely 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 of the embodiments of the present application, the drawings required for the description of the embodiments are briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative labor.

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

[0041] Figure 2 A schematic diagram of the arrangement of containers and robots provided in an embodiment of the present application.

[0042] The realization of the purpose, functional features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. The above-mentioned drawings have shown clear embodiments of this application, which will be described in more detail later. These drawings and textual descriptions are not intended to limit the scope of the concept of this application in any way, but to illustrate the concept of this application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0043] Here, exemplary embodiments will be described in detail, and examples thereof are shown in the accompanying drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Instead, they are only examples of devices and methods consistent with some aspects of the present application.

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

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

[0046] 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 according to 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.

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

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

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

[0050] 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 meanings. Therefore, "module", "component" or "unit" can be used in a mixed manner.

[0051] Currently, service robots can only serve in corresponding configured areas. When facing chain stores, hotels, restaurants and other areas, robots cannot provide cross-regional services. This results in low resource utilization, low efficiency and poor user experience of robots.

[0052] like Figure 1 As shown, a flow chart of a scheduling method provided by the present application is shown, and the scheduling method is applicable to a server, comprising:

[0053] S1. Determine whether there is corresponding item information in the first area based on the acquired task to be processed;

[0054] S2. If not, obtaining a second area that meets the first preset condition;

[0055] S3. Mobilize the robots in the second area that meet the second preset condition to execute the task to be processed.

[0056] 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 scheduled in multiple service areas to provide cross-regional services. In an embodiment of the present application, when a task to be processed is received in the current area, it is determined whether the current area can meet the requirements of processing the task. For example, in one embodiment scenario, when the current area is a store, sales counter, specialty store, or other similar area, when the received task is a purchase order for a certain commodity, it is necessary to determine whether the current area has corresponding commodity information. When the commodity exists in the area, it is determined that the area can meet the processing of the task; when the commodity does not exist in the area, it is determined that the area cannot meet the processing of the task; in another embodiment scenario, when the current area is a hotel, restaurant, entertainment venue, or other similar area, when the received task is a certain robot service task, such as cleaning service, when the number of service robots in the area can meet the provision of the service, it is determined that the area can meet the processing of the task; when the number of robots in the area cannot meet the processing of the task, it is determined that the area cannot meet the processing of the task; for example, in one embodiment scenario, the current area is a warehouse area, when the received task is a delivery task for stored items, if there is a robot in the warehouse that can deliver the corresponding items, it is determined that the warehouse can meet the processing of the delivery task, otherwise it is determined that the warehouse cannot meet the processing of the delivery task. The above is merely an exemplary description and will not be elaborated one by one here. Other tasks and corresponding judgment methods based on this concept by those skilled in the art are within the scope of protection of this application.

[0057] In an embodiment of the present application, after the current area cannot meet the requirements for processing the received task, it is necessary to find a suitable second area for processing the pending task. In one embodiment scenario, for example, a second area containing information corresponding to the pending task is selected. As mentioned above, for example, when the received task is a purchase order for a certain commodity, the second area containing the commodity is selected to process the order; for another example, when the received task is a certain service, such as a cleaning service, the second area containing an idle service robot is selected to process the order; for another example, when the received task is a delivery task for a certain commodity, the second area containing the commodity and an idle service robot is selected to process the delivery task; in another embodiment scenario, for example, a second area whose distance from the first area is within a set distance range is selected. In an embodiment of the present application, multiple distance ranges can also be set, for example: the first distance range is 500 meters, and the second distance range is 1 kilometer. In the third distance range, 2 kilometers is selected. A preferred implementation method is that when there is no suitable second area within the first distance range, a suitable second area within the second distance range is determined, and so on. It is not repeated here. In another embodiment, if a second area with a delivery time within a preset time range is selected, in the embodiment of the present application, multiple delivery time ranges can also be set, for example: the first delivery time is 10 minutes, the second delivery time is 30 minutes, and the third delivery time is 1 hour. A preferred implementation method is that when there is no suitable second area within the first delivery time range, a second area within the second delivery time range is selected, and so on. It is not repeated here. The above is only an exemplary explanation. For the selection of the second area, in addition to the above exemplary judgment conditions, it can also be judged and selected based on the combination of the above judgment conditions. In addition, based on the concept of the above embodiment of the present application, other judgment conditions for selecting the second area expanded by technicians in this field all belong to the protection scope of the present application.

[0058] In an embodiment of the present application, after acquiring the second area based on the above judgment conditions, before acquiring the robot in the second area to process the pending task, it is also necessary to determine whether the corresponding robot can be mobilized from the second area to process the task. In a scenario of one embodiment, if there is a robot in the second area that is in an idle state, it can be mobilized; if the second area is currently in a non-specific time period, for example, when the second area is a shopping mall, the non-specific time period is the working time from Monday to Friday; or a non-holiday time period, etc.; for example, the second area is currently processing a state of no items; for example, the amount of pending tasks in the second area is less than a certain amount, such as there are only 2 cleaning tasks, and there are 10 robots in a standby state. Based on the above judgment conditions that can be mobilized, in an embodiment of the present application, any condition that can be used to determine whether the robot in the second area can be mobilized belongs to the protection scope of the present application.

[0059] Preferably, before the S3 step, the following steps are also included:

[0060] The distance between the second area and the first area is greater than the first preset distance, and / or the delivery time of the second area is greater than the first preset time;

[0061] According to the obtained confirmation instruction, the robot is mobilized to execute the task to be processed.

[0062] In one embodiment of the present application, when a suitable second area is not obtained, for example, the distance between the second area and the first area exceeds the set range, or the delivery time from the second area to the second area exceeds the set range, in order to complete the task received by the first area, the robot in the second area can also be mobilized to execute the task according to the deployment instruction issued by the received user. In the embodiment of the present application, when calculating the delivery time, it is further necessary to calculate the processing time period of the task to be processed, for example, during the rush hour, a certain amount of additional time needs to be added to offset the time difference.

[0063] Preferably, before the S3 step, the following steps are also included:

[0064] determining whether the first area is in a specific time period; and / or,

[0065] It is determined whether the amount of tasks to be processed in the first area meets a first preset amount of tasks.

[0066] In one embodiment of the present application, the prerequisite for mobilizing the robot in the second area is not only to determine whether the first area can meet the requirements of processing the received pending tasks, but also to determine whether the first area is currently in a specific time period in another preferred scenario. For example, when the first area is a shopping mall, restaurant, bar or other consumer and entertainment venue, 8:00-10:00 in the evening is a specific time period with a peak flow of people, or holidays such as New Year's Day and Spring Festival also belong to a specific time period; in another preferred scenario, the task volume of the first area can also be determined, for example, when the task volume of the first area exceeds 100 orders; in another preferred scenario, the task volume of the first area in the current time period can also be determined, for example, between 8:00-100 in the evening, the task volume reaches 100 orders. When the above conditions occur, it is necessary to start from the second area to mobilize robots to provide services across regions.

[0067] Preferably, the step S3 further includes:

[0068] If there is no robot satisfying the second preset condition in the second area;

[0069] Then the robot in the first area and / or the robot in the third area that meets the second preset condition is controlled to execute the task to be processed.

[0070] In one embodiment of the present application, when the robots in the second area cannot meet the second preset condition, such as all the robots in the second area are in the task processing state, that is, there is no robot that can be mobilized; for example, the number of orders received by the stores and counters in the current second area in the current period exceeds a certain value, such as 1,000 orders, that is, the task volume is relatively large, the robots in the second area cannot be mobilized; for example, the counters, stores, etc. in the current second area are in the period with the largest flow of people and the busiest business, that is, in a specific period, its robots cannot be mobilized; for example, the counters, warehouses, etc. in the current second area are in the situation of being fully loaded with goods, and the robots at this time cannot be mobilized to other areas to perform tasks. The above is just an example of a single situation. Specifically, for example, the amount of tasks to be processed in a specific period reaches a preset value, or the robot is in the task execution state when the goods are fully loaded. Therefore, the situation that there is no robot in the second area that meets the second condition will not be repeated one by one, and other implementations based on the above conception are all within the protection scope of the present application.

[0071] In an embodiment of the present application, a preferred implementation is that when the robot in the second area cannot go to the first area to perform a task, the robot in the first area is mobilized to go to the second area to perform the task in the first area, for example, the robot in the first area is mobilized to go to the second area to pick up the goods corresponding to the order in the first area to complete the task; another preferred implementation is that when the robot in the second area cannot go to the first area to perform a task, the robot in the third area can also be mobilized to go to the second area to pick up the goods corresponding to the order in the first area, and then go to the first area to complete the pending order task. In this embodiment, the third area can be an area where there are robots that meet the second preset condition on the basis of meeting the first preset condition.

[0072] Preferably, after the step S3, the method further comprises:

[0073] The mobilized robot continues to serve the first area after completing the pending task.

[0074] Preferably, after the step S3, the method further comprises:

[0075] If it is detected that the area corresponding to the robot meets a third preset condition, controlling the robot to return to the corresponding area;

[0076] The third preset condition includes at least one of the following:

[0077] The amount of tasks to be processed in the region meets the third preset amount of tasks;

[0078] The area does not have item information corresponding to the task to be processed, and the first area has corresponding item information.

[0079] In one embodiment of the present application, after the robot that was mobilized based on the pending task completes the pending task, in a preferred implementation manner, the mobilized robot stays in the current area and continues to receive the pending tasks obtained in the current area for processing; in another preferred implementation manner, the mobilized robot returns to the corresponding set area immediately after completing the task. In an embodiment of the present application, when the current amount of pending tasks in the area corresponding to the robot reaches a certain value, for example, 500 pending orders, the mobilized robot needs to be mobilized to return to provide services; it can also be that when the area corresponding to the robot does not have the item information corresponding to the currently received pending order, and it is detected that the corresponding item exists in the area where the robot is mobilized, the robot is controlled to be mobilized to pick up the corresponding goods and return to the corresponding area to provide services. Specific embodiment 1

[0081] like Figure 2 As shown, a schematic diagram of the container and robot arrangement of the embodiment of the present application is provided. In the embodiment of the present application, three 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.

[0082] 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 (product, service, etc.), delivery address information (user's address) and delivery period information (calculated from the time the order is placed, the duration is a default value or a variable value).

[0083] After receiving the user's order information, first check whether there is corresponding product information in the first container in area A.

[0084] If the query finds that the corresponding product in the first container has been sold out or does not exist, or if the corresponding product in the first container is insufficient, a query request is sent to the second container in area B and the third container in area C. If the query finds that the product exists in both the second and third containers, the distances of area B and area C relative to area A are compared. After comparison, it is found that area B is closer to area A, and the user's order information is allocated to area B.

[0085] After confirming that the product is taken from the second container in area B, it is determined 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 and the fourth robot 4 are busy, the first robot 1 will go to area B to pick up the product from the second container and perform 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 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. Specific embodiment 2

[0087] See also Figure 2 As shown, a schematic diagram of the container and robot arrangement of the embodiment of the present application is provided. In the embodiment of the present application, 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.

[0088] 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 (product, service, etc.), delivery address information (user's address) and delivery period information (calculated from the time the order is placed, the duration is a default value or a variable value).

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

[0090] If the first container is found to be sold out or does not exist after query, then area A is used as the origin to query other areas within a radius of 10 kilometers. After query, it is found that areas B and C exist within the range. By discovering the product information corresponding to the area, the background assigns the user's order information to area B.

[0091] 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 third robot 3 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, the delivery time is likely to be extended when picking up the product from containers in different areas and when the delivery time happens to be during rush hour. 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. Specific embodiment 3

[0093] See also Figure 2As shown, a schematic diagram of the container and robot arrangement of the embodiment of the present application is provided. In the embodiment of the present application, 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.

[0094] Obtain the historical records of user order information, which are the number and time of user order information received by each container in each area; based on the historical records, generate the peak time information of the number of orders in each area; the peak time information includes the number of order information received and the start and end time of the peak;

[0095] For example, according to historical data, the first container in area A is set in the hotel, and the demand for hotel daily necessities sold in it increases between 8 and 9 pm; the second container in area B is set in the snack area, and the demand for snacks sold in it increases between 10 and 11 pm; the third container in area C is set at the hotel counter, and the demand for tobacco and alcohol sold in it is not large at these two time points.

[0096] When it is between 8 and 9 p.m., the service in area A is at its peak. When the first robot 1 in area A receives 6 or more task orders, the background dispatches the second robot 2 and the fourth robot 4 in area B, and the third robot 3 in area C to assist in delivering goods to area A.

[0097] When it is 10-11 o'clock in the evening, it is the peak time for service in area B, so the first robot 1 and the fourth robot 4 are also dispatched to area B to assist in delivery. Specific embodiment 4

[0099] See also Figure 2 As shown, a schematic diagram of the container and robot arrangement of the embodiment of the present application is provided. In the embodiment of the present application, 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.

[0100] When the goods in the second container in area B are sold out and there is still a long time (for example, more than 3 hours) before the next replenishment, the second robot 2 and the fourth robot 4 are both idle because there is no goods to deliver. Then the background dispatches the second robot 2 to area A to assist the first robot 1 in delivering goods, and dispatches the fourth robot 4 to area C to assist the third robot 3 in delivering goods. After the second container is replenished, the second robot 2 and the fourth robot 4 return to area B to serve.

[0101] Or, based on historical records, in the current time period, the number of orders for snacks in the second container in area B before and after breakfast is very small, and the second robot 2 and the fourth robot 4 are both idle because there are no orders to deliver, so the background dispatches the second robot 2 to area A to assist the first robot 1 in delivering goods, and dispatches the fourth robot 4 to area C to assist the third robot 3 in delivering goods. After receiving the user order in area B, the second robot 2 and the fourth robot 4 return to area B to serve.

[0102] The present application also provides an electronic device, comprising 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 in the present application when executing the computer program stored in the memory.

[0103] The present application also provides a 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 described above are implemented.

[0104] The present application also provides an electronic device, wherein a computer program is stored on the storage medium, and when the computer program is executed by a processor, the steps of the scheduling method as described in any one of the above items are implemented.

[0105] The present application also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the scheduling method in any of the above embodiments are implemented.

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

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

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

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

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

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

[0112] 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: Applied to hotel or shopping mall scenarios, each area is equipped with at least one robot for corresponding services; the method includes: S1. Determine whether there is corresponding item information in the first area based on the acquired task to be processed; S2. If not, obtaining a second area that meets the first preset condition; S3, mobilizing the robots in the second area that meet the second preset condition to perform the task to be processed; After the S3 step, the following steps are also included: The robots in the second area continue to serve the first area after completing the pending tasks; If it is detected that the area corresponding to the robot in the second area meets the third preset condition, the robot in the second area is controlled to return to the corresponding area; When the robot in the second area cannot go to the first area to perform the task, a timeout reminder is sent to the user. After the user confirms, the delivery deadline is extended, and the robot in the first area is mobilized to go to the second area to pick up the goods corresponding to the order in the first area and deliver them to the location of the user in the first area; The third preset condition includes at least one of the following: The amount of tasks to be processed in the region meets the third preset amount of tasks; The area does not have item information corresponding to the task to be processed, and the first area has corresponding item information.

2. The method according to claim 1, characterized in that The first preset condition includes at least one of the following: There is information corresponding to the task to be processed; The distance between the second area and the first area satisfies a first preset distance; The delivery time of the second area meets the first preset time.

3. The method according to claim 2, characterized in that The S3 step also includes: The distance between the second area and the first area is greater than the first preset distance, and / or the delivery time of the second area is greater than the first preset time; According to the obtained confirmation instruction, the robot is mobilized to execute the task to be processed.

4. The method according to claim 1, characterized in that The S3 step also includes: determining whether the first area is in a specific time period; and / or, It is determined whether the amount of tasks to be processed in the first area meets a first preset amount of tasks.

5. The method according to claim 1, characterized in that The step S3 further includes: If there is no robot satisfying the second preset condition in the second area; Then the robot in the first area and / or the robot in the third area that meets the second preset condition is controlled to execute the task to be processed.

6. The method according to any one of claims 1 to 5, characterized in that The second preset condition includes at least one of the following: The robot in the second area is in a movable state; The amount of tasks to be processed in the second area meets the second preset amount of tasks; The second area is currently in a non-specific time period; The second area is currently empty.

7. 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 6 when executing the computer program stored in the memory.

8. 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 6 are implemented.

Images