A method and system for dispatching preparatory orders for delivery robots

By analyzing historical waybill data to generate predicted waybills and optimizing robot scheduling, the problems of insufficient robot capacity and long waiting time are solved, and the efficiency of takeaway delivery is improved and capacity waste is avoided.

CN112907094BActive Publication Date: 2024-11-26SHANGHAI YOGO ROBOTICS CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202110245125.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-03-05
Publication Date
2024-11-26
Estimated Expiration
2041-03-05

AI Technical Summary

Technical Problem

During the peak period of dining, the robot's capacity is insufficient and the waiting time after entering the waybill is entered, resulting in inefficient delivery of takeaways.

Method used

By analyzing historical waybill data, predicting the destination distribution of each time period, generating predicted waybills and allocating them to the spare robot, heading to the delivery location in advance to wait, and optimizing the waybill scheduling to reduce the waiting time for takeout workers.

Benefits of technology

It effectively reduces the waiting time of deliverymen, improves overall delivery efficiency, and avoids waste of transportation capacity through dynamic scheduling and monitoring.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112907094B_ABST
    Figure CN112907094B_ABST
Patent Text Reader

Abstract

The present invention discloses a method and system for dispatching preparatory orders for delivery robots, and relates to the field of the Internet of Things. The method comprises: a server determines the distribution of destinations in each time period according to historical waybill data; when a robot has an empty warehouse, the server determines the predicted destination with the highest probability of appearing at the current time according to the distribution of the destination, and generates a predicted waybill to be assigned to the robot with an empty warehouse; after the robot with an empty warehouse receives the predicted waybill, the currently executed waybill task is rescheduled according to the current location information and the predicted waybill, and the predicted waybill is executed; when the server enters a new waybill, it is determined whether the destinations of the new waybill and the predicted waybill are the same, and if they are the same, the predicted waybill is replaced by the new waybill; the robot with an empty warehouse executes the new waybill. The present invention enables the robot to wait at the delivery location in advance, effectively reducing the waiting time of the deliveryman and improving the overall delivery efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of Internet of Things, and in particular to a method and system for scheduling preparatory orders for delivery robots. Background Art

[0002] With the development of the food delivery industry and the robot industry, as well as the consideration of building safety or contactless food pickup, more and more buildings have adopted robot food delivery. The deliveryman delivers the food or express to the designated pickup point, enters the waybill, and the system dispatches the robot to pick up the food. The deliveryman then puts the food into the robot storage space, and the robot delivers the food to the designated floor or door according to the planned path, completing the last leg of food delivery.

[0003] However, robots usually deliver food in the order in which they are ordered. During peak dining times, there may be a shortage of capacity. After the waybill is entered, it also takes time for the robot to move from the standby location to the pickup point, causing deliverymen to wait for too long and reducing the efficiency of food delivery. Summary of the invention

[0004] The technical problem to be solved by the present invention is to address the deficiencies in the prior art and to provide a method and system for pre-order scheduling for a delivery robot. By predicting the waybills for the current time period, the robot is enabled to execute the predicted waybills in advance, and the delivery route is planned according to the predicted waybills. The robot can go to the rider's drop-off location in advance to wait for the takeaway to be put in, effectively reducing the waiting time for the deliveryman and improving the overall delivery efficiency.

[0005] The technical solution of the present invention to solve the above technical problems is as follows:

[0006] A method for scheduling a delivery robot to prepare for receiving an order, comprising:

[0007] The server obtains historical waybill data of the target area, and determines the distribution of destinations in each time period according to the historical waybill data;

[0008] When a robot has an empty position, the server determines the predicted destination with the highest probability of appearing at the current time according to the distribution of the destinations, generates a predicted waybill according to the predicted destination, and assigns it to the robot with the empty position;

[0009] After receiving the predicted waybill, the robot with an empty warehouse reschedules the currently executed waybill task according to the current location information and the predicted waybill, and executes the predicted waybill;

[0010] After the server enters the new waybill, it is determined whether the destinations of the new waybill and the predicted waybill are the same. If they are the same, the predicted waybill is replaced by the new waybill;

[0011] After receiving the new waybill, the robot with the empty warehouse executes the new waybill.

[0012] The beneficial effects of the present invention are as follows: the preparatory order-taking scheduling method provided by the present invention determines the destination distribution of each time period through the historical waybill data of the target area. When the robot has vacant warehouse space, a predicted waybill is generated through the destination distribution of each time period, so that the robot with the empty warehouse executes the predicted waybill, which enables the robot to go to the delivery location in advance and wait, effectively reducing the waiting time of the deliveryman and improving the overall delivery efficiency.

[0013] Optionally, the above technical solution may be improved as follows:

[0014] Generate a predicted waybill according to the predicted destination and assign it to the empty warehouse robot, specifically including:

[0015] generating a predicted waybill according to the predicted destination;

[0016] Acquire all robots with empty warehouses in the target area;

[0017] Determine the time for each robot with an empty bin to move to the pickup point and sort them;

[0018] The predicted waybill is assigned to the robot that takes the shortest time to move to the pickup point.

[0019] The beneficial effect of adopting the above technical solution is: by assigning the predicted waybill to the robot with the shortest time to move to the pickup point, the execution time of the waybill can be further compressed and the delivery efficiency of the waybill can be improved.

[0020] Optionally, the above technical solution may be improved as follows:

[0021] After receiving the predicted waybill, the robot with an empty warehouse reschedules the currently executed waybill task according to the current position information and the predicted waybill, and executes the predicted waybill, specifically including:

[0022] After receiving the predicted waybill, the robot with an empty warehouse determines the current delivery status. If there is a current waybill being delivered, it determines whether the time required to travel from the current position to the starting point of the predicted waybill and then to the destination of the current waybill is within the specified time of the current waybill based on the current position information. If so, the robot with an empty warehouse first executes the predicted waybill and then executes the current waybill.

[0023] If there is no waybill being delivered, determine whether there is any waybill to be delivered. If there is any waybill to be delivered, obtain the destinations of the predicted waybill and all the waybill to be delivered, arrange and combine all the destinations, and calculate the overall time consumption of each combination. With the goal of minimizing the overall time consumption, adjust the execution order of the predicted waybill and all the waybill to be delivered and then execute them.

[0024] The beneficial effect of adopting the above technical solution is: by judging the waybill currently executed by the robot, when there is a current waybill being delivered, it is judged whether executing the predicted waybill will cause the current waybill being delivered to time out. If it does not time out, the predicted waybill will be executed first. On the one hand, it can avoid affecting the delivery of the current waybill and avoid the timeout of the current waybill delivery. On the other hand, it can also execute the predicted waybill. When there is no waybill being delivered, all waybill tasks can be re-planned to make the delivery of the waybill more flexible.

[0025] Optionally, the above technical solution may be improved as follows:

[0026] When the server enters a new waybill and the destinations of the new waybill and the predicted waybill are different, a robot with an empty warehouse is reselected to assign the predicted waybill.

[0027] The beneficial effect of adopting the above technical solution is that by reallocating waybills with different destinations, it is possible to avoid affecting the delivery of the current waybills.

[0028] Optionally, the above technical solution may be improved as follows:

[0029] The server monitors the robot with an empty warehouse. When the robot with an empty warehouse executes the predicted waybill and stays at the pickup point for more than a preset time, the predicted waybill is withdrawn and another robot with an empty warehouse is selected to reallocate the predicted waybill.

[0030] The beneficial effect of adopting the above technical solution is: by monitoring the time the robot stays at the pickup point when executing the predicted waybill, it can avoid the robot staying at the pickup point for a long time. When the predicted waybill is not executed, it will execute other waybills or return to the standby location in time, thereby avoiding waste of transportation capacity.

[0031] Another technical solution of the present invention to solve the above technical problems is as follows:

[0032] A preparatory order dispatching system for a delivery robot comprises: a server and at least one robot, wherein:

[0033] The server is used to obtain historical waybill data of the target area, and determine the distribution of destinations in each time period according to the historical waybill data;

[0034] When the robot has an empty position, the server is used to determine the predicted destination with the highest probability of appearing at the current time according to the distribution of the destinations, and generate a predicted waybill according to the predicted destination, and allocate it to the robot with the empty position;

[0035] After receiving the predicted waybill, the robot with an empty warehouse is used to reschedule the currently executed waybill task according to the current position information and the predicted waybill, and execute the predicted waybill;

[0036] After the server enters a new waybill, it is also used to determine whether the destinations of the new waybill and the predicted waybill are the same. If they are the same, the predicted waybill is replaced by the new waybill;

[0037] After receiving the new waybill, the robot with the empty warehouse is also used to execute the new waybill.

[0038] The preparatory order-taking and scheduling system provided by the present invention determines the destination distribution of each time period through the historical waybill data of the target area. When the robot has vacant warehouse space, a predicted waybill is generated based on the destination distribution of each time period, so that the robot with the empty warehouse executes the predicted waybill, which enables the robot to go to the delivery location in advance and wait, effectively reducing the waiting time of the deliveryman and improving the overall delivery efficiency.

[0039] Optionally, the above technical solution may be improved as follows:

[0040] The server is specifically configured to generate a predicted waybill according to the predicted destination;

[0041] Acquire all robots with empty warehouses in the target area;

[0042] Determine the time for each robot with an empty bin to move to the pickup point and sort them;

[0043] The predicted waybill is assigned to the robot that takes the shortest time to move to the pickup point.

[0044] The beneficial effect of adopting the above technical solution is: by assigning the predicted waybill to the robot with the shortest time to move to the pickup point, the execution time of the waybill can be further compressed and the delivery efficiency of the waybill can be improved.

[0045] Optionally, the above technical solution may be improved as follows:

[0046] After receiving the predicted waybill, the robot with an empty warehouse is specifically used to determine the current delivery status. If there is a current waybill being delivered, it is determined according to the current position information whether the time required to travel from the current position to the starting point of the predicted waybill and then to the destination of the current waybill is within the specified time of the current waybill. If so, the robot with an empty warehouse first executes the predicted waybill and then executes the current waybill.

[0047] If there is no waybill being delivered, determine whether there is any waybill to be delivered. If there is any waybill to be delivered, obtain the destinations of the predicted waybill and all the waybill to be delivered, arrange and combine all the destinations, and calculate the overall time consumption of each combination. With the goal of minimizing the overall time consumption, adjust the execution order of the predicted waybill and all the waybill to be delivered and then execute them.

[0048] The beneficial effect of adopting the above technical solution is: by judging the waybill currently executed by the robot, when there is a current waybill being delivered, it is judged whether executing the predicted waybill will cause the current waybill being delivered to time out. If it does not time out, the predicted waybill will be executed first. On the one hand, it can avoid affecting the delivery of the current waybill and avoid the timeout of the current waybill delivery. On the other hand, it can also execute the predicted waybill. When there is no waybill being delivered, all waybill tasks can be re-planned to make the delivery of the waybill more flexible.

[0049] Optionally, the above technical solution may be improved as follows:

[0050] When the server enters a new waybill and the destinations of the new waybill and the predicted waybill are different, the server is further configured to reselect a robot with an empty warehouse to assign the predicted waybill.

[0051] The beneficial effect of adopting the above technical solution is that by reallocating waybills with different destinations, it is possible to avoid affecting the delivery of the current waybills.

[0052] Optionally, the above technical solution may be improved as follows:

[0053] The server is also used to monitor the robot with an empty warehouse. When the robot with an empty warehouse executes the predicted waybill and stays at the pickup point for more than a preset time, the predicted waybill is withdrawn and another robot with an empty warehouse is selected to reallocate the predicted waybill.

[0054] The beneficial effect of adopting the above technical solution is: by monitoring the time the robot stays at the pickup point when executing the predicted waybill, it can avoid the robot staying at the pickup point for a long time. When the predicted waybill is not executed, it will execute other waybills or return to the standby location in time, thereby avoiding waste of transportation capacity.

[0055] Advantages of additional aspects of the present invention will be given in part in the following description, and in part will be obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] Figure 1 A flow chart of an embodiment of the method for scheduling preparatory orders of the present invention is provided;

[0057] Figure 2 A schematic diagram of a robot delivery path provided for an embodiment of the method for scheduling order preparation of the present invention;

[0058] Figure 3 A schematic diagram of the structural framework provided for an embodiment of the preparatory order receiving and dispatching system of the present invention. DETAILED DESCRIPTION

[0059] The principles and features of the present invention are described below in conjunction with the accompanying drawings. The examples given are only used to explain the present invention but not to limit the scope of the present invention.

[0060] For ease of explanation, the workflow of the delivery robot is first described. Figure 2 As shown, an exemplary robot delivery path diagram is provided. When there is no delivery task, the robot waits at the standby point. When the rider arrives at the delivery point and enters the waybill information through the preset terminal, the system will allocate the waybill and select the most suitable robot from all available robots in the building according to a certain algorithm to go to the rider's delivery point to put the items. For example, the robot at the standby point moves to the delivery point. After the rider puts the goods, the robot goes to deliver the goods to the corresponding floor or outside the door.

[0061] It should be understood that the place where riders put goods in the building layout can be a pickup point or a drop point. After entering the building, the rider needs to scan the code at the rider drop point, enter the waybill, and then wait for the robot to come. The number of rider drop points in the building is generally less than the number of robots. The remaining robots will dock at their own standby points.

[0062] In the present application, after the server generates a predicted waybill, it can be sent to a robot that is delivering goods and has available space, or to a robot at a standby point, so that the robot goes to the delivery point in advance and waits for the rider to release the goods. When the rider releases the goods, the goods are delivered. This saves the rider the waiting time from the time the waybill information is entered to the time the robot arrives at the delivery point, thereby improving delivery efficiency and reducing rider waiting time. The following is a detailed explanation using buildings as the target area.

[0063] like Figure 1 FIG. 1 is a flow chart of an embodiment of a method for preparing order receiving and scheduling according to the present invention. The method for preparing order receiving and scheduling is used for a delivery robot and includes:

[0064] S1, the server obtains the historical waybill data of the target area and determines the distribution of destinations in each time period based on the historical waybill data;

[0065] It should be noted that the target area may be an office building, a residential area or a hotel, and the destination may be a floor or a room number.

[0066] It should be noted that the waybill is used to describe a delivery task of the robot. For example, the basic information of a waybill may consist of the starting location, destination, recipient name and recipient mobile phone number, etc.

[0067] It should be noted that the specific time period can be set according to actual needs. For example, taking a building as an example, 24 hours a day can be divided into several time periods at intervals of every N minutes. The historical waybill data is filled into these time periods according to the creation time, and the waybill in each time period is aggregated according to the destination floor, and the weight is calculated to obtain the data set sample. For example, 70% of the historical waybills from 11:30 to 11:40 are waybills for the 11th floor, and 30% are waybills for the 12th floor. The data set samples are updated daily and stored on the server side.

[0068] S2: When a robot has an empty warehouse, the server determines the predicted destination with the highest probability at the current time based on the distribution of destinations, generates a predicted waybill based on the predicted destination, and assigns it to the robot with an empty warehouse;

[0069] It should be understood that the waybills that may appear in the next few minutes are calculated based on the historical waybill data in the building. The predicted waybills are not real waybills, and do not contain user information, etc. Only basic starting point and destination point information exists. The purpose of predicting waybills is to allow the robot to pick up future waybills as much as possible in accordance with future scheduling expectations. The robot will treat the predicted waybills as real waybills and move to the rider's delivery point to wait for delivery.

[0070] The starting point is used to describe the starting position of each delivery task of the robot. Generally, the starting point of robot delivery is the current position information of the robot.

[0071] The arrival point is used to describe the arrival location of the robot for each delivery task. Generally, the arrival point can be the location in front of a room in a building, etc.

[0072] For example, assuming that 70% of the historical waybills from 11:30 to 11:40 are for the 11th floor and 30% are for the 12th floor, then a predicted waybill can be generated, with the starting point of the waybill being the current position of the robot and the arrival point being the 11th floor.

[0073] It should be understood that if the upper limit of the predicted orders in the building has been reached at this time, no new predicted shipping orders will be generated.

[0074] S3: After receiving the predicted waybill, the robot with an empty warehouse reschedules the currently executed waybill task according to the current location information and the predicted waybill, and executes the predicted waybill.

[0075] It should be understood that the robot will send its current information to the server in real time, and the server will return the task information that the robot should do. That is, the robot can obtain a new task list through real-time heartbeat synchronization, compare it with its current task list, and obtain the task information returned by the server that it is not currently performing. The robot searches for new waybill tasks in all waybill lists of the building obtained through waybill synchronization and obtains detailed information about the waybill.

[0076] When a new waybill is generated on the server, the robot will observe the change and pull all the detailed information of the waybill, so that both the server and the robot share a copy of all the waybill information to be delivered in the building, keeping the information consistent.

[0077] S4, after the server enters the new waybill, it determines whether the destinations of the new waybill and the predicted waybill are the same. If they are the same, the predicted waybill is replaced by the new waybill;

[0078] If they are not identical, no replacement will be made.

[0079] S5, after the robot with an empty warehouse receives the new waybill, it executes the new waybill.

[0080] It should be understood that the server can obtain all the rider drop-off points configured in the building in advance, and based on the basic information of the rider drop-off points, it can calculate the maximum number of predicted waybills appearing in the site, and then generate predicted waybills within the range of the maximum value.

[0081] The robot and the server can communicate through wireless communication links such as 4G, 5G or WIFI.

[0082] The preparatory order-taking scheduling method provided in this embodiment determines the destination distribution of each time period through the historical waybill data of the target area. When the robot has empty warehouse space, a predicted waybill is generated based on the destination distribution of each time period, so that the robot with the empty warehouse executes the predicted waybill, which enables the robot to go to the delivery location in advance and wait, effectively reducing the waiting time of the deliveryman and improving the overall delivery efficiency.

[0083] Optionally, in some possible implementations, a predicted waybill is generated according to the predicted destination and assigned to the empty warehouse robot, specifically including:

[0084] Generate a predicted waybill based on the predicted destination;

[0085] Get all robots with empty warehouses in the target area;

[0086] Determine the time for each robot with an empty bin to move to the pickup point and sort them;

[0087] The predicted waybill is assigned to the robot that takes the shortest time to move to the pickup point.

[0088] By assigning the predicted waybill to the robot that takes the shortest time to move to the pickup point, the execution time of the waybill can be further compressed and the delivery efficiency of the waybill can be improved.

[0089] Optionally, in some possible implementations, after receiving the predicted waybill, the robot with an empty warehouse reschedules the currently executed waybill task according to the current location information and the predicted waybill and executes the predicted waybill, specifically including:

[0090] After receiving the predicted waybill, the robot with an empty warehouse determines the current delivery status. If there is a current waybill being delivered, it determines whether the time required to travel from the current location to the starting point of the predicted waybill and then to the destination of the current waybill is within the specified time of the current waybill based on the current location information. If so, the robot with an empty warehouse executes the predicted waybill first, and then executes the current waybill.

[0091] For example, assuming the robot is currently on the second floor, it takes 3 minutes to get from the current location to the pickup point, and 5 minutes to get from the pickup point to the destination of the current waybill being delivered. Assuming the remaining delivery time of the current waybill being delivered is 10 minutes, if the predicted waybill is executed, it will take 8 minutes, and you can wait for 2 minutes at the pickup point. In this case, you can execute the predicted waybill, wait for 2 minutes at the pickup point, and then execute the current waybill. Assuming the remaining delivery time of the current waybill being delivered is 5 minutes, then executing the predicted waybill will obviously cause the current waybill being delivered to time out, so the predicted waybill will not be executed, and the current waybill will be executed directly.

[0092] If there is no waybill being delivered, determine whether there is any waybill to be delivered. If there is any waybill to be delivered, obtain the destinations of the predicted waybill and all waybill to be delivered, arrange and combine all destinations, and calculate the overall time consumption of each combination. With the goal of minimizing the overall time consumption, adjust the execution order of the predicted waybill and all waybill to be delivered and then execute them.

[0093] By judging the waybill currently executed by the robot, when there is a current waybill being delivered, it is determined whether executing the predicted waybill will cause the current waybill to time out during delivery. If it does not time out, the predicted waybill will be executed first. On the one hand, it can avoid affecting the delivery of the current waybill and avoid the timeout of the current waybill delivery. On the other hand, it can also execute the predicted waybill. When there is no waybill being delivered, all waybill tasks can be re-planned to make the delivery of the waybill more flexible.

[0094] Optionally, in some possible implementations, after the server enters a new waybill, if the destinations of the new waybill and the predicted waybill are different, a robot with an empty warehouse is reselected to assign the predicted waybill.

[0095] By reallocating waybills with different destinations, it is possible to avoid affecting the delivery of current waybills.

[0096] Optionally, in some possible implementations, the server monitors robots with empty warehouses. When a robot with an empty warehouse executes a predicted waybill and stays at a pickup point for more than a preset time, the predicted waybill is withdrawn and another robot with an empty warehouse is selected to reallocate the predicted waybill.

[0097] By monitoring the time the robot stays at the pickup point when executing a predicted waybill, it can avoid the robot staying at the pickup point for a long time. When the predicted waybill is not executed, it can promptly execute other waybill or return to the standby location, thereby avoiding waste of transportation capacity.

[0098] It can be understood that in some embodiments, some or all of the optional implementation modes in the above embodiments may be included.

[0099] like Figure 3 , which is a schematic diagram of a structural framework provided by an embodiment of a preparatory order-taking scheduling system of the present invention, wherein the preparatory order-taking scheduling system is used for a delivery robot 20, and comprises: a server 10 and at least one robot 20, wherein:

[0100] The server 10 is used to obtain historical waybill data of the target area and determine the distribution of destinations in each time period according to the historical waybill data;

[0101] When there is an empty position in the robot 20, the server 10 is used to determine the predicted destination with the highest probability of appearing at the current time according to the distribution of destinations, and generate a predicted waybill according to the predicted destination, and allocate it to the robot 20 with an empty position;

[0102] After receiving the predicted waybill, the robot 20 with an empty warehouse is used to reschedule the currently executed waybill task according to the current location information and the predicted waybill, and execute the predicted waybill;

[0103] When the server 10 enters a new waybill, it is also used to determine whether the destinations of the new waybill and the predicted waybill are the same. If they are the same, the predicted waybill is replaced by the new waybill;

[0104] After receiving a new waybill, the robot 20 with an empty warehouse is also used to execute the new waybill.

[0105] The preparatory order-taking and scheduling system provided in the present embodiment determines the destination distribution of each time period through the historical waybill data of the target area. When a vacant warehouse space appears in the robot 20, a predicted waybill is generated based on the destination distribution of each time period, so that the robot 20 with the empty warehouse executes the predicted waybill, which enables the robot 20 to go to the delivery location in advance and wait, thereby effectively reducing the waiting time of the deliveryman and improving the overall delivery efficiency.

[0106] Optionally, in some possible implementations, the server 10 is specifically configured to generate a predicted waybill according to the predicted destination;

[0107] Obtain all robots 20 with empty bins in the target area;

[0108] Determine the time for each robot 20 with an empty bin to move to the pickup point and sort them;

[0109] The predicted waybill is assigned to the robot 20 that has the shortest time to move to the pickup point.

[0110] By assigning the predicted waybill to the robot 20 that takes the shortest time to move to the pickup point, the execution time of the waybill can be further compressed and the delivery efficiency of the waybill can be improved.

[0111] Optionally, in some possible implementations, after receiving the predicted waybill, the robot 20 with an empty warehouse is specifically used to determine the current delivery status. If there is a current waybill being delivered, it is determined according to the current position information whether the time required to travel from the current position to the starting point of the predicted waybill and then to the destination of the current waybill is within the specified time of the current waybill. If so, the robot 20 with an empty warehouse first executes the predicted waybill and then executes the current waybill.

[0112] If there is no waybill being delivered, determine whether there is any waybill to be delivered. If there is any waybill to be delivered, obtain the destinations of the predicted waybill and all waybill to be delivered, arrange and combine all destinations, and calculate the overall time consumption of each combination. With the goal of minimizing the overall time consumption, adjust the execution order of the predicted waybill and all waybill to be delivered and then execute them.

[0113] By judging the waybill currently executed by the robot 20, when there is a current waybill being delivered, it is determined whether the execution of the predicted waybill will cause the current waybill being delivered to time out. If it does not time out, the predicted waybill will be executed first. On the one hand, it can avoid affecting the delivery of the current waybill and avoid the timeout of the current waybill delivery. On the other hand, the predicted waybill can be executed. When there is no waybill being delivered, all waybill tasks can be re-planned to make the delivery of the waybill more flexible.

[0114] Optionally, in some possible implementations, when the server 10 enters a new waybill and the destinations of the new waybill and the predicted waybill are different, the server 10 is also used to reselect a robot 20 with an empty warehouse to assign the predicted waybill.

[0115] By reallocating waybills with different destinations, it is possible to avoid affecting the delivery of current waybills.

[0116] Optionally, in some possible implementations, the server 10 is also used to monitor the robot 20 with an empty warehouse. When the robot 20 with an empty warehouse executes a predicted waybill and stays at the pickup point for more than a preset time, the predicted waybill is withdrawn and other robots 20 with empty warehouses are selected to reallocate the predicted waybill.

[0117] By monitoring the time the robot 20 stays at the pickup point when executing the predicted waybill, it is possible to avoid the robot 20 staying at the pickup point for a long time. When the predicted waybill is not executed, other waybill can be executed in a timely manner or the robot can return to the standby location, thereby avoiding waste of transportation capacity.

[0118] It can be understood that in some embodiments, some or all of the optional implementation modes in the above embodiments may be included.

[0119] It should be noted that the above embodiments are product embodiments corresponding to the previous method embodiments. For the description of the optional implementation methods in the product embodiments, reference can be made to the corresponding description in the above method embodiments, which will not be repeated here.

[0120] The reader should understand that in the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "examples", "specific examples", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments or examples described in this specification and the features of different embodiments or examples without contradiction.

[0121] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the method embodiments described above are only illustrative, for example, the division of steps is only a logical function division, and there may be other division methods in actual implementation, such as multiple steps can be combined or integrated into another step, or some features can be ignored or not executed.

[0122] The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present invention, and these modifications or replacements should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. A method for dispatching preparatory orders for a delivery robot, characterized in that: include: The server obtains historical waybill data of the target area, and determines the distribution of destinations in each time period according to the historical waybill data; When a robot has an empty position, the server determines the predicted destination with the highest probability of appearing at the current time according to the distribution of the destinations, generates a predicted waybill according to the predicted destination, and assigns it to the robot with the empty position; After receiving the predicted waybill, the robot with an empty warehouse reschedules the currently executed waybill task according to the current location information and the predicted waybill, and executes the predicted waybill; After the server enters a new waybill, it is determined whether the destinations of the new waybill and the predicted waybill are the same. If they are the same, the predicted waybill is replaced by the new waybill; if they are different, a robot with an empty warehouse is reselected to assign the predicted waybill; After receiving the new waybill, the robot with an empty warehouse executes the new waybill; The server monitors the robot with an empty warehouse, and when the robot with an empty warehouse executes the predicted waybill and stays at the pickup point for more than a preset time, withdraws the predicted waybill and selects another robot with an empty warehouse to reallocate the predicted waybill; After receiving the predicted waybill, the robot with an empty warehouse reschedules the currently executed waybill task according to the current position information and the predicted waybill, and executes the predicted waybill, specifically including: After receiving the predicted waybill, the robot with an empty warehouse determines the current delivery status. If there is a current waybill being delivered, it determines whether the time required to travel from the current position to the starting point of the predicted waybill and then to the destination of the current waybill is within the specified time of the current waybill based on the current position information. If so, the robot with an empty warehouse first executes the predicted waybill and then executes the current waybill. If there is no waybill being delivered, determine whether there is any waybill to be delivered. If there is any waybill to be delivered, obtain the destinations of the predicted waybill and all the waybill to be delivered, arrange and combine all the destinations, and calculate the overall time consumption of each combination. With the goal of minimizing the overall time consumption, adjust the execution order of the predicted waybill and all the waybill to be delivered and then execute them.

2. The method for dispatching preparatory orders for delivery robots according to claim 1, characterized in that: Generate a predicted waybill according to the predicted destination and assign it to the robot with an empty warehouse, specifically including: generating a predicted waybill according to the predicted destination; Acquire all robots with empty warehouses in the target area; Determine the time for each robot with an empty bin to move to the pickup point and sort them; The predicted waybill is assigned to the robot that takes the shortest time to move to the pickup point.

3. A pre-order dispatching system for a delivery robot, characterized in that: include: A server and at least one robot, wherein: The server is used to obtain historical waybill data of the target area, and determine the distribution of destinations in each time period according to the historical waybill data; When the robot has an empty position, the server is used to determine the predicted destination with the highest probability of appearing at the current time according to the distribution of the destinations, and generate a predicted waybill according to the predicted destination, and allocate it to the robot with the empty position; After receiving the predicted waybill, the robot with an empty warehouse is used to reschedule the currently executed waybill task according to the current position information and the predicted waybill, and execute the predicted waybill; When the server enters a new waybill, it is also used to determine whether the destinations of the new waybill and the predicted waybill are the same. If they are the same, the predicted waybill is replaced by the new waybill. If they are different, a robot with an empty warehouse is reselected to assign the predicted waybill. After receiving the new waybill, the robot with an empty warehouse is also used to execute the new waybill; The server is further configured to monitor the robot with an empty warehouse, and when the robot with an empty warehouse executes the predicted waybill and stays at the pickup point for more than a preset time, withdraw the predicted waybill and select another robot with an empty warehouse to reallocate the predicted waybill; After the robot with an empty warehouse receives the predicted waybill, it is specifically used to determine the current delivery status. If there is a current waybill being delivered, it is determined based on the current position information whether the time required to travel from the current position to the starting point of the predicted waybill and then to the destination of the current waybill is within the specified time of the current waybill. If so, the robot with an empty warehouse first executes the predicted waybill and then executes the current waybill. If there is no waybill being delivered, it is determined whether there is a waybill to be delivered. If there is a waybill to be delivered, the destinations of the predicted waybill and all the waybills to be delivered are obtained, all the destinations are arranged and combined, and the overall time consumption of each combination is calculated. With the goal of minimizing the overall time consumption, the execution order of the predicted waybill and all the waybills to be delivered is adjusted and then executed.

4. The preparatory order-taking dispatching system for delivery robots according to claim 3, characterized in that: The server is specifically configured to generate a predicted waybill according to the predicted destination; Acquire all robots with empty warehouses in the target area; Determine the time for each robot with an empty bin to move to the pickup point and sort them; The predicted waybill is assigned to the robot that takes the shortest time to move to the pickup point.