Robot traversing convex corner method and cleaning robot

By using lidar to detect protruding corners and calculate straight-line walking time or adjust the cleaning path, the problem of the robot hitting the wall at protruding corners is solved, and the cleaning process is made smoother.

CN118542606BActive Publication Date: 2024-11-01SHENZHEN MAXVISION TECH
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202411008317.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-07-26
Publication Date
2024-11-01
Estimated Expiration
2044-07-26

AI Technical Summary

Technical Problem

When the robot encounters a protruding corner during edge cleaning, it is prone to hitting the wall, which can cause the cleaning process to be disrupted.

Method used

By using a lidar sensor installed on the robot's body to detect protruding corners, the robot calculates the straight-line walking time over protruding corners or adjusts the edge-to-edge cleaning path to avoid direct collisions with walls.

Benefits of technology

This effectively prevents the robot from hitting walls at protruding corners, ensuring a smooth cleaning process.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118542606B_ABST
    Figure CN118542606B_ABST
Patent Text Reader

Abstract

The present application discloses a method for a robot to pass through a convex corner, which comprises: when the robot walks along a side-cleaning path, detecting the convex corner point in front of the robot based on a laser radar installed on the robot body; calculating the straight walking time of passing through the convex corner based on the convex corner point and the robot's walking linear speed, or adjusting the side-cleaning path based on the convex corner point and the robot size. The present application also provides a cleaning robot using the method for passing through a convex corner.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of robot automatic cleaning, and more specifically, to a robot traversing convex corners method and a cleaning robot. Background Art

[0002] The automatic cleaning of sweeping robots has brought great convenience to people's lives. The robot can clean the wall gaps according to the planned edge cleaning path. However, since edge cleaning requires walking close to the wall, when something suddenly appears in front of the robot, Figure 1 When the robot continues to move along the original edge cleaning path when there is a convex corner (positive corner) as shown, the robot body may easily collide with the convex corner due to the protrusion of the convex corner, thus damaging the body and causing the cleaning process to be unsmooth. Summary of the invention

[0003] In view of the prior art, the technical problem solved by the present application is to provide a robot convex corner passing method and a cleaning robot that can automatically detect the convex corners that will be encountered in the front of the edge cleaning and adjust the cleaning path in time.

[0004] In order to solve the above technical problems, in a first aspect, the present application provides a method for a robot to pass a convex corner, which comprises:

[0005] When the robot walks along the edge cleaning path, the laser radar installed on the robot body detects the convex corner points in front of the robot;

[0006] Calculate the straight-line travel time over the convex corner based on the convex corner point and the linear speed of the robot; or,

[0007] Adjust the cleaning path based on the salient corner points and robot size.

[0008] In combination with the first aspect, in a possible implementation, the laser radar is a single-line laser radar, and the laser radar installed on the robot body detects the convex corner point in front of the robot, including:

[0009] For the multiple detection scanning points fed back by the single-line laser radar at the current moment, when the detection distance corresponding to any detection scanning point increases and meets the preset change conditions, there is a convex corner in front of the robot;

[0010] The detection scanning point that meets the preset change conditions is the convex corner point Corner;

[0011] Among them, the change preset condition is: ScanRange i [current]>ScanRange i [before]*α; ScanRange iis the detection scanning point of a detection angle θ of the single-line laser radar, ScanRange i [current] is the detection angle θ of the single-line laser radar at the current moment, and the feedback detection distance is ScanRange i [before] is the detection distance fed back by the detection angle θ of the single-line laser radar at the previous moment, and α is the set multiple threshold.

[0012] In combination with the first aspect, in a possible implementation, the laser radar is a single-line laser radar, and detecting a convex corner point in front of the robot based on the single-line laser radar includes:

[0013] The left and right sides of the robot when walking are set according to the scanning angle range of the single-line laser radar detected in front of the robot's walking direction;

[0014] Based on the minimum distance detected by the single-line laser radar at the current moment, determine whether the wall to be cleaned is on the left or right side of the robot:

[0015] According to the starting and ending points of the edge cleaning path at the current moment and the size of the robot, determine whether there is a left turn or a right turn on the edge cleaning path;

[0016] Determine whether there is a convex corner in front of the robot: if the wall is on the left side of the robot and the path along the edge is a left turn, it is determined that there is a convex corner in front of the robot; or if the wall is on the right side of the robot and the path along the edge is a right turn, it is determined that there is a convex corner in front of the robot;

[0017] Calculate the convex corner point: The detection scanning point with the largest detection distance change in the current feedback information of the single-line laser radar is the convex corner point Corner.

[0018] In combination with the first aspect, in a possible implementation, the left and right sides of the robot when walking are set according to the scanning angle range of the single-line laser radar: the scanning angle range of the single-line laser radar [-105°, -75°] is selected to correspond to the left side of the robot and the scanning angle range of the single-line laser radar [75°, 105°] is selected to correspond to the right side of the robot;

[0019] Determine whether the wall to be cleaned is on the left or right side of the robot based on the minimum detection distance of the single-line laser radar at the current moment: when the minimum detection distance fed back by the single-line laser radar is obtained when the scanning angle range is [-105°, -75°], the wall is on the right side of the robot; when the minimum detection distance fed back by the single-line laser radar is obtained when the scanning angle range is [75°, 105°], the wall is on the left side of the robot.

[0020] In combination with the first aspect, in a possible implementation, based on the starting and ending points of the edge cleaning path at the current moment and the size of the robot, it is determined whether there is a left turn or a right turn on the edge cleaning path:

[0021] Calculate the fine-tuning starting point e corresponding to the starting point of the current edge cleaning path according to the position of the single-line laser radar installed on the aircraft body adjust ;

[0022] when|ye end -ye adjust |>W robot / 2andye end -ye adjust >0, then turn left;

[0023] when|ye end -ye adjust |>W robot / 2andye end -ye adjust <0, then turn right;

[0024] Among them, ye end is the vertical coordinate of the end point of the edge path in the cost map, ye adjust is the y coordinate of the starting point of the edge path fine-tuning, W robot is the robot width.

[0025] In combination with the first aspect, in a possible implementation, the straight walking time through the convex corner is calculated based on the convex corner point and the linear speed of the robot walking, which is:

[0026] ;

[0027] in, is the walking time over the convex corner, k is the adjustment parameter, is the linear velocity of the robot, It is the horizontal axis coordinate of the convex corner point Corner in the cost map.

[0028] In combination with the first aspect, in a possible implementation, adjusting the edge cleaning path based on the convex corner points and the robot size includes:

[0029] Traverse the current edge cleaning path and find the path point e closest to the convex corner point Corner Cor And record the path point e Cor Index in the current edge sweeping path ecor ;

[0030] Calculate the horizontal increment of the path adjustment : ;

[0031] To perform path adjustment operations:

[0032] From waypoint e Cor The next path point to the end point of the current edge cleaning path e end To perform lateral adjustments parallel to the robot's walking direction: ;

[0033] Calculate the fine-tuning starting point corresponding to the starting point of the current edge cleaning path according to the position of the single-line laser radar installed on the aircraft body;

[0034] From the fine-tuning starting point to the end point of the front edge cleaning path e end , perform a vertical adjustment operation perpendicular to the horizontal direction: ;

[0035] in, The total number of path points of the current edge-sweeping path; is the threshold value set; is the length of the robot; n and m are both the indexes of the path points. Represented as path point e Cor The next path point to the end point e end Any path point between Indicates waypoints The horizontal axis coordinate in the cost map, the waypoint For waypoints The previous waypoint of Indicates the path point fine-tuning starting point to the end point of the current edge cleaning path e end Any path point between Represented as waypoints The vertical coordinate in the costmap.

[0036] In combination with the first aspect, in a possible implementation, the fine-tuning starting point corresponding to the starting point of the current edge cleaning path is calculated according to the position of the single-line laser radar installed on the aircraft body:

[0037] Each path point in the edge-sweeping path is traversed in order;

[0038] During each traversal, it is determined whether the path point currently traversed meets the preset distance condition. If the preset distance condition is met, the path point currently traversed is used as the fine-tuning starting point;

[0039] Among them, the preset distance condition is: , ;

[0040] in, is the coordinate value of the robot center in the cost map, is the coordinate value of the traversed i-th path point in the cost map, It is the physical distance between the single-line laser radar installed on the robot and the center of the two driving wheels of the robot walking on the ground.

[0041] In a second aspect, the present application provides a cleaning robot, comprising:

[0042] Body;

[0043] Two driving wheels arranged side by side at the bottom of the machine body and used to drive the machine body to move;

[0044] A laser radar disposed on the body, wherein the laser radar is located at the front side of the body when the body moves;

[0045] The processor is used to call and execute the executable program code so that the cleaning robot executes the steps of the robot passing the convex corner method.

[0046] The beneficial effects of the robot traversing convex corner method and the cleaning robot provided in the present application are: during the robot's edge cleaning process, the convex corner point in front of the robot is detected based on the laser radar on the robot body, and the time to go straight through the convex corner from the time the convex corner point is found is calculated based on the position of the convex corner point and the walking speed of the robot, or after the convex corner point is detected, the original edge cleaning path is adjusted based on the convex corner point and the size of the robot, so that the robot no longer walks according to the original edge cleaning path, so as to avoid the robot hitting the wall at the convex corner. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0048] Figure 1 This is a schematic diagram of the positive angle of a wall.

[0049] Figure 2 This is a structural diagram of the cleaning robot according to an embodiment of the present application.

[0050] Figure 3 This is a flow chart of the steps of the method for robot negotiating a convex corner according to an embodiment of the present application.

[0051] Figure 4 This is a schematic diagram of a scene in which a single-line laser radar detects a convex corner according to an embodiment of the present application.

[0052] Figure 5This is a flow chart of one step of detecting salient corner points in front of a robot based on a single-line laser radar according to an embodiment of the present application.

[0053] Figure 6 A schematic diagram of a single-line laser radar scanning range according to an embodiment of the present application.

[0054] Figure 7 This is a schematic diagram of the width and length of the robot according to an embodiment of the present application.

[0055] Figure 8 A schematic diagram of the width and length of the robot in an embodiment of the present application is a flow chart of a step for adjusting the edge cleaning path based on the convex corner points and the size of the robot. DETAILED DESCRIPTION

[0056] In order to make the technical problems, technical solutions and beneficial effects to be solved by the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0057] It should be noted that when an element is referred to as being "fixed to" or "disposed on" another element, it can be directly on the other element or indirectly on the other element. When an element is referred to as being "connected to" another element, it can be directly connected to the other element or indirectly connected to the other element.

[0058] It should be understood that the terms "length", "width", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside", etc., indicating the orientation or position relationship, are based on the orientation or position relationship shown in the drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present application.

[0059] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of this application, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0060] The robot surmounting corner method and the cleaning robot of the present application will now be described in detail with reference to the accompanying drawings.

[0061] Please refer to Figure 2The cleaning robot 100 provided in the embodiment of the present application includes a body 10, two driving wheels 20 arranged side by side at the bottom of the body 10 and used to drive the movement of the body, a laser radar 30 arranged on the body, a cleaning brush 40 arranged at the bottom of the body for cleaning the ground, and a processor. Among them, the laser radar 30 can be a single-line laser radar. During the walking process of the body 10, the laser radar is arranged at the front side of the walking direction. The laser radar 30 is used for ranging and realizing SLAM composition; the two side-by-side driving wheels 20 are located on the rear side of the laser radar 30 and the laser radar 30 is located on the perpendicular bisector of the straight line formed by the center line connecting the two driving wheels 20. The processor is communicatively connected to the laser radar 30, and the processor can receive the detection information of the laser radar 30, call and execute the executable program code, so that the cleaning robot 100 executes the steps of the robot passing the convex corner method.

[0062] Please refer to Figure 3 The edge cleaning path planning method provided in the embodiment of the present application includes the following steps S100 and S200.

[0063] Step S100: When the robot is walking along the edge cleaning path, the laser radar installed on the robot body detects the convex corner points in front of the robot.

[0064] Before using the robot for cleaning, the robot can be controlled to walk around the area to be cleaned, and SLAM composition can be performed in combination with the laser radar detection information to obtain an environmental map. The process of using the radar for SLAM composition uses the existing SLAM algorithm, and then any existing path planning algorithm is used to plan a cleaning path close to the edge. The path planning algorithm uses the A* (AStar) algorithm. When the robot is cleaning close to the edge, the cleaning path close to the edge can be obtained, and the robot walks along the cleaning path close to the edge to achieve cleaning close to the edge.

[0065] Regarding step S100, in the first application embodiment, the laser radar is a single-line laser radar, and the laser radar installed on the robot body detects the convex corner point in front of the robot, including:

[0066] For the multiple detection scanning points fed back by the single-line laser radar at the current moment, when the detection distance corresponding to any detection scanning point increases and meets the preset change conditions, there is a convex corner in front of the robot;

[0067] The detection scanning point that meets the preset change conditions is the convex corner point Corner.

[0068] Among them, the change preset condition is: ScanRange i [current]>ScanRange i [before]*α; ScanRange iis the detection scanning point of a detection angle θ of the single-line laser radar, ScanRange i [current] is the detection angle θ of the single-line laser radar at the current moment, and the feedback detection distance is ScanRange i [before] is the detection distance fed back by the detection angle θ of the single-line laser radar at the previous moment, and α is the set multiple threshold, where α≥2.

[0069] like Figure 4 As shown in the figure, during the robot's edge cleaning process, the single-line laser radar rotates in front of the robot's walking direction to emit laser scanning. When a convex corner (yang corner) appears in front of the wall, when the single-line laser radar encounters the convex corner, the detection distance fed back by a certain detection angle will change suddenly at the moment of encountering the convex corner, and will be larger than the moment before encountering the convex corner. In this way, according to the distance information fed back by the single-line laser radar, it can be known whether a convex corner appears in front and when a convex corner is detected, it can be known which detection scanning point of the single-line laser radar corresponds to the convex corner point.

[0070] For step S100, in the second embodiment of the application, as Figure 5 As shown, when the robot is walking, the single-line laser radar is located in front of the robot body, and the convex corner points in front of the robot are detected based on the single-line laser radar, including steps S110 to S150.

[0071] Step S110: setting the left and right sides of the robot when walking according to the scanning angle range of the single-line laser radar.

[0072] The origin of the robot coordinate system is the center of the two driving wheels, the positive direction of the horizontal axis of the robot coordinate system is the walking direction of the robot, and the vertical axis of the robot coordinate system is perpendicular to the horizontal axis and the positive direction of the vertical axis points to the adjacent wall. Figure 6 As shown, the single-line laser radar rotates and emits laser scanning in front of the robot's walking direction, where the laser radar 0° is facing straight ahead and consistent with the positive direction of the horizontal axis of the robot's coordinate system. The scanning angle range of the single-line laser radar [-105°, -75°] is selected to correspond to the left side of the robot and the scanning angle range of the single-line laser radar [75°, 105°] is selected to correspond to the right side of the robot.

[0073] Step S120: Determine whether the wall to be cleaned is on the left or right side of the robot based on the minimum distance detected by the single-line laser radar at the current moment.

[0074] Understandably, when cleaning along the edge, the minimum distance detected by the single-line laser radar is on the side of the wall. Then, when the minimum detection distance fed back by the single-line laser radar is obtained when the scanning angle range is [-105°, -75°], the wall is on the right side of the robot; when the minimum detection distance fed back by the single-line laser radar is obtained when the scanning angle range is [75°, 105°], the wall is on the left side of the robot.

[0075] Step S130: According to the starting and ending points of the edge cleaning path at the current moment and the size of the robot, determine whether there is a left turn or a right turn on the edge cleaning path, specifically:

[0076] Calculate the fine-tuning starting point e corresponding to the starting point of the current edge cleaning path according to the position of the single-line laser radar installed on the aircraft body adjust ;

[0077] when|ye end -ye adjust |>W robot / 2andye end -ye adjust >0, then turn left;

[0078] when|ye end -ye adjust |>W robot / 2andye end -ye adjust <0, then turn right;

[0079] Among them, ye end is the vertical coordinate of the end point of the edge path in the cost map, ye adjust is the y coordinate of the starting point of the edge path fine-tuning, W robot is the robot width.

[0080] like Figure 7 As shown, the projection of the robot body involved in the embodiment of the present application onto the ground is a rectangle or a positive direction. The length of the robot refers to the length of the side of the robot body along the robot's walking direction, and the width of the robot refers to the length of the side of the robot body perpendicular to the robot's walking direction.

[0081] Furthermore, the fine-tuning starting point corresponding to the starting point of the current edge cleaning path is calculated according to the position of the single-line laser radar installed on the aircraft body, specifically:

[0082] Each path point in the edge-sweeping path is traversed in order;

[0083] During each traversal, it is determined whether the path point currently traversed meets the preset distance condition. If the preset distance condition is met, the path point currently traversed is used as the fine-tuning starting point;

[0084] Among them, the preset distance condition is: , .

[0085] in, is the coordinate value of the robot center in the cost map, is the coordinate value of the traversed i-th path point in the cost map, It is the physical distance between the single-line laser radar installed on the robot and the center of the two driving wheels of the robot walking on the ground, that is, the physical distance between the center of the single-line laser radar and the center of the two driving wheels of the robot walking on the ground.

[0086] It is worth noting that the robot chassis is a differential chassis, that is, the robot's driving wheels are two wheels set side by side, the robot's movement center is at the center of the two driving wheels, and the single-line laser radar that detects the distance of the robot during movement is located in front of the two driving wheels set side by side. That is, the laser radar that acts as the eye detector during the robot's movement is forward relative to the starting point of the edge cleaning path. Therefore, it is necessary to find the fine-tuning starting point corresponding to the laser radar according to the installation position of the laser radar.

[0087] Step S140: Determine whether there is a convex corner in front. If there is no convex corner in front, continue to feedback and execute steps S120 and S130. If there is a convex corner in front, execute step S150.

[0088] The method of judging whether a convex corner appears in front of the robot is as follows: if the wall is located on the left side of the robot and the path along the edge is a left turn, then it is judged that a convex corner appears in front of the robot; or, if the wall is located on the right side of the robot and the path along the edge is a right turn, then it is judged that a convex corner appears in front of the robot;

[0089] Step S150: Calculate the convex corner point: take the detection scanning point with the largest detection distance change in the feedback information of the single-line laser radar at the current moment as the convex corner point Corner.

[0090] Understandably, the planned edge cleaning path extends along the wall, so at the convex corner (yang corner), the edge cleaning path turns right if the robot is cleaning the right side of the wall, and left if the robot is cleaning the left side of the wall. If the robot also walks along the original edge cleaning path at the corner of the convex corner, the robot body is likely to hit the wall, especially compared to the round robot, the square robot has one side facing the wall during the edge cleaning process, and the square robot will be more likely to hit the wall at the corner of the convex corner. Therefore, when a convex corner is detected in front of step S100, it is necessary to fine-tune the path to prevent hitting the wall.

[0091] Step S200: Calculate the straight-line walking time through the convex corner based on the convex corner point and the linear speed of the robot's walking; or adjust the edge cleaning path based on the convex corner point and the size of the robot.

[0092] For step S200, in one embodiment of the application, the straight walking time through the convex corner is calculated based on the convex corner point and the linear speed of the robot's walking, which is:

[0093] ;

[0094] in, is the walking time over the convex corner, k is the adjustment parameter, is the linear velocity of the robot, It is the horizontal axis coordinate of the convex corner point Corner in the cost map.

[0095] In the above embodiment, after calculating the straight walking time Time, the robot will go straight for the Time time and will no longer walk along the original turning edge cleaning path. Among them, k is an adjustable parameter. For robots with different external dimensions, k can take different values ​​according to the specific situation, that is, k can be adjusted according to the size of the robot. In a specific embodiment, when the width of the robot is 60cm and the length is 80cm, k can take the value of 2. After the convex corner point is detected, the straight walking time Time can make the tail of the robot pass the convex corner point. When going straight through the convex corner within the Time time, the angular velocity of the robot is set to 0. The straight walking means that when the convex corner point is detected, the robot goes straight in the direction of advance when the convex corner point is detected. Time, you don't have to follow the original cleaning path.

[0096] For step S200, in another embodiment of the application, Figure 8 As shown, the edge cleaning path is adjusted based on the convex corner points and the robot size, including the following steps S210 to S230.

[0097] Step S210: traverse the current edge cleaning path and find the path point e closest to the convex corner point Corner Cor And record the path point e Cor Index in the current edge sweeping path ecor .

[0098] Among them, traverse each path point of the current edge cleaning path, calculate the Euclidean distance between each path point and the convex corner point Corner, sort all the Euclidean distance values, and select the path point e corresponding to the minimum Euclidean distance value Cor , waypoint e Cor Index ecor Represents: waypoint e Cor It is the number of points in the edge cleaning path.

[0099] Step S220: Calculate the horizontal axis increment of the path adjustment : .

[0100] The horizontal axis increment It is used for the adjustment amount in the horizontal direction during subsequent path adjustment. The total number of path points of the current edge-sweeping path; is the threshold value set; is the length of the robot. During the path adjustment process, the horizontal axis direction is adjusted to be parallel to the horizontal axis direction of the robot coordinate system, and the vertical axis direction is adjusted to be parallel to the horizontal axis direction of the robot coordinate system.

[0101] Step S230: Execute path adjustment operation:

[0102] From waypoint e Cor The next path point to the end point of the current edge cleaning path e end To perform lateral adjustments parallel to the robot's walking direction: ;

[0103] Calculate the fine-tuning starting point corresponding to the starting point of the current edge cleaning path according to the position of the single-line laser radar installed on the aircraft body;

[0104] From the fine-tuning starting point to the end point of the front edge cleaning path e end , perform a vertical adjustment operation perpendicular to the horizontal direction: .

[0105] In the above steps, the calculation method of the fine-tuning starting point is the same as that in the above step S130, which will not be repeated here. Wherein, n and m are both indexes of the path points. Represented as path point e Cor The next path point to the end point e end Any path point between Indicates waypoints The horizontal coordinate of the cost map, the waypoint For waypoints The previous waypoint of Indicates the path point fine-tuning starting point to the end point of the current edge cleaning path e end Any path point between Represented as waypoints The vertical coordinate in the costmap.

[0106] It is worth noting that, in step S200, in the first embodiment of the application, after detecting the convex corner, the time for the robot to go straight through the convex corner is calculated to avoid the risk of colliding with the wall by directly following the original edge cleaning path. In the second embodiment of the application, after detecting the convex corner, the edge cleaning path is adjusted to avoid the risk of colliding with the wall by directly walking along the path that originally turned at the convex corner.

[0107] The above description is only a preferred embodiment of the present application and is not intended to limit the present application. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present application should be included in the protection scope of the present application.

Claims

1. A robot method for passing convex corners, It is characterized in that include: When the robot walks along the edge cleaning path, the laser radar installed on the robot body detects the convex corner points in front of the robot; Calculate the straight-line travel time over the convex corner based on the convex corner point and the linear speed of the robot; or, Adjust the cleaning path based on the convex corners and robot size; Adjust the cleaning path based on the salient corners and robot size, including: Traverse the current edge cleaning path and find the path point e closest to the convex corner point Corner Cor And record the path point e Cor Index in the current edge sweeping path ecor ; Calculate the horizontal increment of the path adjustment : ; To perform path adjustment operations: From waypoint e Cor The next path point to the end point of the current edge cleaning path e end To perform lateral adjustments parallel to the robot's walking direction: ; Calculate the fine-tuning starting point corresponding to the starting point of the current edge cleaning path according to the position of the single-line laser radar installed on the aircraft body; From the fine-tuning starting point to the end point of the front edge cleaning path e end , perform a vertical adjustment operation perpendicular to the horizontal direction: ; in, The total number of path points of the current edge-sweeping path; is the threshold value set; is the length of the robot; n and m are both the indexes of the path points. Represented as path point e Cor The next path point to the end point e end Any path point between Indicates waypoints The horizontal coordinate of the cost map, the waypoint For waypoints The previous waypoint of Indicates the path point fine-tuning starting point to the end point of the current edge cleaning path e end Any path point between Represented as waypoints The vertical coordinate in the costmap.

2. The robot method for passing a convex corner as claimed in claim 1, It is characterized in that The laser radar is a single-line laser radar, which detects the convex corner points in front of the robot based on the laser radar installed on the robot body, including: For the multiple detection scanning points fed back by the single-line laser radar at the current moment, when the detection distance corresponding to any detection scanning point increases and meets the preset change conditions, there is a convex corner in front of the robot; The detection scanning point that meets the preset change conditions is the convex corner point Corner; Among them, the change preset condition is: ScanRange i [current]>ScanRange i [before]*α; ScanRange i is the detection scanning point of a detection angle θ of the single-line laser radar, ScanRange i [current] is the detection angle θ of the single-line laser radar at the current moment, and the feedback detection distance is ScanRange i [before] is the detection distance fed back by the detection angle θ of the single-line laser radar at the previous moment, and α is the set multiple threshold.

3. The robot method for passing a convex corner as claimed in claim 1, It is characterized in that The laser radar is a single-line laser radar, and the convex corner point in front of the robot is detected based on the single-line laser radar, including: The left and right sides of the robot when walking are set according to the scanning angle range of the single-line laser radar detected in front of the robot's walking direction; Based on the minimum distance detected by the single-line laser radar at the current moment, determine whether the wall to be cleaned is on the left or right side of the robot: According to the starting and ending points of the edge cleaning path at the current moment and the size of the robot, determine whether there is a left turn or a right turn on the edge cleaning path; Determine whether there is a convex corner in front of the robot: if the wall is on the left side of the robot and the path along the edge is a left turn, it is determined that there is a convex corner in front of the robot; or if the wall is on the right side of the robot and the path along the edge is a right turn, it is determined that there is a convex corner in front of the robot; Calculate the convex corner point: The detection scanning point with the largest detection distance change in the current feedback information of the single-line laser radar is the convex corner point Corner.

4. The robot method for passing a convex corner as claimed in claim 3, It is characterized in that Set the left and right sides of the robot when walking according to the scanning angle range of the single-line laser radar: select the scanning angle range of the single-line laser radar [-105°, -75°] corresponding to the left side of the robot and select the scanning angle range of the single-line laser radar [75°, 105°] corresponding to the right side of the robot; Determine whether the wall to be cleaned is on the left or right side of the robot based on the minimum detection distance of the single-line laser radar at the current moment: when the minimum detection distance fed back by the single-line laser radar is obtained when the scanning angle range is [-105°, -75°], the wall is on the right side of the robot; when the minimum detection distance fed back by the single-line laser radar is obtained when the scanning angle range is [75°, 105°], the wall is on the left side of the robot.

5. The robot method for passing a convex corner as claimed in claim 3, It is characterized in that According to the starting and ending points of the edge cleaning path at the current moment and the size of the robot, it is determined whether there is a left turn or a right turn on the edge cleaning path: Calculate the fine-tuning starting point e corresponding to the starting point of the current edge cleaning path according to the position of the single-line laser radar installed on the aircraft body adjust ; when|ye end -ye adjust |>W robot / 2andye end -ye adjust >0, then turn left; when|ye end -ye adjust |>W robot / 2andye end -ye adjust <0, then turn right; Among them, ye end is the vertical coordinate of the end point of the edge path in the cost map, ye adjust is the y coordinate of the starting point of the edge path fine-tuning, W robot is the robot width.

6. The robot method for passing a convex corner as claimed in claim 1, It is characterized in that The straight walking time through the convex corner is calculated based on the convex corner point and the linear speed of the robot's walking, which is: ; in, is the walking time over the convex corner, k is the adjustment parameter, is the linear velocity of the robot, It is the horizontal axis coordinate of the corner point Corner in the cost map.

7. The robot traversing convex corner method as claimed in claim 1 or 5, It is characterized in that According to the position of the single-line laser radar installed on the aircraft, calculate the fine-tuning starting point corresponding to the starting point of the current edge cleaning path: Each path point in the edge cleaning path is traversed in order; During each traversal, it is determined whether the path point currently traversed meets the preset distance condition. If the preset distance condition is met, the path point currently traversed is used as the fine-tuning starting point; Among them, the preset distance condition is: , ; in, is the coordinate value of the robot center in the cost map, is the coordinate value of the traversed i-th path point in the cost map, It is the physical distance between the single-line laser radar installed on the robot and the center of the two driving wheels of the robot walking on the ground.

8. A cleaning robot, It is characterized in that include: Body; Two driving wheels arranged side by side at the bottom of the machine body and used to drive the machine body to move; A laser radar disposed on the body, wherein the laser radar is located at the front side of the body when the body moves; A processor is used to call and execute executable program code so that the cleaning robot performs the steps of the robot navigating convex corners method as described in any one of claims 1 to 7.

Citation Information

Patent Citations

  • Method for robot to straighten along wall and cleaning method

    CN111552290A

  • Self-propelled robot and control method thereof

    CN111949021A

  • Robot edge cleaning method and device

    CN112674645A

  • Strategy control method for robot walking in shape of Chinese character 'gong'

    CN113589806A

  • Operation robot control method and device, electronic equipment and storage medium

    CN114137969A