A method for automatically returning a robot

By generating and sorting key nodes, using odometer position and lidar data, the robot automatically returns in the absence of global positioning information, solving the problem of return failure caused by relying on global positioning information in the existing technology, and improving the return efficiency and accuracy.

CN118721217BActive Publication Date: 2024-12-06CHENGDU EVENTEC SCI & TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411218137.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-09-02
Publication Date
2024-12-06
Estimated Expiration
2044-09-02

AI Technical Summary

Technical Problem

Robots cannot return automatically in the absence of global positioning information. The existing technology relies heavily on global positioning information, resulting in failure to return when positioning errors.

Method used

By obtaining the robot's passing trajectory record from the outbound starting point to the outbound end point, multiple key nodes are generated based on preset rules, and then sorted to the key nodes in sequence to return to the starting point. The path correction is performed using odometer position and lidar data. , realize automatic return without global positioning information.

Benefits of technology

Without global positioning information, the robot can automatically return, reducing return time and improving accuracy, avoiding return failures caused by positioning errors.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118721217B_ABST
    Figure CN118721217B_ABST
Patent Text Reader

Abstract

The present application discloses a method for automatic robot return, which relates to the field of robot technology, including: obtaining a robot's travel trajectory record from the outbound starting point to the outbound end point, generating multiple key nodes of the robot on the travel trajectory based on preset rules, and forming a first key node set by all generated key nodes; when returning, sorting the key nodes in the second key node set from first to last according to the order of obtaining the key nodes in the second key node set, and the robot moves from the outbound end point to the first key node after sorting, and then moves from one key node to the next key node in sequence until returning to the outbound starting point. The present application's method for automatic robot return is applicable to automatic robot return.
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 method for automatic robot return. Background Art

[0002] At present, there are mature solutions for automatic return when the robot's global positioning information is correct. For example, the global coordinates of the outbound starting point P1 are recorded. When returning, the robot's current global coordinates are used as the global coordinates of the return starting point P2. A path search algorithm, such as the A* algorithm, is used to search for the path from P1 to P2. The path can be returned by tracking the path. However, this method is heavily dependent on the robot's global positioning information. If the robot's own positioning information is wrong, this method will fail. Summary of the invention

[0003] The technical problem to be solved by this application is: how can the robot return automatically without the help of global positioning information.

[0004] The technical solution adopted by this application to solve its technical problem is:

[0005] In a first aspect, the present application provides a method for automatic return of a robot, comprising the following steps:

[0006] S1, obtaining a travel trajectory record of the robot from the outbound starting point to the outbound end point, generating multiple key nodes of the robot on the travel trajectory based on preset rules, and forming a first key node set by all the generated key nodes;

[0007] S2, when returning, sort the key nodes in the second key node set from first to last according to the order in which the key nodes in the second key node set are obtained, and the robot moves from the end point of the outbound journey to the first key node after sorting, and then moves from one key node to the next key node in sequence until it returns to the starting point of the outbound journey.

[0008] The preset rule may be a first preset rule, which is: starting from the current key node, the robot moves a specific distance to generate the next key node, and the number of the generated key nodes increases in sequence according to the generation time of the key nodes. The preset rule may also be a second preset rule, which is: starting from the current key node, the robot rotates a specific angle to generate the next key node, and the number of the generated key nodes increases in sequence according to the generation time of the key nodes. The preset rule may also be a third preset rule, which is: starting from the current key node, the robot moves a specific distance or the robot rotates a specific angle to generate the next key node, and the number of the generated key nodes increases in sequence according to the generation time of the key nodes.

[0009] When generating key nodes, the starting point of the outbound trip can be used as the first key node generated.

[0010] The first key node set is a set consisting of all generated key nodes.

[0011] Obtaining the sequence of key nodes in the second key node set does not refer to the sequence of generating these key nodes, but refers to determining the sequence of these key nodes in the process of obtaining the second key node set (ie, determining which key nodes the second key node set includes).

[0012] Based on the first aspect, further, the second key node set can be obtained by the following method:

[0013] S211, obtaining the key node with the smallest key node number among all key nodes that meet the first condition in the first key node set;

[0014] S212, taking the key node obtained in step S211 as the current key node; deleting all key nodes that meet the first condition from the first key node set, and taking the key node set obtained thereby as the current third key node set; executing step S213;

[0015] S213, obtaining the key node with the smallest key node number among all key nodes that meet the second condition in the current third key node set; executing step S214;

[0016] S214, determining whether the key node obtained in step S213 is the outbound starting point. If the key node obtained in step S213 is the outbound starting point, the key node obtained in step S211 and all key nodes obtained by each execution of step S213 together constitute a second key node set; if the key node obtained in step S213 is not the outbound starting point, executing step S215;

[0017] S215, delete all key nodes that meet the second condition from the current third key node set, and use the key node set obtained in this way as the current third key node set for the next cycle; use the key nodes obtained in step S213 as the current key nodes for the next cycle; execute step S213.

[0018] The first condition mentioned above means that the distance between the key node and the outbound end point is less than or equal to a first preset distance.

[0019] The second condition mentioned above means that the distance between the key node and the current key node is less than or equal to the second preset distance.

[0020] Based on the first aspect, the second key node set can also be obtained by the following method:

[0021] S221, obtaining the key node with the smallest key node number among all key nodes that meet the third condition in the first key node set;

[0022] S222, taking the key nodes obtained in step S221 as the current key nodes; deleting all key nodes that meet the third condition from the first key node set, and taking the key node set obtained thereby as the current fourth key node set; executing step S223;

[0023] S223, obtaining the key node with the smallest key node number among all key nodes that meet the fourth condition in the current fourth key node set; executing step S224;

[0024] S224, determining whether the key node obtained in step S223 is the outbound starting point. If the key node obtained in step S223 is the outbound starting point, the key node obtained in step S221 and all key nodes obtained by each execution of step S223 together constitute a second key node set; if the key node obtained in step S223 is not the outbound starting point, executing step S225;

[0025] S225, delete all key nodes that meet the fourth condition from the current fourth key node set, and use the key node set obtained in this way as the current fourth key node set for the next cycle; use the key nodes obtained by step S223 as the current key nodes for the next cycle; execute step S223.

[0026] The third condition mentioned above means that the angle difference between the key node and the outbound end point is less than or equal to the first preset angle difference.

[0027] The fourth condition refers to that the angle difference between the key node and the current key node is less than or equal to the second preset angle difference.

[0028] The angle difference between a key node and the end point of the outward journey refers to the absolute value of the angle difference between the posture angle of the robot at the key node and the posture angle of the robot at the end point of the outward journey.

[0029] The angle difference between a key node and another key node refers to the absolute value of the angle difference between the posture angle of the robot at the key node and the posture angle of the robot at another key node.

[0030] Based on the first aspect, the second key node set can also be obtained by the following method:

[0031] S231, obtaining the key node with the smallest key node number among all key nodes that meet the fifth condition in the first key node set;

[0032] S232, taking the key nodes obtained in step S231 as the current key nodes; deleting all key nodes that meet the fifth condition from the first key node set, and taking the key node set obtained in this way as the current fifth key node set; executing step S233;

[0033] S233, obtaining the key node with the smallest key node number among all key nodes that meet the sixth condition in the current fifth key node set; executing step S234;

[0034] S234, determining whether the key node obtained in step S233 is the outbound starting point. If the key node obtained in step S233 is the outbound starting point, the key node obtained in step S231 and all key nodes obtained by each execution of step S233 together constitute a second key node set; if the key node obtained in step S233 is not the outbound starting point, executing step S235;

[0035] S235, delete all key nodes that meet the sixth condition from the current fifth key node set, and use the key node set obtained in this way as the current fifth key node set for the next cycle; use the key nodes obtained through step S233 as the current key nodes for the next cycle; execute step S233.

[0036] The fifth condition mentioned above means that the distance between the key node and the outbound end point is less than or equal to the third preset distance, or the angle difference between the key node and the outbound end point is less than or equal to the third preset angle difference.

[0037] The sixth condition refers to that the distance between the key node and the current key node is less than or equal to the fourth preset distance, or the angle difference between the key node and the current key node is less than or equal to the fourth preset angle difference.

[0038] Based on the first aspect, the second key node set can also be obtained by the following method:

[0039] S241, obtaining the key node with the largest key node number among all key nodes that meet the seventh condition in the first key node set;

[0040] S242, taking the key node obtained in step S241 as the current key node; deleting all key nodes that meet the seventh condition from the first key node set, and taking the key node set obtained thereby as the current sixth key node set; executing step S243;

[0041] S243, obtaining the key node with the smallest key node number among all key nodes that meet the eighth condition in the current sixth key node set; executing step S244;

[0042] S244, determining whether the key node obtained in step S243 is the outbound starting point. If the key node obtained in step S243 is the outbound starting point, the key node obtained in step S241 and all key nodes obtained by each execution of step S243 together constitute a second key node set; if the key node obtained in step S243 is not the outbound starting point, executing step S245;

[0043] S245, delete all key nodes that meet the eighth condition from the current sixth key node set, and use the key node set obtained in this way as the current sixth key node set for the next cycle; use the key nodes obtained through step S243 as the current key nodes for the next cycle; execute step S243.

[0044] The seventh condition mentioned above means that the distance between the key node and the outbound end point is less than or equal to the fifth preset distance.

[0045] The eighth condition refers to that the distance between the key node and the current key node is less than or equal to the sixth preset distance.

[0046] Based on the first aspect, the second key node set can also be obtained by the following method:

[0047] S251, obtaining a key node with the largest key node number among all key nodes that meet the ninth condition in the first key node set;

[0048] S252, taking the key node obtained in step S251 as the current key node; deleting all key nodes that meet the ninth condition from the first key node set, and taking the key node set obtained thereby as the current seventh key node set; executing step S253;

[0049] S253, obtaining the key node with the smallest key node number among all key nodes that meet the tenth condition in the current seventh key node set; executing step S254;

[0050] S254, determining whether the key node obtained in step S253 is the outbound starting point. If the key node obtained in step S253 is the outbound starting point, the key node obtained in step S251 and all key nodes obtained by each execution of step S253 together constitute a second key node set; if the key node obtained in step S253 is not the outbound starting point, executing step S255;

[0051] S255, delete all key nodes that meet the tenth condition from the current seventh key node set, and use the key node set obtained in this way as the current seventh key node set for the next cycle; use the key nodes obtained through step S253 as the current key nodes for the next cycle; execute step S253.

[0052] The ninth condition mentioned above means that the angle difference between the key node and the outbound end point is less than or equal to the fifth preset angle difference.

[0053] The tenth condition mentioned above means that the angle difference between the key node and the current key node is less than or equal to the sixth preset angle difference.

[0054] Based on the first aspect, the second key node set can also be obtained by the following method:

[0055] S261, obtaining the key node with the largest key node number among all key nodes that meet the eleventh condition in the first key node set;

[0056] S262, taking the key node obtained in step S261 as the current key node; deleting all key nodes that meet the eleventh condition from the first key node set, and taking the key node set obtained thereby as the current eighth key node set; executing step S263;

[0057] S263, obtaining the key node with the smallest key node number among all key nodes that meet the twelfth condition in the current eighth key node set; executing step S264;

[0058] S264, determining whether the key node obtained in step S263 is the outbound starting point. If the key node obtained in step S263 is the outbound starting point, the key node obtained in step S261 and all key nodes obtained by each execution of step S263 together constitute a second key node set; if the key node obtained in step S263 is not the outbound starting point, executing step S265;

[0059] S265, delete all key nodes that meet the twelfth condition from the current eighth key node set, and use the key node set obtained in this way as the current eighth key node set for the next cycle; use the key nodes obtained through step S263 as the current key nodes for the next cycle; execute step S263.

[0060] The eleventh condition means that the distance between the key node and the outbound end point is less than or equal to the seventh preset distance, or the angle difference between the key node and the outbound end point is less than or equal to the seventh preset angle difference.

[0061] The twelfth condition means that the distance between the key node and the current key node is less than or equal to the eighth preset distance, or the angle difference between the key node and the current key node is less than or equal to the eighth preset angle difference.

[0062] Based on the first aspect, further, the robot moves from the outbound end point (i.e., the return start point) to the first key node after sorting, including the following steps:

[0063] Get the robot's corrected odometer position at the end of the outbound trip;

[0064] According to the corrected odometer posture of the robot at the outbound end point, the first key node after sorting is used as the target node corresponding to the outbound end point, and the robot is controlled to move to the first key node after sorting.

[0065] Based on the first aspect, further, the robot moves from one key node to the next key node in sequence, comprising the following steps:

[0066] Get the robot's corrected odometer position at the current key node;

[0067] According to the corrected odometer posture of the robot at the current key node, the next key node of the current key node is used as the target node corresponding to the current key node, and the robot is controlled to move to the next key node of the current key node.

[0068] Based on the first aspect, further, the above-mentioned method of obtaining the corrected odometer posture of the robot at the end point of the outbound journey or obtaining the corrected odometer posture of the robot at the current key node adopts the following method:

[0069] ;

[0070] in, The corrected odometer position of the robot at the end of the outbound journey or the current key node; is the conversion matrix of the odometer posture of the robot before correction at the outbound end point to the odometer posture of the target node corresponding to the outbound end point before correction, or the conversion matrix of the odometer posture of the robot before correction at the current key node to the odometer posture of the target node corresponding to the current key node before correction; for The transposed matrix of It is the odometer pose of the robot before correction at the target node corresponding to the end point of the outbound journey or the target node corresponding to the current key node.

[0071] In a second aspect, the present application further provides an electronic device, comprising a memory for storing one or more programs and a processor. When the one or more programs are executed by the processor, any method in the first aspect described above is implemented.

[0072] In a third aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements any one of the methods in the first aspect described above.

[0073] The beneficial effects of this application are:

[0074] The robot can return automatically without global positioning information. BRIEF DESCRIPTION OF THE DRAWINGS

[0075] Figure 1 A flowchart of the method for automatic return of a robot provided in an embodiment of the present application.

[0076] Figure 2 A structural block diagram of an electronic device provided in an embodiment of the present application.

[0077] The reference numerals are: 101, memory; 102, processor; 103, communication interface. DETAILED DESCRIPTION

[0078] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all the embodiments. The components of the embodiments of the present application described and shown in the drawings here can be arranged and designed in various different configurations.

[0079] Therefore, the following detailed description of the embodiments of the present application provided in the accompanying drawings is not intended to limit the scope of the present application for which protection is sought, but merely represents selected embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without creative work are within the scope of protection of the present application.

[0080] It should be noted that similar reference numerals and letters denote similar items in the following drawings, and therefore, once an item is defined in one drawing, further definition and explanation thereof is not required in subsequent drawings.

[0081] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0082] In the description of the embodiments of the present application, "plurality" means at least 2.

[0083] like Figure 1 As shown, an embodiment of a method for automatic robot return of the present application includes the following steps:

[0084] S1, obtaining a travel trajectory record of the robot from the outbound starting point to the outbound end point, generating multiple key nodes of the robot on the travel trajectory based on preset rules, and forming a first key node set by all the generated key nodes;

[0085] S2, when returning, sort the key nodes in the second key node set from first to last according to the order in which the key nodes in the second key node set are obtained, and the robot moves from the end point of the outbound journey to the first key node after sorting, and then moves from one key node to the next key node in sequence until it returns to the starting point of the outbound journey.

[0086] The unmanned delivery robot includes a motor encoder, an IMU, and a 2D laser radar. Among them, the wheel odometer pose of the robot at a certain point can be obtained through the encoder and the IMU (i.e., inertial measurement unit). The wheel odometer pose of the robot at a certain point here is the wheel odometer pose of the robot before correction at that point.

[0087] When generating the key nodes, the outbound starting point can be used as the first key node generated. The information stored in the array corresponding to the generated key node includes the key node number, the robot's odometer position before correction at the key node, and the robot's lidar point cloud data at the key node.

[0088] The above-mentioned order of obtaining the key nodes in the second key node set does not refer to the order of generating these key nodes, but refers to the order of determining these key nodes in the process of obtaining the second key node set (ie, determining which key nodes the second key node set includes).

[0089] In one embodiment of the present application, the preset rule may be a first preset rule, and the first preset rule is: starting from the current key node, the robot moves a specific distance (for example, 1 meter) to generate the next key node, and the key node numbers generated are incremented in sequence according to the generation time of the key node. For example, a key node numbered 00001 is generated first, then a key node numbered 00005 is generated, and then a key node numbered 00007 is generated.

[0090] In one embodiment of the present application, the preset rule may also be a second preset rule, and the second preset rule is: taking the current key node as the starting point, the robot's posture rotates by a specific angle (for example, 15°) to generate the next key node, and the numbering of the generated key nodes increases sequentially according to the generation time of the key nodes.

[0091] In one embodiment of the present application, the preset rule can also be a third preset rule, and the third preset rule is: taking the current key node as the starting point, the robot moves a specific distance (for example, 1 meter) or the robot's posture rotates a specific angle (for example, 15°) to generate the next key node, and the numbering of the generated key nodes increases sequentially according to the generation time of the key nodes.

[0092] In one embodiment of the present application, the second key node set is obtained by the following method:

[0093] S211, obtaining the key node with the smallest key node number among all key nodes that meet the first condition in the first key node set;

[0094] S212, taking the key node obtained in step S211 as the current key node; deleting all key nodes that meet the first condition from the first key node set, and taking the key node set obtained thereby as the current third key node set; executing step S213;

[0095] S213, obtaining the key node with the smallest key node number among all key nodes that meet the second condition in the current third key node set; executing step S214;

[0096] S214, determining whether the key node obtained in step S213 is the outbound starting point. If the key node obtained in step S213 is the outbound starting point, the key node obtained in step S211 and all key nodes obtained by each execution of step S213 together constitute a second key node set; if the key node obtained in step S213 is not the outbound starting point, executing step S215;

[0097] S215, delete all key nodes that meet the second condition from the current third key node set, and use the key node set obtained in this way as the current third key node set for the next cycle; use the key nodes obtained in step S213 as the current key nodes for the next cycle; execute step S213.

[0098] The first condition is that the distance between the key node and the destination of the outbound journey is less than or equal to a first preset distance. In one embodiment of the present application, the first preset distance is 1 meter.

[0099] The second condition refers to that the distance between the key node and the current key node is less than or equal to the second preset distance. In one embodiment of the present application, the second preset distance is 1 meter.

[0100] On the outbound journey, the robot may take repeated detours on a certain section of the road. For example, after the robot goes from point A to point B, the robot goes from point B to point A, repeating the same journey many times. However, the key nodes that meet the first preset rules will still be recorded in the repeated journeys. The above-mentioned technical means of the present application can help the robot reduce repeated paths on the return journey and save return time.

[0101] In one embodiment of the present application, the second key node set may also be obtained by the following method:

[0102] S221, obtaining the key node with the smallest key node number among all key nodes that meet the third condition in the first key node set;

[0103] S222, taking the key nodes obtained in step S221 as the current key nodes; deleting all key nodes that meet the third condition from the first key node set, and taking the key node set obtained thereby as the current fourth key node set; executing step S223;

[0104] S223, obtaining the key node with the smallest key node number among all key nodes that meet the fourth condition in the current fourth key node set; executing step S224;

[0105] S224, determining whether the key node obtained in step S223 is the outbound starting point. If the key node obtained in step S223 is the outbound starting point, the key node obtained in step S221 and all key nodes obtained by each execution of step S223 together constitute a second key node set; if the key node obtained in step S223 is not the outbound starting point, executing step S225;

[0106] S225, delete all key nodes that meet the fourth condition from the current fourth key node set, and use the key node set obtained in this way as the current fourth key node set for the next cycle; use the key nodes obtained by step S223 as the current key nodes for the next cycle; execute step S223.

[0107] The angle difference between a key node and the end point of the outward journey refers to the absolute value of the angle difference between the posture angle of the robot at the key node and the posture angle of the robot at the end point of the outward journey.

[0108] The angle difference between a key node and another key node refers to the absolute value of the angle difference between the posture angle of the robot at the key node and the posture angle of the robot at another key node.

[0109] The third condition refers to that the angle difference between the key node and the outbound end point is less than or equal to the first preset angle difference. In one embodiment of the present application, the first preset angle difference is 15°.

[0110] The fourth condition refers to that the angle difference between the key node and the current key node is less than or equal to the second preset angle difference. In one embodiment of the present application, the second preset angle difference is 15°.

[0111] On the outbound journey, the robot may take repeated detours on a certain section of the road. For example, after the robot goes from point A to point B, the robot goes from point B to point A, repeating the same journey many times. However, the key nodes that meet the second preset rules will still be recorded in the repeated journeys. The above-mentioned technical means of the present application can help the robot reduce repeated paths on the return journey and save return time.

[0112] In one embodiment of the present application, the second key node set may also be obtained by the following method:

[0113] S231, obtaining the key node with the smallest key node number among all key nodes that meet the fifth condition in the first key node set;

[0114] S232, taking the key nodes obtained in step S231 as the current key nodes; deleting all key nodes that meet the fifth condition from the first key node set, and taking the key node set obtained in this way as the current fifth key node set; executing step S233;

[0115] S233, obtaining the key node with the smallest key node number among all key nodes that meet the sixth condition in the current fifth key node set; executing step S234;

[0116] S234, determining whether the key node obtained in step S233 is the outbound starting point. If the key node obtained in step S233 is the outbound starting point, the key node obtained in step S231 and all key nodes obtained by each execution of step S233 together constitute a second key node set; if the key node obtained in step S233 is not the outbound starting point, executing step S235;

[0117] S235, delete all key nodes that meet the sixth condition from the current fifth key node set, and use the key node set obtained in this way as the current fifth key node set for the next cycle; use the key nodes obtained through step S233 as the current key nodes for the next cycle; execute step S233.

[0118] The fifth condition means that the distance between the key node and the outbound end point is less than or equal to the third preset distance, or the angle difference between the key node and the outbound end point is less than or equal to the third preset angle difference. In one embodiment of the present application, the third preset distance is 1 meter. In one embodiment of the present application, the third preset angle difference is 15°.

[0119] The sixth condition refers to that the distance between the key node and the current key node is less than or equal to the fourth preset distance, or the angle difference between the key node and the current key node is less than or equal to the fourth preset angle difference. In one embodiment of the present application, the fourth preset distance is 1 meter. In one embodiment of the present application, the fourth preset angle difference is 15°.

[0120] In one embodiment of the present application, the second key node set may also be obtained by the following method:

[0121] S241, obtaining the key node with the largest key node number among all key nodes that meet the seventh condition in the first key node set;

[0122] S242, taking the key node obtained in step S241 as the current key node; deleting all key nodes that meet the seventh condition from the first key node set, and taking the key node set obtained thereby as the current sixth key node set; executing step S243;

[0123] S243, obtaining the key node with the smallest key node number among all key nodes that meet the eighth condition in the current sixth key node set; executing step S244;

[0124] S244, determining whether the key node obtained in step S243 is the outbound starting point. If the key node obtained in step S243 is the outbound starting point, the key node obtained in step S241 and all key nodes obtained by each execution of step S243 together constitute a second key node set; if the key node obtained in step S243 is not the outbound starting point, executing step S245;

[0125] S245, delete all key nodes that meet the eighth condition from the current sixth key node set, and use the key node set obtained in this way as the current sixth key node set for the next cycle; use the key nodes obtained through step S243 as the current key nodes for the next cycle; execute step S243.

[0126] The seventh condition refers to that the distance between the key node and the destination of the outbound journey is less than or equal to the fifth preset distance. In one embodiment of the present application, the fifth preset distance is 1 meter.

[0127] The eighth condition refers to that the distance between the key node and the current key node is less than or equal to the sixth preset distance. In one embodiment of the present application, the sixth preset distance is 1 meter.

[0128] On the outbound journey, the robot may take repeated detours on a certain section of the road, for example, after the robot goes from point A to point B, it goes from point B to point A again, repeating the same journey many times. On the return journey, if the target node corresponding to the end point of the outbound journey (i.e., the first key node in the second key node set after sorting) is point A or point B, the above-mentioned technical means of the present application can help the robot reduce repeated paths on the return journey and save return time.

[0129] In one embodiment of the present application, the second key node set may also be obtained by the following method:

[0130] S251, obtaining a key node with the largest key node number among all key nodes that meet the ninth condition in the first key node set;

[0131] S252, taking the key node obtained in step S251 as the current key node; deleting all key nodes that meet the ninth condition from the first key node set, and taking the key node set obtained thereby as the current seventh key node set; executing step S253;

[0132] S253, obtaining the key node with the smallest key node number among all key nodes that meet the tenth condition in the current seventh key node set; executing step S254;

[0133] S254, determining whether the key node obtained in step S253 is the outbound starting point. If the key node obtained in step S253 is the outbound starting point, the key node obtained in step S251 and all key nodes obtained by each execution of step S253 together constitute a second key node set; if the key node obtained in step S253 is not the outbound starting point, executing step S255;

[0134] S255, delete all key nodes that meet the tenth condition from the current seventh key node set, and use the key node set obtained in this way as the current seventh key node set for the next cycle; use the key nodes obtained through step S253 as the current key nodes for the next cycle; execute step S253.

[0135] The ninth condition refers to that the angle difference between the key node and the outbound end point is less than or equal to the fifth preset angle difference. In one embodiment of the present application, the fifth preset angle difference is 15°.

[0136] The tenth condition is that the angle difference between the key node and the current key node is less than or equal to the sixth preset angle difference. In one embodiment of the present application, the sixth preset angle difference is 15°.

[0137] In one embodiment of the present application, the second key node set may also be obtained by the following method:

[0138] S261, obtaining the key node with the largest key node number among all key nodes that meet the eleventh condition in the first key node set;

[0139] S262, taking the key node obtained in step S261 as the current key node; deleting all key nodes that meet the eleventh condition from the first key node set, and taking the key node set obtained thereby as the current eighth key node set; executing step S263;

[0140] S263, obtaining the key node with the smallest key node number among all key nodes that meet the twelfth condition in the current eighth key node set; executing step S264;

[0141] S264, determining whether the key node obtained in step S263 is the outbound starting point. If the key node obtained in step S263 is the outbound starting point, the key node obtained in step S261 and all key nodes obtained by each execution of step S263 together constitute a second key node set; if the key node obtained in step S263 is not the outbound starting point, executing step S265;

[0142] S265, delete all key nodes that meet the twelfth condition from the current eighth key node set, and use the key node set obtained in this way as the current eighth key node set for the next cycle; use the key nodes obtained through step S263 as the current key nodes for the next cycle; execute step S263.

[0143] The eleventh condition means that the distance between the key node and the outbound end point is less than or equal to the seventh preset distance, or the angle difference between the key node and the outbound end point is less than or equal to the seventh preset angle difference. In one embodiment of the present application, the seventh preset distance is 1 meter. In one embodiment of the present application, the seventh preset angle difference is 15°.

[0144] The twelfth condition refers to that the distance between the key node and the current key node is less than or equal to the eighth preset distance, or the angle difference between the key node and the current key node is less than or equal to the eighth preset angle difference. In one embodiment of the present application, the eighth preset distance is 1 meter. In one embodiment of the present application, the eighth preset angle difference is 15°.

[0145] In one embodiment of the present application, the robot moves from the outbound end point to the first key node after sorting, including the following steps:

[0146] Get the robot's corrected odometer position at the end of the outbound trip;

[0147] According to the corrected odometer posture of the robot at the outbound end point, the first key node after sorting is used as the target node corresponding to the outbound end point, and the robot is controlled to move to the first key node after sorting.

[0148] The first key node after sorting is used as the target node corresponding to the outbound end point. The robot is controlled to move to the first key node after sorting according to the odometer posture of the robot after correction at the outbound end point instead of the odometer posture of the robot before correction at the outbound end point. This can effectively reduce the impact of the odometer error on the return accuracy and improve the accuracy of the robot's automatic return.

[0149] According to the corrected odometer posture of the robot at the outbound end point, the first key node after sorting is used as the target node corresponding to the outbound end point. The odometer posture of the target node before correction can be used to control the robot to move to the first key node after sorting using the DWA algorithm (i.e., dynamic window algorithm).

[0150] In one embodiment of the present application, the robot moves from one key node to the next key node in sequence, including the following steps:

[0151] Get the robot's corrected odometer position at the current key node;

[0152] According to the corrected odometer posture of the robot at the current key node, the next key node of the current key node is used as the target node corresponding to the current key node, and the robot is controlled to move to the next key node of the current key node.

[0153] Taking the next key node of the current key node as the target node corresponding to the current key node, and controlling the robot to move to the next key node of the current key node according to the odometer posture of the robot after correction at the current key node instead of the odometer posture of the robot before correction at the current key node, can effectively reduce the influence of the odometer error on the return accuracy and improve the accuracy of the robot's automatic return.

[0154] According to the corrected odometer posture of the robot at the current key node, the next key node of the current key node is used as the target node corresponding to the current key node. The odometer posture before correction of the target node can be used to control the robot to move to the next key node of the current key node using the DWA algorithm.

[0155] In one embodiment of the present application, the following method is used to obtain the corrected odometer position of the robot at a certain point:

[0156] ;

[0157] in, is the corrected odometer pose of the robot at a certain point; is the transformation matrix from the robot's odometer posture before correction at that point to the odometer posture of the target node corresponding to that point before correction; for The transposed matrix of is the odometer position of the robot before correction at the target node corresponding to this point. A certain point here can be either the end point of the outbound journey or a key node.

[0158] In one embodiment of the present application, the transformation matrix of the robot's odometer posture before correction at a certain point to the odometer posture before correction of the target node corresponding to the point is obtained by the following method:

[0159] ;

[0160] in, It is the transformation matrix from the odometer posture of the robot at a certain point before correction to the odometer posture of the target node corresponding to the point before correction; is the transformation matrix from the target node laser radar coordinate system corresponding to the point to the target node robot coordinate system corresponding to the point; is the transformation matrix from the laser radar coordinate system of the point to the laser radar coordinate system of the target node corresponding to the point; is the transformation matrix from the robot coordinate system to the laser radar coordinate system. The point here can be either the end point of the outbound journey or a key node.

[0161] The transformation matrix from the robot coordinate system of a certain point to the laser radar coordinate system of the same point can be obtained by measurement, and the transformation matrix from the laser radar coordinate system of the target node corresponding to the point to the robot coordinate system of the target node corresponding to the point can be obtained by measurement. The transformation matrix from the laser radar coordinate system of the point to the laser radar coordinate system of the target node corresponding to the point can be obtained by using methods such as the ICP algorithm (i.e., the closest point iteration algorithm).

[0162] The robot coordinate system refers to the coordinate system with the robot's geometric center as its origin.

[0163] The laser radar coordinate system refers to the coordinate system with the center of the laser radar sensor of the laser radar installed on the robot as the origin.

[0164] The odometer position of the robot before correction at a certain point can be obtained by the encoder and IMU (inertial measurement unit) installed on the robot.

[0165] The present application obtains the robot's travel trajectory record from the outward starting point to the outward end point, generates a first key node set by using preset rules to generate multiple key nodes on the robot's travel trajectory, and on the return trip, sorts the key nodes in the second key node set from first to last according to the order of the key nodes in the second key node set, and the robot moves from the outward end point to the first key node after sorting. In this process, it is first necessary to obtain the robot's corrected odometer posture at the outward end point; according to the robot's corrected odometer posture at the outward end point, the first key node after sorting is used as the target node corresponding to the outward end point, and the DWA algorithm is used to control the robot to move to the first key node after sorting; then it moves from one key node to the next key node in sequence, and it is necessary to obtain the robot's corrected odometer posture at the current key node; then according to the robot's corrected odometer posture at the current key node, the next key node of the current key node is used as the target node corresponding to the current key node, and the DWA algorithm is used to control the robot to move to the next key node of the current key node, and the operation is repeated until it returns to the outward starting point.

[0166] like Figure 2 As shown, in a second aspect, an embodiment of the present application further provides an electronic device, which includes a memory 101 for storing one or more programs and a processor 102. When the one or more programs are executed by the processor 102, any method in the first aspect described above is implemented.

[0167] The memory 101, the processor 102 and the communication interface 103 are directly or indirectly electrically connected to each other to achieve data transmission or interaction. For example, these elements can be electrically connected to each other through one or more communication buses or signal lines. The memory 101 can be used to store software programs and modules, and the processor 102 executes various functional applications and data processing by executing the software programs and modules stored in the memory 101. The communication interface 103 can be used to communicate signaling or data with other node devices.

[0168] Among them, the memory 101 can be, but is not limited to, a random access memory (RAM), a read only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable read-only memory (EEPROM), etc.

[0169] The processor 102 may be an integrated circuit chip with signal processing capability. The processor 102 may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0170] In the third aspect, the embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by the processor 102, a method as described in any one of the first aspects above is implemented. If the function is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a disk or an optical disk.

[0171] The above are only preferred embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

[0172] It will be apparent to those skilled in the art that the present application is not limited to the details of the exemplary embodiments described above, and that the present application can be implemented in other specific forms without departing from the spirit or essential features of the present application. Therefore, the embodiments should be considered exemplary and non-limiting in all respects, and the scope of the present application is defined by the appended claims rather than the above description, and it is intended that all changes falling within the meaning and scope of the equivalent elements of the claims be included in the present application. Any reference numeral in a claim should not be considered as limiting the claim to which it relates.

Claims

1. A method for automatic robot return, characterized in that: The following steps are involved: S1, obtaining a travel trajectory record of the robot from the outbound starting point to the outbound end point, generating multiple key nodes of the robot on the travel trajectory based on preset rules, and forming a first key node set by all the generated key nodes; S2, when returning, sorting the key nodes in the second key node set from first to last according to the order of obtaining the key nodes in the second key node set, and the robot moves from the end point of the outward journey to the first key node after sorting, and then moves from one key node to the next key node in sequence until returning to the starting point of the outward journey; The second key node set is obtained by the following method: S211, obtaining the key node with the smallest key node number among all key nodes that meet the first condition in the first key node set; S212, taking the key node obtained in step S211 as the current key node; Delete all key nodes that meet the first condition from the first key node set, and use the key node set obtained as the current third key node set; execute step S213; S213, obtaining the key node with the smallest key node number among all key nodes that meet the second condition in the current third key node set; executing step S214; S214, determining whether the key node obtained in step S213 is the outbound starting point. If the key node obtained in step S213 is the outbound starting point, the key node obtained in step S211 and all key nodes obtained by each execution of step S213 together constitute a second key node set; If the key node obtained in step S213 is not the outbound starting point, execute step S215; S215, deleting all key nodes that meet the second condition from the current third key node set, and using the key node set obtained as the current third key node set for the next cycle; The key node obtained in step S213 is used as the current key node of the next cycle; and step S213 is executed.

2. The method for automatic robot return according to claim 1, characterized in that: The second key node set is obtained by the following method: S221, obtaining the key node with the smallest key node number among all key nodes that meet the third condition in the first key node set; S222, taking the key node obtained in step S221 as the current key node; Deleting all key nodes that meet the third condition from the first key node set, and using the key node set obtained thereby as the current fourth key node set; Execute step S223; S223, obtaining the key node with the smallest key node number among all key nodes that meet the fourth condition in the current fourth key node set; executing step S224; S224, determining whether the key node obtained in step S223 is the outbound starting point. If the key node obtained in step S223 is the outbound starting point, the key node obtained in step S221 and all key nodes obtained by each execution of step S223 together constitute a second key node set; If the key node obtained in step S223 is not the outbound starting point, execute step S225; S225, deleting all key nodes that meet the fourth condition from the current fourth key node set, and using the key node set obtained as the current fourth key node set for the next cycle; The key node obtained in step S223 is used as the current key node of the next cycle; and step S223 is executed.

3. The method for automatic robot return according to claim 1, characterized in that: The second key node set is obtained by the following method: S231, obtaining the key node with the smallest key node number among all key nodes that meet the fifth condition in the first key node set; S232, taking the key node obtained in step S231 as the current key node; Delete all key nodes that meet the fifth condition from the first key node set, and use the key node set obtained as the current fifth key node set; execute step S233; S233, obtaining the key node with the smallest key node number among all key nodes that meet the sixth condition in the current fifth key node set; executing step S234; S234, determining whether the key node obtained in step S233 is the outbound starting point. If the key node obtained in step S233 is the outbound starting point, the key node obtained in step S231 and all key nodes obtained by each execution of step S233 together constitute a second key node set; If the key node obtained in step S233 is not the outbound starting point, execute step S235; S235, delete all key nodes that meet the sixth condition from the current fifth key node set, and use the key node set obtained in this way as the current fifth key node set for the next cycle; use the key nodes obtained through step S233 as the current key nodes for the next cycle; execute step S233.

4. The method for automatic robot return according to claim 1, characterized in that: The second key node set is obtained by the following method: S241, obtaining the key node with the largest key node number among all key nodes that meet the seventh condition in the first key node set; S242, taking the key node obtained in step S241 as the current key node; Delete all key nodes that meet the seventh condition from the first key node set, and use the key node set obtained thereby as the current sixth key node set; execute step S243; S243, obtaining the key node with the smallest key node number among all key nodes that meet the eighth condition in the current sixth key node set; executing step S244; S244, determining whether the key node obtained in step S243 is the outbound starting point. If the key node obtained in step S243 is the outbound starting point, the key node obtained in step S241 and all key nodes obtained by each execution of step S243 together constitute a second key node set; if the key node obtained in step S243 is not the outbound starting point, executing step S245; S245, delete all key nodes that meet the eighth condition from the current sixth key node set, and use the key node set obtained in this way as the current sixth key node set for the next cycle; use the key nodes obtained through step S243 as the current key nodes for the next cycle; execute step S243.

5. The method for automatic robot return according to claim 1, characterized in that: The second key node set is obtained by the following method: S251, obtaining a key node with the largest key node number among all key nodes that meet the ninth condition in the first key node set; S252, taking the key node obtained in step S251 as the current key node; Deleting all key nodes that meet the ninth condition from the first key node set, and using the key node set obtained thereby as the current seventh key node set; Execute step S253; S253, obtaining the key node with the smallest key node number among all key nodes that meet the tenth condition in the current seventh key node set; executing step S254; S254, determining whether the key node obtained in step S253 is the outbound starting point. If the key node obtained in step S253 is the outbound starting point, the key node obtained in step S251 and all key nodes obtained by each execution of step S253 together constitute a second key node set; If the key node obtained in step S253 is not the outbound starting point, execute step S255; S255, delete all key nodes that meet the tenth condition from the current seventh key node set, and use the key node set obtained in this way as the current seventh key node set for the next cycle; use the key nodes obtained through step S253 as the current key nodes for the next cycle; execute step S253.

6. The method for automatic robot return according to claim 1, characterized in that: The second key node set is obtained by the following method: S261, obtaining the key node with the largest key node number among all key nodes that meet the eleventh condition in the first key node set; S262, taking the key node obtained in step S261 as the current key node; Delete all key nodes that meet the eleventh condition from the first key node set, and use the key node set obtained thereby as the current eighth key node set; execute step S263; S263, obtaining the key node with the smallest key node number among all key nodes that meet the twelfth condition in the current eighth key node set; executing step S264; S264, determining whether the key node obtained in step S263 is the outbound starting point. If the key node obtained in step S263 is the outbound starting point, the key node obtained in step S261 and all key nodes obtained by each execution of step S263 together constitute a second key node set; if the key node obtained in step S263 is not the outbound starting point, executing step S265; S265, delete all key nodes that meet the twelfth condition from the current eighth key node set, and use the key node set obtained in this way as the current eighth key node set for the next cycle; use the key nodes obtained through step S263 as the current key nodes for the next cycle; execute step S263.

7. The method for automatic robot return according to claim 1, characterized in that: The robot moves from the outbound end point to the first key node after sorting, including the following steps: Get the robot's corrected odometer position at the end of the outbound trip; According to the corrected odometer posture of the robot at the outbound end point, the first key node after sorting is used as the target node corresponding to the outbound end point, and the robot is controlled to move to the first key node after sorting.

8. The method for automatic robot return according to claim 1, characterized in that: The robot moves from one key node to the next key node in sequence, including the following steps: Get the robot's corrected odometer position at the current key node; According to the corrected odometer posture of the robot at the current key node, the next key node of the current key node is used as the target node corresponding to the current key node, and the robot is controlled to move to the next key node of the current key node.

9. The method for automatic robot return according to any one of claims 7 or 8, characterized in that: The method for obtaining the corrected odometer posture of the robot at the end point of the outbound journey or obtaining the corrected odometer posture of the robot at the current key node is as follows: ; in, The robot's corrected odometer position at the end of the outbound journey or the current key node; is the conversion matrix of the odometer posture of the robot before correction at the outbound end point to the odometer posture of the target node corresponding to the outbound end point before correction, or the conversion matrix of the odometer posture of the robot before correction at the current key node to the odometer posture of the target node corresponding to the current key node before correction; for The transposed matrix of It is the odometer pose of the robot before correction at the target node corresponding to the end point of the outbound journey or the target node corresponding to the current key node.

Citation Information

Patent Citations

  • Travelling track construction system and method

    CN109739227A

  • Ground robot control method and ground robot

    CN110637265A