Robot scheduling method, electronic device and storage medium

By obtaining and analyzing the road categories and driving status in the robot's working environment and controlling the robot's driving path, the traffic congestion caused by the intersection of multiple robot paths is solved, and the smoothness and safety of the robot's driving are achieved.

CN116859935BActive Publication Date: 2024-11-12GRG BANKING EQUIPMENT CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310937561.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-07-27
Publication Date
2024-11-12
Estimated Expiration
2043-07-27

AI Technical Summary

Technical Problem

In hotels, banks and other scenarios, the paths between multiple robots are prone to intersection, resulting in collisions and traffic congestion. The existing scheduling methods cannot completely solve these problems, especially in environments with many interference factors and limited road resources.

Method used

By obtaining the road category information and driving status in the robot's current working environment, the robot is controlled to relieve traffic jams, resume orderly driving, and avoid re-blocking. Specific methods include obtaining the road category and driving status, adjusting the robot's driving path according to the preset model, ensuring that the road width and robot width match, promptly lifting the blockage and restoring normal operation.

Benefits of technology

It effectively solves the traffic jam caused by position conflicts between robots, ensures the smoothness and safety of robots' driving, and reduces the occurrence of blockages caused by position conflicts.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116859935B_ABST
    Figure CN116859935B_ABST
Patent Text Reader

Abstract

The present application discloses a robot scheduling method, including: obtaining the category information of each road in the current working environment of multiple robots; determining the current driving state of each robot when there is a traffic jam in the current working environment; controlling one or more robots to drive according to the category information and the current driving state to relieve the traffic jam; and controlling all robots to resume driving when the traffic jam is relieved. The present application can classify each road in the working environment of the robot in advance, and understand the operation status of each robot under the current traffic jam when a traffic jam occurs, and issue instructions to the robot according to the current driving state of each robot and different categories of roads, so that the robot changes its position, and on this basis, orderly resumes the driving of all robots, fundamentally solving the traffic jam problem caused by position conflict.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of robotics technology, and in particular to a robot scheduling method, an electronic device, and a computer-readable storage medium. Background Art

[0002] In scenarios such as hotels, banks, and exhibition halls, multiple robots are required to work together. These robots travel between multiple destinations along their own planned paths. Due to the limited size of the venues and limited road resources in scenarios such as hotels, banks, and exhibition halls, the dispatching system often finds it difficult to plan non-intersecting paths for multiple robots. Therefore, the paths between multiple robots often intersect, resulting in collisions, traffic jams, and other conflicts, which prevent the robots from traveling along the pre-planned paths normally. In addition, even if the dispatching system has pre-planned non-intersecting driving paths for multiple robots, in complex scenarios such as hotels, banks, and exhibition halls, there are many pedestrians, and the robots need to avoid obstacles in real time and change the originally preset driving paths, resulting in a high probability of collisions, traffic jams, and other conflicts.

[0003] In the current related technologies, the methods used to dispatch multiple robots are mostly to plan in advance the paths that do not intersect for multiple robots, and then make the robots walk along the pre-planned paths. Such methods are only applicable to industrial robot dispatch in scenarios with fewer additional interference factors, such as warehouses, but not to service robot dispatch in application scenarios with more interference factors and more intersections of robot driving routes, such as hotels, shopping malls, and banks. Moreover, in order to solve the problems of collisions and traffic jams, the existing solutions are mostly to make the robots stop and wait, or to instruct the robots to wait at pre-set avoidance points. Such methods cannot completely solve the problems of traffic jams. Summary of the invention

[0004] The present application provides a robot scheduling method, an electronic device, and a computer-readable storage medium.

[0005] The robot scheduling method involved in the embodiment of the present application includes:

[0006] Obtaining category information of each road in the current working environment of multiple robots;

[0007] In the case where there is a traffic jam in the current working environment, determining a current driving state of each of the robots;

[0008] Controlling one or more robots to travel according to the category information and the current driving state to relieve the traffic jam;

[0009] When the traffic jam is resolved, all the robots are controlled to resume driving to avoid the traffic jam from occurring again.

[0010] In this way, the present application can classify the various roads in the robot's working environment in advance, and when a traffic jam occurs, evaluate and set the current driving status of each robot, so as to understand the operation status of each robot under the current traffic jam, and issue different instructions to different robots according to the current driving status of each robot and different types of roads, so that the robot causing the traffic jam can change its position by driving, thereby resolving the traffic jam, and on this basis, restore the driving of all robots in an orderly manner, thereby fundamentally solving the traffic jam problem caused by position conflicts between robots.

[0011] In some embodiments, obtaining the category information of each road in the current working environment of the multiple robots includes:

[0012] Obtaining the road width of each road in the current working environment;

[0013] Obtaining the maximum body width of all the robots;

[0014] The category information is determined according to the maximum vehicle body width, the road width, and a preset safety distance, wherein the category information includes a first category and a second category, and the traffic jam condition exists on a road of the second category.

[0015] In this way, the present application can obtain the width of each road in the working environment through the robot, and determine the category information of the road according to the road width and the body width of the robot.

[0016] In some embodiments, when there is a traffic jam in the current working environment, determining the current driving state of each robot includes:

[0017] In the case where there is a traffic jam in the current working environment, determining the current driving state of each robot according to the driving speed of the robot and the relative position of the robot with respect to the current working environment, or

[0018] Determine the current driving state of each robot according to the driving state signal fed back by the robot,

[0019] The current driving state includes a first state, a second state and a third state.

[0020] In this way, the present application can determine the current driving status of all robots when a traffic jam occurs in the current working environment, so as to determine the driving mode of each robot in the process of resolving the traffic jam according to the current driving status of each robot.

[0021] In some embodiments, controlling one or more robots to travel according to the category information and the current travel status to relieve the traffic jam includes:

[0022] When the current driving state of the robot is the first state, controlling the robot to stop driving;

[0023] The current driving state of the robot is changed to the second state.

[0024] In this way, in the process of resolving traffic jams, the present application can enable a robot in normal driving state to temporarily stop driving and wait in place, providing space and convenience for the driving and movement of other robots.

[0025] In some embodiments, controlling one or more robots to travel according to the category information and the current travel status to relieve the traffic jam may further include:

[0026] When the current driving state of the robot is the third state, controlling the robot to leave the traffic jam area according to a preset model;

[0027] According to the preset model, controlling the robot to drive to a road whose category information is the first category, and stop driving;

[0028] The current driving state of the robot is changed to the second state.

[0029] In this way, in the process of resolving traffic jams, the present application can enable the robot in a congested state to leave the traffic jam area and move to a wider road in the current working environment to stop driving and wait for the traffic jam to be resolved, while also providing space and convenience for the process of resolving traffic jams.

[0030] In some embodiments, controlling one or more robots to travel according to the category information and the current travel status to relieve the traffic jam may further include:

[0031] When the current driving state of the robot is the third state, the robot is controlled to maintain its current position according to a preset model.

[0032] In this way, in the process of resolving a traffic jam, the present application can also enable a robot that is in a jammed state but does not need to change its position to resolve the traffic jam to stay at its current position and wait for the traffic jam to be resolved, thereby reducing the movement of the robot in the process of resolving the traffic jam and simplifying the process of resolving the traffic jam.

[0033] In some embodiments, when the traffic jam is resolved, controlling all the robots to resume driving includes:

[0034] updating the current driving state of each robot according to the driving speed of the robot and the relative position of the robot with respect to the current working environment;

[0035] When the current driving states of all the robots are the first state or the second state, determining that the traffic jam is resolved;

[0036] Control all the robots to resume driving.

[0037] In this way, the present application can determine whether the traffic jam has been resolved based on the current driving status of all robots in the current working environment, and after the jam has been resolved, intervene in the operation of all robots according to a preset method, restore the form of each robot, and avoid the same jam from occurring again.

[0038] In some embodiments, the robot scheduling method further includes:

[0039] When the current driving state of the robot is the first state, the robot is controlled to re-plan a driving path to avoid a traffic jam area, wherein the traffic jam area refers to an area in the current working environment where the traffic jam condition exists.

[0040] In this way, the present application can also re-plan the route of the robot whose current driving status is normal when a traffic jam occurs, so as to avoid the traffic jam area, thereby preventing the normal driving of the robot that is not affected by the traffic jam.

[0041] The electronic device of an embodiment of the present application includes a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the electronic device executes a method as described in any one of the above embodiments.

[0042] The computer-readable storage medium of the embodiment of the present application stores a computer program, and when the computer program is executed by one or more processors, the method as described in any one of the above embodiments is implemented.

[0043] Additional aspects and advantages of the embodiments of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the embodiments of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0045] Figure 1 A schematic diagram of a flow chart of a robot scheduling method in an embodiment of the present application;

[0046] Figure 2 A schematic diagram of a flow chart of a robot scheduling method in an embodiment of the present application;

[0047] Figure 3 A schematic diagram of a flow chart of a robot scheduling method in an embodiment of the present application;

[0048] Figure 4 A schematic diagram of an application scenario of the robot scheduling method in an embodiment of the present application;

[0049] Figure 5 Schematic diagram of the flow of the robot scheduling method in the implementation manner of the present application. DETAILED DESCRIPTION

[0050] The embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals represent the same or similar elements or elements having the same or similar functions from beginning to end. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the embodiments of the present application, and cannot be understood as limiting the embodiments of the present application.

[0051] like Figure 1 As shown, the robot scheduling method of the embodiment of the present application includes the following steps:

[0052] 01: Obtain the category information of each road in the current working environment of multiple robots;

[0053] 02: Determine the current driving status of each robot in the case of traffic congestion in the current working environment;

[0054] 03: Control one or more robots to drive according to the category information and current driving status to relieve traffic jams;

[0055] 04: When the traffic jam is resolved, control all robots to resume driving to prevent the traffic jam from recurring.

[0056] The electronic device of the embodiment of the present application is a server device or a robot terminal device, which can implement the robot scheduling method of the embodiment of the present application. Specifically, the electronic device includes a memory and a processor, the memory stores a computer program, and the processor is used to obtain the category information of each road in the current working environment of multiple robots, and to determine the current driving state of each robot when there is a traffic jam in the current working environment, and to control one or more robots to drive according to the category information and the current driving state to relieve the traffic jam, and to control all robots to resume driving when the traffic jam is relieved to avoid the recurrence of the traffic jam.

[0057] Specifically, in application scenarios such as hotels, banks, and exhibition halls with relatively complex road environments and limited road resources for robots to travel, it is very difficult to plan a driving path for service robots or transport robots without position conflicts, and the computing power requirements for the equipment used to schedule the operation of robots are also high. Therefore, in actual applications, traffic jams caused by position conflicts are inevitable when multiple robots are driving.

[0058] In order to resolve the above-mentioned traffic jam and quickly restore the driving process of each robot, the present application proposes a robot scheduling method. The robot scheduling method is generally run on a scheduling server, which is generally composed of a central processing unit or other electronic device with data processing capabilities. The scheduling server can collect and control the operation status of all robots in the current working environment by sending and receiving instructions through a wireless network.

[0059] First, the dispatch server obtains the category information of each road in the current working environment from each robot. The category information of the road is generally the information for classifying and marking the road according to the attributes of the road itself. For example, the length, width, curvature and other information of the road can be used as the standard for classifying and marking the road. The category information is determined according to at least one of the above standards. In order to ensure the accuracy of the determined category information, the dispatch server generally obtains the relevant parameters of each road in the current working environment through the sensors installed on each robot, and determines the category information of each road through calculation based on the obtained parameters.

[0060] Next, when the dispatch server learns through communication with each robot that there is a traffic jam in the current working environment, the dispatch server determines the current driving state of each robot based on the communication status with each robot. The current driving state generally refers to the driving state of the robot at present and in the foreseeable future, such as normal driving, waiting, etc.

[0061] Then, according to the acquired road category information and the current driving status of each robot, the driving of the robots in the current working environment is scheduled, with the aim of resolving the current traffic jam. The traffic jam refers to the situation where the road is blocked due to position conflicts between multiple robots, and the robots are unable to drive normally through the blocked road. The driving of one or more robots is controlled, generally in the form of the dispatch server calculating and determining the driving control instructions for each robot in the environment according to the current traffic jam situation and pre-set rules, and then controlling the next driving mode of each robot according to these driving control instructions, such as controlling the robot to continue normal driving, waiting in place, leaving a specific area and waiting in other areas, etc.

[0062] Finally, when the dispatch server learns through communication with each robot that the traffic jam in the current working environment has been resolved, the dispatch server controls and dispatches each robot to drive to the destination in an orderly manner according to their respective planned routes to avoid similar traffic jams from occurring again.

[0063] In this way, the present application can classify the various roads in the robot's working environment in advance, and when a traffic jam occurs, evaluate and set the current driving status of each robot, so as to understand the operation status of each robot under the current traffic jam, and issue different instructions to different robots according to the current driving status of each robot and different types of roads, so that the robot causing the traffic jam can change its position by driving, thereby resolving the traffic jam, and on this basis, restore the driving of all robots in an orderly manner, thereby fundamentally solving the traffic jam problem caused by position conflicts between robots.

[0064] like Figure 2 As shown, in some embodiments, step 01 includes:

[0065] 011: Get the road width of each road in the current working environment;

[0066] 012: Get the maximum body width of all robots;

[0067] 013: Determine the category information based on the maximum aircraft width, road width and preset safety distance.

[0068] The category information includes a first category and a second category, and the traffic jam condition exists on the road of the second category.

[0069] In some embodiments, the processor is also used to obtain the road width of each road in the current working environment, and to obtain the maximum body width of all robots, and to determine category information based on the maximum body width, road width and preset safety distance.

[0070] Specifically, with respect to the determination of road category information, in some examples:

[0071] The dispatch server communicates with each robot in the current working environment and controls the sensors installed on the robots to obtain the width data of the road the robots are traveling on. After a period of communication and data acquisition, the dispatch server can obtain the width data of all roads in the current working environment. For example, the dispatch server obtains the point cloud image of the current road by controlling the visual sensor installed on the robot, and determines the road width data of the current road based on the point cloud image through filtering calculation.

[0072] Next, the size parameters of all robots working in the current working environment are pre-stored in the dispatch server. When the dispatch server needs to call the size parameters of the robot, it can directly obtain the required size parameters from the storage unit of the dispatch server. Generally, in order to meet the adaptability of all robots to various roads in the current working environment, the dispatch server generally obtains the maximum body width among the size parameters of all robots.

[0073] Then, the dispatch server can determine the number of robots that each road can accommodate simultaneously in the width direction based on the width data of each road, the maximum body width of all robots obtained, and the preset reserved safety distance on each road, thereby further determining the category information of the road.

[0074] For example, the dispatch server obtains the width value D of a road in the current working environment, and also obtains the maximum body width value d of all robots. Combined with the preset reserved safety distance l on each road, the number of robots R that can be accommodated simultaneously in the width direction of the road can be calculated according to the following formula. If the calculated result is not an integer, it is rounded down:

[0075]

[0076] In some examples, based on the characteristics of the current working environment in the current related technology and the size of the robot itself, the calculated R value is generally divided into two results: 1 or 2. When the calculated result is 2, the current road category is determined to be a wide road (corresponding to the first category), indicating that the road can accommodate two traveling robots at the same time in the width direction. When the calculated result is 1, the current road category is determined to be a narrow road (corresponding to the second category), indicating that the road can only accommodate one traveling robot at the same time in the width direction. Because of this, traveling on narrow roads generally limits the direction of travel of the robot on the road, so it often means the gathering of robots and conflicts in the direction and position of travel. In the current working environment, narrow roads are where traffic jams often occur.

[0077] In this way, the present application can obtain the width of each road in the working environment through the robot, and determine the category information of the road according to the road width and the body width of the robot.

[0078] In addition, in order to maintain the driving order of the robots and the exercise rules of the robots in the current working environment, in some examples, based on the optimized A* algorithm, the scheduling server optimizes the cost function of the cells on the right side of the driving direction of the road for the driving position of the robot on the road, so that the cost value of the cells on the right side of the driving direction of the road is reduced by a fixed value, so that the robot gives priority to driving on the right side of the driving direction of the selected road when planning the path, thereby achieving the effect of all robots giving priority to driving on the right in the current working environment.

[0079] In some embodiments, step 02 includes:

[0080] In the current working environment where there is traffic congestion,

[0081] Determine the current driving state of each robot according to the driving speed of the robot and the relative position of the robot with respect to the current working environment; or

[0082] According to the driving status signal fed back by the robot, the current driving status of each robot is determined.

[0083] The current driving state includes a first state, a second state and a third state.

[0084] In some embodiments, the processor is also used to determine the current driving state of each robot based on the robot's driving speed and the robot's relative position to the current working environment, and to determine the current driving state of each robot based on a driving state signal fed back by the robot.

[0085] Specifically, when the dispatch server learns during the communication with the robot that there is a traffic jam in the current working environment, in order to be able to command and dispatch the driving and operation of each robot in the subsequent process, it is necessary to determine and monitor the current driving state of the robot. The current driving state of the robot is generally divided into three types: normal driving (corresponding to the first state), waiting (corresponding to the second state), and congested (corresponding to the third state). Normal driving refers to the driving state in which the current robot is not affected by the traffic jam and can still drive according to the established planned driving route. Waiting refers to the driving state in which the current robot's driving speed is 0, and the front of its own running direction is not completely occupied by other robots, or the robot is not unable to move. Congested refers to the driving state in which the current robot's driving speed is 0, and its own running direction is completely occupied by other robots, or the robot is unable to move.

[0086] In some examples, there are generally two ways to determine the current driving state of each robot in the current working environment: one is that the dispatch server calculates and determines the current state based on multiple parameters obtained by the robot's sensors, and the other is that the robot calculates and determines the current state based on its own current multiple parameters and feeds back to the dispatch server through communication. In essence, both determination methods determine the current driving state based on the robot's own current multiple parameters, but the objects performing the calculation are different, and the content transmitted between the dispatch server and the robot through communication is also different.

[0087] Taking the way the robot feeds back the current driving state to the dispatch server as an example, first, the robot obtains information such as its current driving speed and its relative position in the current working environment through its own sensors, and determines whether it is in a current driving state of normal driving, waiting, or being blocked. After the judgment is completed, the determined current driving state is fed back to the dispatch server in the form of a driving state signal through the communication connection with the dispatch server, so that the dispatch server can determine the current driving state of the robot.

[0088] Taking the example of how the dispatch server determines the current driving state based on multiple parameters fed back by the robot, the robot first obtains information such as its current driving speed and its relative position in the current working environment through its own sensors. Then, the robot feeds back the acquired parameters to the dispatch server through communication. Next, the dispatch server calculates based on the multiple parameters received and determines whether the corresponding robot is currently in a current driving state of normal driving, waiting, or congestion, and directly determines the judgment result as the current driving state of the corresponding robot until the current driving state of all robots is determined.

[0089] In this way, the present application can determine the current driving status of all robots when a traffic jam occurs in the current working environment, so as to determine the driving mode of each robot in the process of resolving the traffic jam according to the current driving status of each robot.

[0090] like Figure 3 As shown, in some embodiments, step 03 includes:

[0091] When the current driving state of the robot is the third state:

[0092] 0311: According to the preset model, control the robot to leave the traffic jam area;

[0093] 0321: According to the preset model, control the robot to drive to the road whose category information is the first category and stop driving;

[0094] 033: Change the current driving state of the robot to the second state;

[0095] On this basis, step 03 also includes:

[0096] 0312: According to a preset model, control the robot to maintain its current position.

[0097] In some embodiments, the processor is also used to control the robot to leave the traffic congestion area according to a preset model, and to control the robot to drive to a road with category information of the first category and stop driving according to the preset model, and to change the current driving state of the robot to a second state, and to control the robot to maintain its current position according to the preset model.

[0098] Specifically, see Figure 4 ,by Figure 4 The example shown is used to illustrate the control and scheduling process of the robot's driving state in the implementation mode of the present application.

[0099] Figure 4What is shown is a part of the current working environment, where Roads 1, 2, and 3 are wide roads (corresponding to the first category) and can accommodate two robots at the same time in the width direction. Roads 4, 5, and 6 are narrow roads (corresponding to the second category) and can only accommodate one robot at the same time in the width direction. Roads 5 and 6 are separated by Road 4, S1 is the outer boundary of Road 6, and S2 is the outer boundary of Road 5. For driving on narrow roads, if there is a robot driving in a narrow road, the dispatch server will prioritize the difference between the driving direction of the robot in the narrow road and the driving direction of the robot to be controlled before the robot outside the narrow road enters the narrow road. If they are the same, the robot can enter the narrow road. If they are different, it is necessary to wait for the robot in the narrow road to leave the narrow road before the robot outside the narrow road can be controlled to enter the narrow road.

[0100] In some examples, Road 3 is interrupted. Robot A has just picked up a delivery from the shelf, and the planned path is to turn right into Road 5 to leave the shelf. Robot B's planned path is to go straight through Roads 6 and 5 in sequence. Robot C's planned path is to turn left into Road 4 to reach the shelf. Robot D is driving on Road 1, and the planned path is to turn left from Road 1 into Road 6, and finally enter Road 2 via Road 5.

[0101] At this time, the planned paths of robots A, B, and C are completely occupied by each other, causing the three robots to wait for each other to give way to road resources, which in turn leads to a traffic jam at the intersection of Road 4 and Road 5. The path of robot D is therefore affected by the traffic jam. Point T is the jam position calculated by the dispatch server based on the positions of robots A, B, and C, so as to send the current traffic jam status to each robot. The dotted box with point T as the center of the circle marks the current traffic jam area. The traffic jam area generally refers to an area composed of multiple connected narrow aisles including the jam point.

[0102] In the above case, the current driving states of the robots A, B, and C are in a jam (corresponding to the third state), and the current driving state of the robot D is normal driving (corresponding to the first state).

[0103] For the traffic jam in the above situation, in order to determine the way to alleviate the traffic jam, the dispatch server generally calculates the optimal solution of the dispatch method by constructing a cost function model (corresponding to the preset model). In some examples, the cost function is generally constructed based on the driving priority of the robot, the time it takes for the robot to reach the planned waiting point, and the time it takes for the robot to pass through the traffic jam area, and different weights are assigned to each attribute of the robot. The cost function is constructed and optimized through the above-mentioned weighting process, with the aim of minimizing the cost function value to obtain the optimal solution of the dispatch method, and selecting one or more robots whose current driving state is blocked to exit the traffic jam area according to the obtained optimal solution, and finally determining the driving order of each robot in the traffic jam area, so that each robot can smoothly pass through the traffic jam area to relieve the traffic jam.

[0104] For example, in the above situation, the current driving status of robots A, B, and C are all in congestion, and the data saved in the dispatch server shows that the driving priorities of robots A, B, and C are in descending order. Therefore, robot A should be allowed to drive through the traffic congestion area according to the planned path first, followed by robot B, and robot C should be the last to drive through according to the planned path.

[0105] To achieve this goal, the dispatch server determines the optimal solution according to the above-mentioned priority relationship and the calculation of the time it takes for the robot to reach the planned waiting point and the time it takes for the robot to pass through the traffic jam area, and controls the robot C to retreat from Road 5 and drive to Road 2 (corresponding to controlling the robot to drive to the road with the category information of the first category) and stop at the planned stop point T C Waiting, at this time, robot C leaves the traffic jam area and waits, and the dispatch server changes the current driving state of robot C from being blocked (corresponding to the third state) to being waiting (corresponding to the second state).

[0106] In order to solve the above-mentioned traffic jam and avoid secondary traffic problems, in some examples, before robot C starts to drive or leaves the traffic jam area, robot A and robot B remain stationary at their locations and wait for robot C to start to drive and leave the traffic jam area before moving.

[0107] Thus, in the process of clearing the traffic jam, the present application enables the robot in the jammed state to leave the traffic jam area and move to a wider road in the current working environment to stop driving and wait for the traffic jam to be cleared, while also providing space and convenience for the process of clearing the traffic jam. In addition, the present application also enables the robot in the jammed state but not necessary to clear the traffic jam by changing its position to stay at the current position and wait for the traffic jam to be cleared, so as to reduce the movement of the robot in the process of clearing the traffic jam and simplify the process of clearing the traffic jam.

[0108] like Figure 3 As shown, in some embodiments, step 03 also includes:

[0109] When the current driving state of the robot is the first state:

[0110] 0313: Control the robot to stop driving;

[0111] 0322: Change the current driving state of the robot to the second state.

[0112] In some embodiments, the processor is further used to control the robot to stop driving, and to change the current driving state of the robot to a second state.

[0113] Specifically, based on the above implementation, during the normal driving process of robot D on Road 1, until entering the traffic jam area, the current driving state of robot D is normal driving (corresponding to the first category). In the case of a traffic jam as described in the above example, robot D cannot normally enter Road 6. Therefore, before starting to relieve the traffic jam, the dispatch server controls robot D to stop driving on Road 1, a wide road (corresponding to the first category), and at the same time, the dispatch server changes the current driving state of robot D to waiting (corresponding to the second category) to wait for the current traffic jam to be relieved before resuming driving.

[0114] In this way, in the process of resolving traffic jams, the present application can enable a robot in normal driving state to temporarily stop driving and wait in place, providing space and convenience for the driving and movement of other robots.

[0115] like Figure 5 As shown, in some embodiments, step 04 includes:

[0116] 041: Update the current driving state of each robot according to the driving speed of the robot and the relative position of the robot relative to the current working environment;

[0117] 042: When the current driving states of all robots are in the first state or the second state, determining that the traffic jam is resolved;

[0118] 043: Control all robots to resume driving.

[0119] In some embodiments, the processor is used to update the current driving state of each robot based on the driving speed of the robot and the relative position of the robot with respect to the current working environment, and is used to determine that the traffic jam is resolved when the current driving states of all robots are in the first state or the second state, and is used to control all robots to resume driving.

[0120] Specifically, based on the above implementation, after the dispatch server adjusts the position of each robot according to the optimal solution, in order to determine whether the current traffic jam is resolved, the dispatch server will once again update and confirm the current driving state of all robots. If there is no current driving state of being blocked (corresponding to the third state) among the current driving states of all robots, it proves that the traffic jam in the current working environment has been resolved.

[0121] For example, based on the above examples, in some examples, after robot C leaves Road 5, for robot B, since robot C has left the traffic jam area at this time, the planned route of robot B is actually no longer blocked, so the dispatch server changes the current driving state of robot B from being blocked (corresponding to the third state) to being in waiting (corresponding to the second state). Similarly, the planned route of robot A is actually no longer blocked, so the dispatch server changes the current driving state of robot A from being blocked (corresponding to the third state) to being in waiting (corresponding to the second state).

[0122] At this time, the current driving states of robots A, B, C, and D are all waiting (corresponding to the second state), that is, among the current driving states of all robots, there is no current driving state of being blocked (corresponding to the third state). At this time, the dispatch server can determine that the traffic jam has been resolved.

[0123] In other examples, after robot C starts to leave Road 5, for robot B, since robot C has already started to leave the traffic jam area, the planned route of robot B is actually no longer blocked, and similarly, the planned route of robot A is also actually no longer blocked. That is, at this time, robots A and B can be directly controlled to resume driving along their planned routes, and the current driving states of robots A and B can be updated to normal driving (corresponding to the first state).

[0124] At this time, the current driving state of robots C and D is waiting (corresponding to the second state), and the current driving state of robots A and B is normal driving (corresponding to the first state), that is, among the current driving states of all robots, there is no current driving state of being blocked (corresponding to the third state). At this time, the dispatch server can determine that the traffic jam has been resolved.

[0125] In the above situation, it is necessary to formulate a scheduling method (corresponding to the preset method) based on the optimal solution determined by the preset model so that all robots can resume driving in an orderly manner and avoid traffic jams again.

[0126] For example, based on the above example, when robot C is moved to the planned stop point T C After that, the outer boundary S2 of Road 5 is no longer blocked by robot C. Since robot A has the highest driving priority, the dispatch server preferentially controls robot A to turn right into Road 5 and drive to the planned path point T. A , so that robot A moves from the planned path point T A Drive towards its destination.

[0127] After robot A leaves the traffic jam area, since robot B has the second highest driving priority after robot A, the dispatch server controls robot B to go straight through Road 5 to reach the planned path point T. B , so that robot B moves from the planned path point T B Drive towards its destination.

[0128] Based on the above situation, the outer boundary S1 of Road 6 and the outer boundary S2 of Road 5 are no longer blocked by the robots, and the driving priority of robot C is lower than that of robot B. Therefore, the dispatch server controls robot C to move from the planned stop point T C Turn right to re-enter Road 5, and at the same time, control Robot D to turn left from Road 1 to enter Road 6. The time when Robot D enters Road 5 depends on the time when Robot C leaves Road 5 and turns into Road 4. If Robot C has not left Road 5 and entered Road 4 when Robot D reaches the boundary between Road 5 and Road 6, Robot D needs to wait for Robot C to leave Road 5. On the contrary, if Robot C has left Road 5 and entered Road 4 when Robot D reaches the boundary between Road 5 and Road 6, Robot D can directly enter Road 5 and drive to Road 2.

[0129] At this point, the traffic congestion in the current working environment has been completely resolved, and robots A, B, C, and D have all returned to their originally planned routes.

[0130] In other examples, when robot C starts to drive to leave Road 5, since robots A and B are driving in the same direction as robot C on Road 5, the dispatch server controls robots A and B to start moving toward Road 5, and controls robots A and B to successively pass through Road 5 to arrive at Road 2 according to the order in which the two robots actually arrive at Road 5.

[0131] After robot A leaves Road 5, Road 5 is no longer occupied, so the dispatch server controls robot C to move from the planned stop point T C Turn right and re-enter Road 5. When robot B starts to drive to leave Road 6, since robot D and robot B are driving in the same direction on Road 6, the dispatch server can also control robot D to turn left from Road 1 to Road 6. The time when robot D enters Road 5 depends on the time when robot C leaves Road 5 and turns into Road 4. If robot C has not left Road 5 and entered Road 4 when robot D reaches the boundary between Road 5 and Road 6, robot D needs to wait for robot C to leave Road 5. On the contrary, if robot C has left Road 5 and entered Road 4 when robot D reaches the boundary between Road 5 and Road 6, robot D can directly enter Road 5 and drive to Road 2.

[0132] At this point, the traffic congestion in the current working environment has been completely resolved, and robots A, B, C, and D have all returned to their originally planned routes.

[0133] In this way, the present application can determine whether the traffic jam has been resolved based on the current driving status of all robots in the current working environment, and after the jam has been resolved, intervene in the operation of all robots according to a preset method, restore the form of each robot, and avoid the same jam from occurring again.

[0134] In some embodiments, the robot scheduling method further includes:

[0135] When the current driving state of the robot is the first state, the robot is controlled to re-plan a driving path to avoid a traffic jam area, wherein the traffic jam area refers to an area where a traffic jam exists in the current working environment.

[0136] In some embodiments, the processor is also used to control the robot to re-plan the driving path to avoid a traffic jam area when the current driving state of the robot is a first state, wherein the traffic jam area refers to an area where there is a traffic jam in the current working environment.

[0137] Specifically, the method provided in the above embodiment is generally applied to the situation where traffic jams cause some robots to be unable to re-plan routes to avoid traffic jams. For example, in the above example, when Road 3 is interrupted, robot D cannot plan a route to avoid traffic jams.

[0138] In other examples, if Road 3 is unobstructed, for robot D which is currently driving normally on Road 1, if there is a traffic jam on Roads 4 and 5, robot D can replan the driving route to pass through Road 3 to reach Road 2, thereby avoiding the traffic jam.

[0139] In this way, the present application can also re-plan the route of the robot whose current driving status is normal when a traffic jam occurs, so as to avoid the traffic jam area, thereby preventing the normal driving of the robot that is not affected by the traffic jam.

[0140] The computer-readable storage medium of the embodiment of the present application stores a computer program, and when the computer program is executed by one or more processors, the method described in any one of the above embodiments is implemented.

[0141] In the description of this specification, the descriptions with reference to the terms "certain embodiments", "in an example", "exemplarily", etc., mean that the specific features, structures, materials or characteristics described in conjunction with the embodiments or examples are included in at least one embodiment or example of the present application. 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 the different embodiments or examples described in this specification and the features of the different embodiments or examples, unless they are contradictory.

[0142] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, segment or portion of code that includes one or more executable instructions for implementing the steps of a specific logical function or process, and the scope of the preferred embodiments of the present application includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by technicians in the technical field to which the embodiments of the present application belong.

[0143] Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limitations on the present application. Ordinary technicians in this field can change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. A robot scheduling method, characterized in that: The method comprises: Obtaining category information of each road in the current working environment of multiple robots; In the case where there is a traffic jam in the current working environment, determining a current driving state of each of the robots; Controlling one or more robots to travel according to the category information and the current driving state to relieve the traffic jam; When the traffic jam is resolved, all the robots are controlled to resume driving to prevent the traffic jam from reoccurring; The step of obtaining the category information of each road in the current working environment of the multiple robots includes: Obtaining the road width of each road in the current working environment; Obtaining the maximum body width of all the robots; Determining the category information according to the maximum vehicle body width, the road width, and a preset safety distance, wherein the category information includes a first category and a second category, the traffic jam condition exists on a road of the second category, wherein the road of the first category is a wide road, and the road of the second category is a narrow road; Determining the current driving state of each robot includes: In the case where there is a traffic jam in the current working environment, determining the current driving state of each robot according to the driving speed of the robot and the relative position of the robot with respect to the current working environment, or Determine the current driving state of each robot according to the driving state signal fed back by the robot, The current driving state includes a first state, a second state and a third state, wherein the first state is normal driving, the second state is waiting, and the third state is congested; The controlling one or more robots to travel according to the category information and the current travel state to relieve the traffic jam includes: When the current driving state of the robot is the first state, controlling the robot to stop driving; Changing the current driving state of the robot to the second state; The method of controlling one or more robots to travel according to the category information and the current travel state to relieve the traffic jam may further include: When the current driving state of the robot is the third state, controlling the robot to leave the traffic jam area according to a preset model; According to the preset model, controlling the robot to drive to a road whose category information is the first category, and stop driving; Changing the current driving state of the robot to the second state; The method of controlling one or more robots to travel according to the category information and the current travel state to relieve the traffic jam may further include: When the current driving state of the robot is the third state, the robot is controlled to maintain its current position according to a preset model.

2. The method according to claim 1, characterized in that When the traffic jam is resolved, controlling all the robots to resume driving includes: updating the current driving state of each robot according to the driving speed of the robot and the relative position of the robot with respect to the current working environment; When the current driving states of all the robots are the first state or the second state, determining that the traffic jam is resolved; Control all the robots to resume driving.

3. The method according to claim 1, characterized in that The method further comprises: When the current driving state of the robot is the first state, the robot is controlled to re-plan a driving path to avoid a traffic jam area, wherein the traffic jam area refers to an area in the current working environment where the traffic jam condition exists.

4. An electronic device, characterized in that: The electronic device comprises a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the electronic device executes the method according to any one of claims 1 to 3.

5. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by one or more processors, the method according to any one of claims 1 to 3 is implemented.