Traveling avoidance method and device of mobile robot and mobile robot scheduling system

By setting the avoidance robot and the avoided robot in the mobile robot scheduling system, calculating the driving avoidance points and generating the avoidance path, the problem of low efficiency in path re-planning during obstacles is solved, and the system efficiency is improved.

CN118938929APending Publication Date: 2024-11-12HANGZHOU HIKROBOT TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411154813.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-20
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

When existing mobile robot scheduling systems encounter obstacles, they need to re-plan their paths, resulting in a decrease in system efficiency.

Method used

By setting the avoidance robot and the avoided robot, the driving avoidance point is calculated based on the driving path and stop point of the avoided robot, and the avoidance path is generated. The avoidance robot is driven to walk along the path to remove obstacles and avoid re-planning the path.

Benefits of technology

It improves the working efficiency of the mobile robot scheduling system, reduces the number of path re-planning caused by obstacles, and improves the operating efficiency of the system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118938929A_ABST
    Figure CN118938929A_ABST
Patent Text Reader

Abstract

The invention discloses a traveling avoidance method and device for a mobile robot and a mobile robot scheduling system. The traveling avoidance method comprises the steps that firstly, an avoidance robot and an avoided robot need to be set; then, a driving avoidance instruction of the avoidance robot is triggered based on the avoidance vehicle condition of the avoidance robot; calculating a driving avoidance point according to the remaining path where the robot does not walk in the driving path of the avoided robot and the stop point of the avoidance robot; after the traveling avoidance point is determined, the avoidance path can be generated, and the avoidance robot is driven to walk to the traveling avoidance point, so that the obstacle to the avoided robot is relieved; it can be seen that after walking of the avoided robot encounters obstacles, different from re-planning of a path for the avoided robot, the traveling avoidance method of the embodiment can dispatch the mobile robot (namely the avoidance robot) which hinders the avoided robot to a closer traveling avoidance point, so that the obstacles to the avoided robot can be relieved, and the avoidance efficiency of the robot is improved. And the working efficiency of the scheduling system is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of mobile robots, and in particular to a vehicle avoidance method and device for a mobile robot and a mobile robot dispatching system. Background Art

[0002] In the field of logistics, a mobile robot scheduling system usually includes a control unit and multiple mobile robots, and the control unit schedules the movement of each mobile robot separately.

[0003] When the mobile robot moves normally along the planned path, it is inevitable that an obstacle or other abnormal robot appears in front of the mobile robot, causing the mobile robot to be unable to continue walking; in related solutions, the path is usually replanned for the mobile robot to bypass the obstacle or abnormal robot.

[0004] However, re-planning the path is not conducive to improving the efficiency of the entire system. Summary of the invention

[0005] In response to at least one aspect of the above-mentioned technical problems, the embodiments of the present application provide a mobile robot driving avoidance method, device and mobile robot scheduling system. The driving avoidance method can avoid the mobile robot that obstructs the walking of other mobile robots due to its own parking, thereby eliminating the need to replan the path for the obstructed mobile robot, thereby improving the working efficiency of the scheduling system.

[0006] In a first aspect, an embodiment of the present application provides a vehicle avoidance method for a mobile robot, the vehicle avoidance method comprising:

[0007] In the process of scheduling multiple mobile robots to move, a mobile robot that blocks the movement of other mobile robots due to its own stopping is set as an avoiding robot, and the obstructed mobile robot is set as an avoided robot;

[0008] The driving avoidance instruction of the avoidance robot is triggered based on the avoiding vehicle condition of the avoidance robot at the stopping point; wherein the avoiding vehicle condition includes that the avoidance robot currently has no task at the stopping point or the avoiding robot is blocked from driving at the stopping point, and the stopping point occupies the remaining path in the driving path of the avoided robot; the driving avoidance instruction is used to drive the avoidance robot to perform driving avoidance on the avoided robot;

[0009] Calculating the driving avoidance point of the avoiding robot according to the remaining path that has not been traveled in the driving path of the avoided robot and the stopping point;

[0010] An avoidance path from the stopping point to the vehicle avoidance point is generated and the vehicle avoidance instruction is executed on the avoidance robot, so that the avoidance robot walks from the stopping point to the vehicle avoidance point along the avoidance path.

[0011] In one embodiment, preferably, the step of calculating the driving avoidance point of the avoiding robot according to the remaining path not traveled in the driving path of the avoided robot and the stopping point comprises:

[0012] Setting the coordinates corresponding to the remaining path of the avoided robot that has not been traveled in the driving path of the avoided robot and the coordinates of the current position of the avoided robot to a locked state;

[0013] Searching for a number of feasible avoidance coordinates with the coordinates of the stopping point as the center and a predetermined distance as the search radius; wherein the feasible avoidance coordinates are coordinates that are in an unlocked state and can be reached by the avoidance robot from the stopping point;

[0014] The score of each of the feasible avoidance coordinates is calculated respectively, and the position of the feasible avoidance coordinate with the highest score is set as the driving avoidance point.

[0015] In one embodiment, preferably, the step of respectively calculating the score value of each of the feasible avoidance coordinates and setting the position of the feasible avoidance coordinate with the highest score value as the driving avoidance point includes:

[0016] Setting a number of attribute conditions, and setting a corresponding coefficient for each of the attribute conditions;

[0017] The score value of each feasible avoidance coordinate is calculated as follows:

[0018] First, whether the feasible avoidance coordinates satisfy each of the attribute conditions is detected in turn, and when the feasible avoidance coordinates satisfy the attribute condition, the attribute value of the attribute condition is assigned to 1, otherwise, the attribute value of the attribute condition is assigned to 0, so as to obtain several attribute values ​​of the feasible avoidance coordinates;

[0019] Then, several attribute values ​​of the feasible avoidance coordinates are multiplied by their corresponding coefficients and then added together to obtain a score value of the feasible avoidance coordinates;

[0020] The location of the feasible avoidance coordinate with the highest score is set as the driving avoidance point.

[0021] In one embodiment, preferably, the driving avoidance method includes:

[0022] When the feasible avoidance coordinates are not found, the predetermined distance is multiplied and the search for the feasible avoidance coordinates continues.

[0023] In one embodiment, preferably, the step of setting the mobile robot that obstructs the walking of other mobile robots due to its own stopping as an avoiding robot and setting the obstructed mobile robot as an avoided robot comprises:

[0024] When the first mobile robot and the second mobile robot are walking along their respective driving paths, in the case that the first mobile robot and the second mobile robot respectively occupy the remaining path of each other's driving path, based on the comparison of the traffic priorities of the first mobile robot and the second mobile robot, the one of the first mobile robot and the second mobile robot with a lower traffic priority is determined as the avoiding robot, and the other one with a higher traffic priority is determined as the avoided robot.

[0025] In one embodiment, preferably, the vehicle avoidance method further includes:

[0026] When the feasible avoidance coordinates are not found, the one of the first mobile robot and the second mobile robot with a higher traffic priority is determined as the avoidance robot, and the other one with a lower traffic priority is determined as the avoided robot.

[0027] In one embodiment, preferably, the vehicle avoidance method further includes:

[0028] In the process of driving the avoidance robot to walk along the avoidance path from the stopping point to the driving avoidance point, the obstruction condition of the stopping point and the remaining path of the avoided robot that has not been traveled are recorded in real time;

[0029] When the obstruction condition of the stop point is removed or the remaining path of the avoided robot does not cover the stop point, the avoiding robot is driven to return to the stop point along the avoidance path.

[0030] In one embodiment, preferably, the step of recording in real time the obstruction condition of the stop point and the remaining path of the avoided robot that has not been traveled includes:

[0031] Record in real time the status of the abnormal robot or the restricted area that caused the avoidance robot to be blocked and stopped;

[0032] The vehicle number, current position and target point of the avoided robot are recorded in real time.

[0033] In one embodiment, preferably, when the obstruction condition at the stop point is released or the remaining path of the avoided robot does not cover the stop point, the step of driving the avoidance robot to return to the stop point along the avoidance path comprises:

[0034] When the abnormal robot returns to normal or the restricted area is released, the avoidance robot is driven to return to the stop point along the avoidance path; or

[0035] When the remaining path of the avoided robot in its driving path does not cover the stopping point due to the target point update, the avoiding robot is driven to return to the stopping point along the avoiding path.

[0036] In a second aspect, an embodiment of the present application provides a vehicle avoidance device for a mobile robot, the vehicle avoidance device comprising:

[0037] A setting unit, used for setting a mobile robot that blocks the walking of other mobile robots due to its own stopping as an avoiding robot, and setting the obstructed mobile robot as an avoided robot in the process of scheduling the walking of multiple mobile robots;

[0038] a triggering unit, configured to trigger a driving avoidance instruction of the avoidance robot based on the avoiding vehicle condition of the avoidance robot at a stopping point; wherein the avoiding vehicle condition includes that the avoidance robot currently has no task at the stopping point or the avoiding robot is blocked from driving at the stopping point, and the stopping point occupies the remaining path in the driving path of the avoided robot; the driving avoidance instruction is used to drive the avoidance robot to perform driving avoidance on the avoided robot;

[0039] A calculation unit, used for calculating the driving avoidance point of the avoiding robot according to the remaining path not traveled in the driving path of the avoided robot and the stopping point;

[0040] An execution unit is used to generate an avoidance path from the stopping point to the driving avoidance point and execute the driving avoidance instruction to the avoiding robot, so that the avoiding robot walks from the stopping point to the driving avoidance point along the avoidance path.

[0041] In one embodiment, preferably, the calculation unit includes:

[0042] A coordinate locking module, used to set the coordinates corresponding to the remaining path of the avoided robot and the coordinates of the current position of the avoided robot to a locked state;

[0043] A first coordinate search module is used to search for a number of feasible avoidance coordinates with the coordinates of the stopping point as the center and a predetermined distance as the search radius; wherein the feasible avoidance coordinates are coordinates that are in an unlocked state and can be reached by the avoidance robot from the stopping point;

[0044] The coordinate setting module calculates the score of each of the feasible avoidance coordinates respectively, and sets the position of the feasible avoidance coordinate with the highest score as the driving avoidance point.

[0045] In one embodiment, preferably, the coordinate setting module includes:

[0046] The attribute condition setting submodule is used to set a number of attribute conditions and set a corresponding coefficient for each of the attribute conditions;

[0047] The scoring value calculation submodule is used to calculate the scoring value of each of the feasible avoidance coordinates in the following manner:

[0048] First, whether the feasible avoidance coordinates satisfy each of the attribute conditions is detected in turn, and when the feasible avoidance coordinates satisfy the attribute condition, the attribute value of the attribute condition is assigned to 1, otherwise, the attribute value of the attribute condition is assigned to 0, so as to obtain several attribute values ​​of the feasible avoidance coordinates;

[0049] Then, several attribute values ​​of the feasible avoidance coordinates are multiplied by their corresponding coefficients and then added together to obtain a score value of the feasible avoidance coordinates;

[0050] The coordinate setting submodule is used to set the location of the feasible avoidance coordinate with the highest score as the driving avoidance point.

[0051] In one embodiment, preferably, the calculation unit includes:

[0052] The second coordinate search module is used to multiply the predetermined distance and continue searching for the feasible avoidance coordinates when the feasible avoidance coordinates are not found.

[0053] In one embodiment, preferably, the setting unit includes:

[0054] The first setting module is used for when the first mobile robot and the second mobile robot are walking along their respective driving paths, and in the case that the first mobile robot and the second mobile robot respectively occupy the remaining path of each other's driving path, based on the comparison of the passage priorities of the first mobile robot and the second mobile robot, the one with a lower passage priority between the first mobile robot and the second mobile robot is determined as the avoiding robot, and the other with a higher passage priority is determined as the avoided robot.

[0055] In one embodiment, preferably, the setting unit further includes:

[0056] The second setting module is used to determine the one with a higher passage priority between the first mobile robot and the second mobile robot as the avoiding robot, and determine the other with a lower passage priority as the avoided robot when the feasible avoidance coordinates are not searched.

[0057] In one embodiment, preferably, the vehicle avoidance device further comprises:

[0058] A real-time recording unit, used to record in real time the obstruction condition of the stopping point and the remaining path of the avoided robot that has not been traveled in the driving path of the avoided robot during the walking process of the avoiding robot from the stopping point to the driving avoiding point along the avoiding path;

[0059] The avoidance termination unit is used to drive the avoiding robot to return to the stopping point along the avoidance path when the obstruction condition at the stopping point is released or the remaining path in the driving path of the avoided robot does not cover the stopping point.

[0060] In one embodiment, preferably, the real-time recording unit includes:

[0061] A first recording module is used to record in real time the status of the abnormal robot or the restricted area that causes the avoidance robot to be blocked and stopped;

[0062] The second recording module is used to record the vehicle number, current position and target point of the avoided robot in real time.

[0063] In one embodiment, preferably, the avoidance termination unit includes:

[0064] A first avoidance termination module is used to drive the avoidance robot to return to the stopping point along the avoidance path when the abnormal robot returns to normal or the control area is released;

[0065] The second avoidance termination module is used to drive the avoiding robot to return to the stopping point along the avoidance path when the remaining path of the avoided robot does not cover the stopping point due to the update of the target point.

[0066] In the third aspect, an embodiment of the present application provides a mobile robot scheduling system, which includes a control unit and a plurality of mobile robots respectively connected to the control unit for communication, and the control unit is used to drive the mobile robots to walk; wherein the control unit executes the steps of the above-mentioned driving avoidance method when driving the mobile robots to walk.

[0067] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer instructions, and the computer instructions execute the steps of the above-mentioned driving avoidance method when run.

[0068] One or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages:

[0069] The embodiments of the present application provide a driving avoidance method, device and mobile robot scheduling system for a mobile robot. The driving avoidance method first requires setting an avoiding robot and an avoided robot; then, triggering a driving avoidance instruction of the avoiding robot based on the avoiding vehicle condition of the avoiding robot; calculating a driving avoidance point based on the remaining path that has not been traveled in the driving path of the avoided robot and the stopping point of the avoiding robot; after determining the driving avoidance point, an avoidance path can be generated and the avoiding robot can be driven to walk to the driving avoidance point to remove obstacles to the avoided robot.

[0070] It can be seen that after the avoided robot encounters an obstacle in its walking, instead of replanning the path for the avoided robot, the driving avoidance method of this embodiment can dispatch the mobile robot (i.e., the avoiding robot) that is obstructing the avoided robot to a closer driving avoidance point, thereby removing the obstacle to the avoided robot and improving the working efficiency of the dispatching system. BRIEF DESCRIPTION OF THE DRAWINGS

[0071] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments of the present invention will be briefly introduced below. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative labor.

[0072] Figure 1 It is a flowchart of the driving avoidance method described in the embodiment of the present application.

[0073] Figure 2 This is a schematic diagram of the third mobile robot causing an obstruction to the first mobile robot and the first mobile robot causing an obstruction to the second mobile robot described in the embodiment of the present application; wherein the dotted lines in the figure represent the driving routes of the first mobile robot and the second mobile robot respectively.

[0074] Figure 3 for Figure 2 Schematic diagram of the first mobile robot walking to the traffic avoidance point; in the figure, the dotted line represents the driving route of the first mobile robot.

[0075] Figure 4 This is a schematic diagram of the mutual obstruction between the first mobile robot and the second mobile robot in an embodiment of the present application; wherein the dotted lines in the figure represent the driving routes of the first mobile robot and the second mobile robot respectively.

[0076] Figure 5 for Figure 4 Schematic diagram of the first mobile robot walking to the traffic avoidance point; in the figure, the dotted line represents the driving route of the first mobile robot.

[0077] Figure 6 It is a schematic diagram of the structure of the vehicle avoidance device described in the embodiment of the present application.

[0078] Wherein, the reference numerals are:

[0079] 11-first mobile robot, 12-second mobile robot, 13-third mobile robot,

[0080] 21-first coordinate point, 22-second coordinate point, 23-driving avoidance point,

[0081] 31- Stop point,

[0082] 51 - setting unit, 52 - triggering unit, 53 - calculation unit, 54 - execution unit. DETAILED DESCRIPTION

[0083] In order to better understand the above technical solution, the example embodiments of the present application will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments of the present application. It should be understood that the present application is not limited to the exemplary embodiments described here.

[0084] Figure 1 Schematic diagram of the process of the vehicle avoidance method in the embodiment of the present application. Figure 2 This is a schematic diagram of the third mobile robot causing an obstruction to the first mobile robot and the first mobile robot causing an obstruction to the second mobile robot. Please combine Figure 1 and Figure 2 , a vehicle avoidance method for a mobile robot, the vehicle avoidance method comprising:

[0085] S1. In the process of dispatching multiple mobile robots to move, a mobile robot that blocks the movement of other mobile robots due to its own stopping is set as an avoiding robot, and the obstructed mobile robot is set as an avoided robot;

[0086] S2, triggering a driving avoidance instruction of the avoidance robot based on the avoidance condition of the avoidance robot at the stop point; wherein the avoidance condition includes that the avoidance robot currently has no task at the stop point or the avoidance robot is blocked from driving at the stop point, and the stop point occupies the remaining path in the driving path of the avoided robot; the driving avoidance instruction is used to drive the avoidance robot to drive the avoided robot to avoid the avoided robot;

[0087] S3, calculating the driving avoidance point of the avoiding robot according to the remaining path and the stopping point in the driving path of the avoided robot;

[0088] S4. Generate an avoidance path from the stopping point to the driving avoidance point and execute a driving avoidance instruction on the avoidance robot, so that the avoidance robot walks from the stopping point to the driving avoidance point along the avoidance path.

[0089] In general, the driving avoidance method of the present embodiment is applied to the process of scheduling the walking of multiple mobile robots. It can be understood that in the process of multiple mobile robots walking, it is inevitable that a mobile robot will often hinder the normal walking mobile robot due to its own reasons (such as no task) or other reasons (such as blocked forward direction). The present embodiment can eliminate the obstruction to the normal walking mobile robot by performing driving avoidance on the mobile robot, without having to re-plan the path of the normal walking mobile robot, thereby improving the scheduling efficiency.

[0090] Specifically, mobile robots generally communicate with the dispatching system in real time, and mobile robots are usually equipped with detection devices such as lidar and cameras.

[0091] In step S1, the dispatching system sets the mobile robot that blocks the movement of other mobile robots due to its own stopping as the avoiding robot, and sets the mobile robot that is blocked by the avoiding robot as the avoided robot according to the feedback information of the mobile robots; Figure 2 , Figure 2There are three mobile robots, namely the first mobile robot 11, the second mobile robot 12 and the third mobile robot 13, among which the third mobile robot 13 cannot move due to a malfunction, and the first mobile robot 11 needs to walk to the first coordinate point 21 along the planned driving path. When the first mobile robot 11 walks to the side of the third mobile robot 13, it stops due to the obstruction of the third mobile robot 13; at this time, the second mobile robot 12 needs to walk to the second coordinate point 22 along the planned driving path. Similarly, the second mobile robot 12 will be blocked by the stopped first mobile robot 11; that is, the first mobile robot 11 hinders the walking of the second mobile robot 12 due to its own stopping; at this time, this embodiment sets the first mobile robot 11 as an avoiding robot, and sets the second mobile robot 12 as an avoided robot; in other words, this embodiment requires the first mobile robot 11 to perform driving avoidance to ensure the normal walking of the second mobile robot 12.

[0092] Among them, in step S2, the scheduling system will trigger its driving avoidance instruction based on the avoidance condition of the avoidance robot (i.e. the first mobile robot mentioned above) at the stopping point, and the driving avoidance instruction is used to drive the avoidance robot to perform driving avoidance on the avoided robot (i.e. the second mobile robot mentioned above); here, the stopping point of the avoidance robot is the point where it stops due to obstruction when walking next to the third mobile robot; the avoidance condition of the avoidance robot triggering its driving avoidance instruction includes two factors, one of which is that the avoidance robot itself stops, and the other is that the stopping point of the avoidance robot simultaneously occupies the remaining path that has not been traveled in the driving path of the avoided robot, or in other words, the avoiding robot hinders the normal walking of the avoided robot due to its own stopping.

[0093] It can be understood that in the first factor of the above-mentioned avoidance vehicle condition, the avoidance robot may stop due to the obstruction of the third mobile robot. Of course, the avoidance robot may also stop because it has no task. In short, the avoidance robot should be in a non-fault stopped state.

[0094] In step S3, the dispatching system calculates the driving avoidance point 23 according to the remaining path of the avoided robot and the stopping point of the avoiding robot (see Figure 2 ).

[0095] It can be understood that, on the one hand, the driving avoidance point of the present embodiment should be a point that the avoiding robot can reach from the stopping point; on the other hand, the driving avoidance point of the avoiding robot should also avoid interfering with the remaining path that has not been traveled in the driving path of the avoided robot, or in other words, the remaining path that has not been traveled in the driving path of the avoided robot should not cover the driving avoidance point.

[0096] Among them, in step S4, after determining the driving avoidance point, the scheduling system can generate an avoidance path from the stopping point to the driving avoidance point, and then drive the avoiding robot to move along the avoidance path from the stopping point to the driving avoidance point, so that the avoiding robot removes the obstruction to the avoided robot, so that the avoided robot can walk normally to the second coordinate point.

[0097] The embodiments of the present application provide a driving avoidance method, device and mobile robot scheduling system for a mobile robot. The driving avoidance method first requires setting an avoiding robot and an avoided robot; then, triggering a driving avoidance instruction of the avoiding robot based on the avoiding vehicle condition of the avoiding robot; calculating a driving avoidance point based on the remaining path that has not been traveled in the driving path of the avoided robot and the stopping point of the avoiding robot; after determining the driving avoidance point, an avoidance path can be generated and the avoiding robot can be driven to walk to the driving avoidance point to remove obstacles to the avoided robot.

[0098] It can be seen that after the avoided robot encounters an obstacle in its walking, instead of replanning the path for the avoided robot, the driving avoidance method of this embodiment can dispatch the mobile robot (i.e., the avoiding robot) that is obstructing the avoided robot to a closer driving avoidance point, thereby removing the obstacle to the avoided robot and improving the working efficiency of the dispatching system.

[0099] In a possible implementation manner, step S3 includes:

[0100] S301, setting the coordinates corresponding to the remaining path of the avoided robot and the coordinates of the current position of the avoided robot to a locked state;

[0101] S302, searching for a number of feasible avoidance coordinates with the coordinates of the stopping point as the center and a predetermined distance as the search radius; wherein the feasible avoidance coordinates are coordinates that are in an unlocked state and can be reached by the avoidance robot from the stopping point;

[0102] S304: Calculate the score of each feasible avoidance coordinate respectively, and set the location of the feasible avoidance coordinate with the highest score as the driving avoidance point.

[0103] That is, this embodiment provides a possible calculation method for the driving avoidance point.

[0104] First, the scheduling system sets the coordinates of the current position of the robot to be avoided and the coordinates corresponding to the remaining path in its driving path to a locked state; it can be understood that the locked state here means that these coordinates are in an inaccessible or extremely costly state.

[0105] Then, the scheduling system will search with the above-mentioned stop point as the center and a predetermined distance as the search radius to obtain several feasible avoidance coordinates; as mentioned above, the feasible avoidance coordinates should be in an unlocked state and can allow the avoidance robot to reach the coordinates from the stop point.

[0106] Finally, the dispatching system will calculate the score of each feasible avoidance coordinate respectively, and set the location of the feasible avoidance coordinate with the highest score as the driving avoidance point, that is, select one of several feasible avoidance coordinates as the driving avoidance point.

[0107] It should be noted that the above-mentioned predetermined distance can be set according to actual needs, and the size of the predetermined distance is related to the map structure.

[0108] Regarding the selection of the driving avoidance point, this embodiment specifically selects the one with the highest score among several feasible avoidance coordinates as the driving avoidance point. Among them, regarding the acquisition or calculation of the score value of the feasible avoidance coordinate, please continue to refer to the following description.

[0109] That is, step S304 includes:

[0110] S3041. Set a number of attribute conditions, and set a corresponding coefficient for each attribute condition;

[0111] S3042. Calculate the score of each feasible avoidance coordinate in the following manner:

[0112] First, it is detected in turn whether the feasible avoidance coordinates satisfy each attribute condition. When the feasible avoidance coordinates satisfy the attribute condition, the attribute value of the attribute condition is assigned to 1, otherwise, the attribute value of the attribute condition is assigned to 0, so as to obtain several attribute values ​​of the feasible avoidance coordinates;

[0113] Then, several attribute values ​​of the feasible avoidance coordinates are multiplied by their corresponding coefficients and then added together to obtain the score value of the feasible avoidance coordinates;

[0114] S3043. Set the location of the feasible avoidance coordinate with the highest score as the driving avoidance point.

[0115] This embodiment provides an evaluation method for the score value of the feasible avoidance coordinates, that is, the score value of the feasible avoidance coordinates is affected by a plurality of preset attribute conditions and corresponding coefficients.

[0116] Specifically,

[0117] In step S3041, several attribute conditions of feasible avoidance coordinates can be preset first and a corresponding coefficient can be set for each attribute condition; for example, the attribute conditions can be "whether it is a main road", "whether it is a parking point", "whether the driving time from the parking point is within 5 minutes", etc., and the corresponding coefficients can be "-1", "5", "2", etc.; it can be understood that the setting principle of the above coefficients is: for example, if you want to select the feasible avoidance coordinates at the parking point as the driving avoidance point, then the corresponding coefficient can be set to a larger value, such as 5; for example, if you do not want to select the feasible avoidance coordinates at the main road as the driving avoidance point, then the corresponding coefficient can be set to a smaller value or even a negative value, such as -1.

[0118] Of course, the above-mentioned several attribute conditions can be selected according to actual needs.

[0119] In step S3042, according to the above-mentioned attribute conditions and corresponding coefficients, the score value of each feasible avoidance coordinate needs to be calculated respectively.

[0120] For example, for a certain feasible avoidance coordinate, it can be first detected in turn whether it satisfies each of the above attribute conditions, that is, whether it satisfies "whether it is a main road", "whether it is a parking spot", "whether the driving time to the parking spot is within 5 minutes", and when a certain attribute condition is met, the attribute value of the attribute condition is assigned to 1, otherwise it is assigned to 0; in this way, the three attribute values ​​of the feasible avoidance coordinate can be obtained;

[0121] Then, the score value of the feasible avoidance coordinate can be obtained by multiplying the above three attribute values ​​by their corresponding coefficients and then adding them together.

[0122] In step S3043, the location of the feasible avoidance coordinate with the highest score value is set as the driving avoidance point.

[0123] In a possible implementation manner, the vehicle avoidance method further includes:

[0124] S303: If no feasible avoidance coordinates are found, multiply the predetermined distance and continue searching for feasible avoidance coordinates.

[0125] That is, when no feasible avoidance coordinates are found in the first search, the predetermined distance may be doubled, and then the feasible avoidance coordinates may be searched again.

[0126] In a possible implementation manner, step S1 includes:

[0127] S101, when the first mobile robot 11 and the second mobile robot 12 are moving along their respective driving paths, in the case that the first mobile robot 11 and the second mobile robot 12 respectively occupy the remaining path of the other's driving path, based on the comparison of the traffic priorities of the first mobile robot 11 and the second mobile robot 12, the one of the first mobile robot 11 and the second mobile robot 12 with a lower traffic priority is determined as the avoiding robot, and the other one with a higher traffic priority is determined as the avoided robot.

[0128] S102: When no feasible avoidance coordinates are found, the one of the first mobile robot 11 and the second mobile robot 12 with a higher priority is determined as the avoidance robot, and the other one with a lower priority is determined as the avoided robot.

[0129] Return to see above Figure 2 According to the description, the first mobile robot hinders the walking of the second mobile robot, while the second mobile robot does not hinder the walking of the first mobile robot. At this time, the first mobile robot can be directly set as the avoiding robot, and the second mobile robot can be set as the avoided robot.

[0130] Understandably, this situation still exists. Please combine Figure 4 , the first mobile robot 11 and the second mobile robot 12 are moving towards each other. At this time, the two mobile robots hinder each other's walking. At this time, the dispatching system only needs to make one of them avoid driving.

[0131] Specifically, this embodiment can determine which is the avoiding robot and which is the avoided robot based on the traffic priorities of the two mobile robots. That is, the one with a lower traffic priority can be determined as the avoiding robot, and the other with a higher traffic priority can be determined as the avoided robot.

[0132] It can be understood that the above-mentioned traffic priority should be an identification or attribute of the mobile robot itself, for example, it can be an identification according to the level, or it can also be the length of the remaining path that has not been traveled in its own driving path. For example, the traffic priority of the one with a shorter remaining path length can be set higher than the traffic priority of the one with a longer remaining path length.

[0133] In addition, after determining the avoiding robot and the avoided robot according to the above-mentioned traffic priority, there may be a situation where the avoiding coordinates of the avoiding robot cannot be searched. At this time, the two mobile robots can be interchanged, that is, the one with a higher traffic priority is determined as the avoiding robot, and the one with a lower traffic priority is determined as the avoided robot.

[0134] In a possible implementation manner, the vehicle avoidance method further includes:

[0135] S5. In the process of driving the avoidance robot to move along the avoidance path from the stopping point to the driving avoidance point, the obstruction condition of the stopping point and the remaining path of the avoided robot that has not been traveled are recorded in real time;

[0136] S6. When the obstruction at the stop point is removed or the remaining path of the avoided robot does not cover the stop point, the avoidance robot is driven to return to the stop point along the avoidance path.

[0137] That is to say, in the process of driving the avoidance robot to walk to the driving avoidance point (it should be understood here that the avoidance robot has not yet reached the avoidance point), the scheduling system should also record two conditions in real time, one of which is the obstruction condition of the stopping point, and the other is the remaining path that has not been traveled in the driving path of the avoided robot; then, when one of the above two conditions changes, the avoidance robot can be driven to return to the stopping point along the original avoidance path.

[0138] Understandable, for example, the obstruction of the stop point is removed, that is, Figure 2 The third mobile robot 13 returns to normal and moves. At this time, the obstruction of the avoidance robot (that is, the first mobile robot) is released, and the first mobile robot can return to the stop point along the avoidance path and continue to walk to the first coordinate point.

[0139] For example, the avoided robot updates its coordinate points, so that the remaining path in its driving path does not cover the stopping point. At this time, the avoiding robot does not cause any obstruction to other mobile robots and can return to the stopping point along the avoidance path.

[0140] It can be seen that when the obstructed condition of the avoidance robot is resolved or the condition of blocking other mobile robots is resolved, this embodiment can improve efficiency by returning the avoidance robot to the stopping point in advance.

[0141] In a specific implementation, step S5 includes:

[0142] S501, recording in real time the status of the abnormal robot or the restricted area that caused the avoidance robot to be blocked and stopped;

[0143] S502: Record the vehicle number, current position and target point of the avoided robot in real time.

[0144] Here, it can be understood that when the target point of the avoided robot is updated or changed, the dispatching system will know that the avoided robot has replanned its driving path and determine whether the remaining path that has not been traveled covers the stopping point.

[0145] In another specific embodiment, step S6 includes:

[0146] S601: When the abnormal robot returns to normal or the control area is released, the avoidance robot is driven to return to the stop point along the avoidance path; or

[0147] S602: When the remaining path of the avoided robot does not cover the stopping point due to the update of the target point, the avoiding robot is driven to return to the stopping point along the avoiding path.

[0148] Based on the above-mentioned vehicle avoidance method, the present application also discloses a vehicle avoidance device for a mobile robot, see Figure 6 , the vehicle avoidance device includes:

[0149] A setting unit, used for setting a mobile robot that blocks the walking of other mobile robots due to its own stopping as an avoiding robot, and setting the obstructed mobile robot as an avoided robot in the process of scheduling the walking of multiple mobile robots;

[0150] a trigger unit, for triggering a driving avoidance instruction of the avoidance robot based on the avoiding vehicle condition of the avoidance robot at the stopping point; wherein the avoiding vehicle condition includes that the avoidance robot currently has no task at the stopping point or the avoiding robot is blocked from driving at the stopping point, and the stopping point occupies the remaining path in the driving path of the avoided robot; the driving avoidance instruction is used to drive the avoidance robot to perform driving avoidance on the avoided robot;

[0151] A calculation unit, used for calculating the driving avoidance point of the avoiding robot according to the remaining path and the stopping point in the driving path of the avoided robot;

[0152] The execution unit is used to generate an avoidance path from the stopping point to the driving avoidance point and execute a driving avoidance instruction to the avoidance robot, so that the avoidance robot walks from the stopping point to the driving avoidance point along the avoidance path.

[0153] In one possible implementation, the computing unit includes:

[0154] A coordinate locking module is used to set the coordinates corresponding to the remaining path that has not been traveled in the driving path of the avoided robot and the coordinates of the current position of the avoided robot to a locked state;

[0155] A first coordinate search module is used to search for a number of feasible avoidance coordinates with the coordinates of the stopping point as the center and a predetermined distance as the search radius; wherein the feasible avoidance coordinates are coordinates that are in an unlocked state and can be reached by the avoidance robot from the stopping point;

[0156] The coordinate setting module calculates the score of each of the feasible avoidance coordinates respectively, and sets the position of the feasible avoidance coordinate with the highest score as the driving avoidance point.

[0157] In one possible implementation, the coordinate setting module includes:

[0158] The attribute condition setting submodule is used to set a number of attribute conditions and set a corresponding coefficient for each of the attribute conditions;

[0159] The scoring value calculation submodule is used to calculate the scoring value of each of the feasible avoidance coordinates in the following manner:

[0160] First, whether the feasible avoidance coordinates satisfy each of the attribute conditions is detected in turn, and when the feasible avoidance coordinates satisfy the attribute condition, the attribute value of the attribute condition is assigned to 1, otherwise, the attribute value of the attribute condition is assigned to 0, so as to obtain several attribute values ​​of the feasible avoidance coordinates;

[0161] Then, several attribute values ​​of the feasible avoidance coordinates are multiplied by their corresponding coefficients and then added together to obtain a score value of the feasible avoidance coordinates;

[0162] The coordinate setting submodule is used to set the location of the feasible avoidance coordinate with the highest score as the driving avoidance point.

[0163] In one possible implementation, the computing unit includes:

[0164] The second coordinate search module is used to multiply the predetermined distance and continue searching for feasible avoidance coordinates when no feasible avoidance coordinates are found.

[0165] In a possible implementation manner, the setting unit includes:

[0166] The first setting module is used for determining the one with lower traffic priority as the avoiding robot and the other with higher traffic priority as the avoided robot based on the comparison of traffic priorities of the first mobile robot and the second mobile robot when the first mobile robot and the second mobile robot are walking along their respective driving paths and the first mobile robot and the second mobile robot respectively occupy the remaining path of the other's driving path.

[0167] In a possible implementation manner, the setting unit further includes:

[0168] The second setting module is used to determine the one with a higher passage priority among the first mobile robot and the second mobile robot as the avoiding robot and the other with a lower passage priority as the avoided robot when no feasible avoidance coordinates are found.

[0169] In a possible implementation manner, the vehicle avoidance device further includes:

[0170] A real-time recording unit, used to record in real time the obstruction condition of the stopping point and the remaining path of the avoided robot in the driving path when the avoiding robot is driven to walk from the stopping point to the driving avoiding point along the avoiding path;

[0171] The avoidance termination unit is used to drive the avoidance robot to return to the stopping point along the avoidance path when the obstruction condition of the stopping point is released or the remaining path in the driving path of the avoided robot does not cover the stopping point.

[0172] In a possible implementation manner, the real-time recording unit includes:

[0173] The first recording module is used to record in real time the status of the abnormal robot or the restricted area that causes the avoidance robot to be blocked and stopped;

[0174] The second recording module is used to record the vehicle number, current position and target point of the avoided robot in real time.

[0175] In a possible implementation manner, the avoidance termination unit includes:

[0176] The first avoidance termination module is used to drive the avoidance robot to return to the stop point along the avoidance path when the abnormal robot returns to normal or the control area is released;

[0177] The second avoidance termination module is used to drive the avoiding robot to return to the stopping point along the avoidance path when the remaining path of the avoided robot in the driving path does not cover the stopping point due to the update of the target point.

[0178] Based on the above-mentioned vehicle avoidance method, the present application also discloses a mobile robot scheduling system, which includes a control unit and a plurality of mobile robots respectively connected to the control unit for communication, and the control unit is used to drive the mobile robot to walk; wherein the control unit executes the steps of the above-mentioned vehicle avoidance method when driving the mobile robot to walk.

[0179] Based on the above-mentioned vehicle avoidance method, the present application also discloses a computer-readable storage medium, which stores computer instructions. The computer instructions execute the steps of the above-mentioned vehicle avoidance method when running.

[0180] The basic principles of the present application are described above in conjunction with specific embodiments. However, it should be noted that the advantages, strengths, effects, etc. mentioned in the present application are only examples and not limitations, and it cannot be considered that these advantages, strengths, effects, etc. are required by each embodiment of the present application. In addition, the specific details disclosed above are only for the purpose of illustration and ease of understanding, not for limitation, and the above details do not limit the present application to being implemented by adopting the above specific details.

[0181] The block diagrams of the devices, apparatuses, equipment, and systems involved in this application are only illustrative examples and are not intended to require or imply that they must be connected, arranged, and configured in the manner shown in the block diagram. As will be appreciated by those skilled in the art, these devices, apparatuses, equipment, and systems can be connected, arranged, and configured in any manner. Words such as "including", "comprising", "having", etc. are open words, referring to "including but not limited to", and can be used interchangeably with them. The words "or" and "and" used here refer to the words "and / or" and can be used interchangeably with them, unless the context clearly indicates otherwise. The words "such as" used here refer to the phrase "such as but not limited to", and can be used interchangeably with them.

[0182] It should also be noted that in the apparatus, device and method of the present application, each component or each step can be decomposed and / or recombined. Such decomposition and / or recombination should be regarded as equivalent solutions of the present application.

[0183] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present application. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the scope of the present application. Therefore, the present application is not intended to be limited to the aspects shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

[0184] The above description has been given for the purpose of illustration and description. In addition, this description is not intended to limit the embodiments of the present application to the forms disclosed herein. Although multiple example aspects and embodiments have been discussed above, those skilled in the art will recognize that some variations, modifications, changes, additions and sub-combinations thereof should be included within the scope of protection of the present invention.

Claims

1. A vehicle avoidance method for a mobile robot, characterized in that: The driving avoidance method comprises: In the process of scheduling multiple mobile robots to move, a mobile robot that blocks the movement of other mobile robots due to its own stopping is set as an avoiding robot, and the obstructed mobile robot is set as an avoided robot; The driving avoidance instruction of the avoidance robot is triggered based on the avoiding vehicle condition of the avoidance robot at the stopping point; wherein the avoiding vehicle condition includes that the avoidance robot currently has no task at the stopping point or the avoiding robot is blocked from driving at the stopping point, and the stopping point occupies the remaining path in the driving path of the avoided robot; the driving avoidance instruction is used to drive the avoidance robot to perform driving avoidance on the avoided robot; Calculating the driving avoidance point of the avoiding robot according to the remaining path that has not been traveled in the driving path of the avoided robot and the stopping point; An avoidance path from the stopping point to the vehicle avoidance point is generated and the vehicle avoidance instruction is executed on the avoidance robot, so that the avoidance robot walks from the stopping point to the vehicle avoidance point along the avoidance path.

2. The vehicle avoidance method according to claim 1, characterized in that: The step of calculating the driving avoidance point of the avoiding robot according to the remaining path not traveled in the driving path of the avoided robot and the stopping point comprises: Setting the coordinates corresponding to the remaining path of the avoided robot that has not been traveled in the driving path of the avoided robot and the coordinates of the current position of the avoided robot to a locked state; Searching for a number of feasible avoidance coordinates with the coordinates of the stopping point as the center and a predetermined distance as the search radius; wherein the feasible avoidance coordinates are coordinates that are in an unlocked state and can be reached by the avoidance robot from the stopping point; The score of each of the feasible avoidance coordinates is calculated respectively, and the position of the feasible avoidance coordinate with the highest score is set as the driving avoidance point.

3. The vehicle avoidance method according to claim 2, characterized in that: The step of respectively calculating the score value of each of the feasible avoidance coordinates and setting the position of the feasible avoidance coordinate with the highest score value as the driving avoidance point comprises: Setting a number of attribute conditions, and setting a corresponding coefficient for each of the attribute conditions; The score value of each feasible avoidance coordinate is calculated as follows: First, whether the feasible avoidance coordinates satisfy each of the attribute conditions is detected in turn, and when the feasible avoidance coordinates satisfy the attribute condition, the attribute value of the attribute condition is assigned to 1, otherwise, the attribute value of the attribute condition is assigned to 0, so as to obtain several attribute values ​​of the feasible avoidance coordinates; Then, several attribute values ​​of the feasible avoidance coordinates are multiplied by their corresponding coefficients and then added together to obtain a score value of the feasible avoidance coordinates; The location of the feasible avoidance coordinate with the highest score is set as the driving avoidance point.

4. The vehicle avoidance method according to claim 2, characterized in that: The driving avoidance method comprises: When the feasible avoidance coordinates are not found, the predetermined distance is multiplied and the search for the feasible avoidance coordinates continues.

5. The vehicle avoidance method according to claim 1, characterized in that: The step of setting the mobile robot that blocks the walking of other mobile robots due to its own stopping as an avoiding robot and setting the blocked mobile robot as an avoided robot comprises: When the first mobile robot and the second mobile robot are walking along their respective driving paths, in the case that the first mobile robot and the second mobile robot respectively occupy the remaining path of each other's driving path, based on the comparison of the traffic priorities of the first mobile robot and the second mobile robot, the one of the first mobile robot and the second mobile robot with a lower traffic priority is determined as the avoiding robot, and the other one with a higher traffic priority is determined as the avoided robot.

6. The vehicle avoidance method according to claim 5, characterized in that: The driving avoidance method further comprises: When the feasible avoidance coordinates are not found, the one of the first mobile robot and the second mobile robot with a higher traffic priority is determined as the avoidance robot, and the other one with a lower traffic priority is determined as the avoided robot.

7. The vehicle avoidance method according to claim 1, characterized in that: The driving avoidance method further comprises: In the process of driving the avoidance robot to walk along the avoidance path from the stopping point to the driving avoidance point, the obstruction condition of the stopping point and the remaining path of the avoided robot that has not been traveled are recorded in real time; When the obstruction condition of the stop point is removed or the remaining path of the avoided robot does not cover the stop point, the avoiding robot is driven to return to the stop point along the avoidance path.

8. The vehicle avoidance method according to claim 7, characterized in that: The step of recording in real time the obstructed condition of the stop point and the remaining path of the avoided robot that has not been traveled in the driving path comprises: Record in real time the status of the abnormal robot or the restricted area that caused the avoidance robot to be blocked and stopped; The vehicle number, current position and target point of the avoided robot are recorded in real time.

9. The vehicle avoidance method according to claim 8, characterized in that: When the obstruction at the stop point is removed or the remaining path of the avoided robot does not cover the stop point, the step of driving the avoidance robot to return to the stop point along the avoidance path comprises: When the abnormal robot returns to normal or the restricted area is released, the avoidance robot is driven to return to the stop point along the avoidance path; or When the remaining path of the avoided robot in its driving path does not cover the stopping point due to the target point update, the avoiding robot is driven to return to the stopping point along the avoiding path.

10. A vehicle avoidance device for a mobile robot, characterized in that: The vehicle avoidance device comprises: A setting unit, used for setting a mobile robot that blocks the walking of other mobile robots due to its own stopping as an avoiding robot, and setting the obstructed mobile robot as an avoided robot in the process of scheduling the walking of multiple mobile robots; a triggering unit, configured to trigger a driving avoidance instruction of the avoidance robot based on the avoiding vehicle condition of the avoidance robot at a stopping point; wherein the avoiding vehicle condition includes that the avoidance robot currently has no task at the stopping point or the avoiding robot is blocked from driving at the stopping point, and the stopping point occupies the remaining path in the driving path of the avoided robot; the driving avoidance instruction is used to drive the avoidance robot to perform driving avoidance on the avoided robot; A calculation unit, used for calculating the driving avoidance point of the avoiding robot according to the remaining path not traveled in the driving path of the avoided robot and the stopping point; An execution unit is used to generate an avoidance path from the stopping point to the driving avoidance point and execute the driving avoidance instruction to the avoiding robot, so that the avoiding robot walks from the stopping point to the driving avoidance point along the avoidance path.

11. A mobile robot scheduling system, characterized in that: The mobile robot scheduling system includes a control unit and a plurality of mobile robots respectively connected to the control unit for communication, wherein the control unit is used to drive the mobile robots to walk; wherein the control unit executes the steps of the driving avoidance method as described in any one of claims 1 to 9 when driving the mobile robots to walk.

12. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions, when executed, execute the steps of the driving avoidance method as claimed in any one of claims 1 to 9.