A method and system for navigating curb edges of outdoor cleaning robots

By acquiring and processing curbstone data to plan navigation routes and combining real-time positioning corrections, the problem of insufficient positioning accuracy of sweepers was solved, thereby improving cleaning performance and safety.

CN117434947BActive Publication Date: 2026-11-17SHANDONG KAILIN ENVIRONMENTAL PROTECTION EQUIP CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202311397839.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-10-26
Publication Date
2026-11-17
Estimated Expiration
2043-10-26

AI Technical Summary

Technical Problem

When existing sweepers clean the curbs on both sides of the road, insufficient positioning accuracy leads to inaccurate route planning, which can easily result in poor cleaning results or collisions with the curbs.

Method used

By acquiring road map data, the system scans curbstone information in segments and processes it into boundary curve data. It then plans a navigation route based on the robot's operating radius and uses GPS+IMU combined positioning for real-time correction to ensure that the robot maintains a suitable distance from the curbstone. An alarm module and a return route planning function are also set up to prevent deviation.

Benefits of technology

A navigation method has been developed that ensures good cleaning results and minimizes collisions with curbs in cleaning robots of different sizes. This improves the accuracy and versatility of navigation routes and allows for timely detection and correction of deviations from the route.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117434947B_ABST
    Figure CN117434947B_ABST
Patent Text Reader

Abstract

This invention discloses a method and system for curb edge navigation of an outdoor cleaning robot, relating to the field of cleaning robot navigation technology. The method includes acquiring regional road map data, scanning to obtain curb information data, processing the curb information data into boundary curve data, matching the boundary curve data with road segments and writing it into the road map data, determining the road segments the cleaning robot will traverse based on the cleaning task, acquiring the boundary curve data corresponding to the traversed road segments, sorting the boundary curve data according to the order of the traversed road segments, using a route acquisition method, and processing the boundary curve data corresponding to the road segments using a preset navigation route method to obtain one or more ordered road segment navigation routes. The navigation route is planned based on the curb data and combined with the road map, ensuring that the navigation route and the curb are always at a suitable distance, thereby ensuring the cleaning effect when the cleaning vehicle operates along the navigation route.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of navigation technology for cleaning robots, specifically to a method and system for navigating the edge of curb stones for outdoor cleaning robots. Background Technology

[0002] Sweeping vehicles are widely used for cleaning operations in roads, factories, scenic spots and other places due to their advantages such as high operating efficiency, good cleaning effect, saving manpower and saving costs. At present, most sweeping vehicles on the market are manually driven, but in the future, with the increasing aging of the population, the sanitation human resources will become increasingly scarce. Therefore, the development of unmanned sweeping vehicles, namely outdoor cleaning robots, is imminent.

[0003] The curbs on both sides of the road usually accumulate a lot of garbage, making them a crucial working area for sweepers and also a challenging area for cleaning. Sweepers need to maintain a suitable distance from the curb: if the sweeper is too close, the sweeping discs will collide with the curb, potentially damaging them and rendering them inoperable; if the sweeper is too far away, the sweeping discs cannot reach the curb to clean it, significantly reducing cleaning effectiveness. Therefore, maintaining a suitable distance between the sweeper and the curb is key to ensuring cleaning effectiveness while avoiding collisions. In existing technologies, sweeper route planning mainly relies on positioning data. However, during actual cleaning, due to positioning accuracy issues, the planned route may be too far or too close to the curb. Furthermore, for the same task, sweepers of different specifications may plan the same route, leading to poor cleaning results and collisions with the curb. Summary of the Invention

[0004] (a) Technical problems to be solved To address the shortcomings of existing technologies, this invention provides a method and system for curb edge navigation for outdoor cleaning robots. Through steps S1-S6, the road is divided into multiple segments to create a map containing curb data. Based on the curb data and the road map, a navigation route is planned to ensure that the navigation route maintains a suitable distance from the curb. This solves the problem of inaccurate route planning when the positioning accuracy is low. When the cleaning robot works according to the navigation route, it can ensure good cleaning effect and is less likely to collide with the curb. At the same time, different navigation routes can be set according to different specifications of cleaning robots, improving versatility while further ensuring the accuracy of the navigation route.

[0005] (II) Technical Solution To achieve the above objectives, the present invention provides the following technical solution: a method for navigating curb edges with an outdoor cleaning robot, comprising the following steps: S1. Obtain regional road map data, divide the roads within the region into multiple road sections using intersections as boundaries, and then further divide these road sections into multiple road segments according to the direction of travel; S2. Scan the curb information of each road segment in the area, process the curb information data into boundary curve data through point cloud data processing technology, match the boundary curve data with the road segment and write it into the road map data to obtain map data containing curb data, and provide data support for subsequent navigation route planning. S3. Set the cleaning task for the cleaning robot, determine the route the cleaning robot will take based on the cleaning task, and obtain the boundary curve data corresponding to the route. S4. Sort the boundary curve data according to the order of the road segments, use the route acquisition method, and use the preset navigation route method to process the boundary curve data corresponding to the road segments to obtain one or more ordered road segment navigation routes. S5. When there is only one road segment navigation route, use that road segment navigation route as the actual navigation route. When there is more than one road segment navigation route, connect the adjacent road segment navigation lines to obtain a continuous line as the actual road segment navigation line, so that the cleaning robot can pass smoothly through intersections without curb stones for reference. S6. The control module controls the cleaning robot to perform cleaning operations according to the actual navigation route, ensuring good cleaning results.

[0006] Furthermore, the navigation route method steps in step S4 include: S41. Obtain the operating radius R of the cleaning robot; S42. Divide the boundary curve data evenly into multiple small segments, and connect the endpoints of each small segment with straight lines to obtain a set of reference segments; S43. Based on the working radius R of the sweeping robot, translate the midpoint of each line segment in the reference line segment set into the road and in a direction perpendicular to the line segment by a distance equal to the working radius R of the sweeping robot, to obtain multiple travel points. S44. Fit multiple travel points to obtain a fitted curve, and combine the fitted curve with road map data to obtain the road segment navigation route.

[0007] Furthermore, if there is more than one road segment navigation line in step S5, the navigation line data of two adjacent road segments are extracted in sequence, the travel relationship between the two road segments is determined by combining the map data, and the adjacent road segment navigation lines are connected according to the travel relationship.

[0008] Furthermore, the travel relationships include forward, left, and right; When the travel relationship is forward, connect the adjacent endpoints of the navigation lines of the two road segments with a straight line; When the travel relationship is to the left, the adjacent endpoints of the two road segment navigation lines are connected by an arc, the center of the arc is facing to the left, the path of the arc does not exceed the road range and the central angle corresponding to the arc is smaller than the turning angle of the cleaning robot. When the travel relationship is to the right, the adjacent endpoints of the two road segment navigation lines are connected by an arc. The center of the arc faces to the right, the path of the arc does not exceed the road range, and the central angle corresponding to the arc is smaller than the turning angle of the cleaning robot.

[0009] Furthermore, in step S6, as the cleaning robot travels along the actual navigation route, it obtains the actual distance SJ between the cleaning robot and the curbstone through a ranging module. The error distance WJ is calculated, where R is the operating radius of the robot vacuum cleaner. The error distance WJ is used to determine whether the navigation route needs to be corrected.

[0010] Furthermore, when the error distance When this occurs, it indicates that the cleaning robot has deviated from its actual navigation route, where YJ is the preset warning distance and At this point, the actual distance SJ between the cleaning robot and the curbstone is matched and corrected with the GPS+IMU combined positioning results to determine the real-time positioning of the cleaning vehicle. The real-time positioning is then matched with the actual navigation route to plan a return route to the actual navigation route. The return route is used to bring the cleaning robot back to the actual navigation route, avoiding the problem of poor cleaning effect caused by the cleaning robot deviating and the sweeping disc colliding with the curbstone.

[0011] Furthermore, the steps for planning the regression line are as follows: obtain the real-time positioning and length data of the cleaning robot; based on the real-time positioning, obtain the centerline of the cleaning robot as the positioning line; extend the positioning line forward by a distance equal to the length of a person on the cleaning robot to obtain an extension line; simultaneously obtain the actual navigation routes of two robot lengths as auxiliary lines; determine whether the extension line and the auxiliary line intersect; if they intersect, take the line segment from the starting point of the extension line to the first intersection point between the extension line and the auxiliary line as the regression line; if they do not intersect, connect the starting point of the extension line and the ending point of the auxiliary line with a straight line, and take the midpoint of the connecting line as a reference point; obtain the regression line based on the relative position of the extension line and the auxiliary line.

[0012] Furthermore, when the extension line is located to the left of the auxiliary line, an arc is drawn from the starting point of the extension line in a clockwise direction towards the reference point to obtain the first arc, and an arc is drawn from the reference point in a counterclockwise direction towards the end point of the auxiliary line to obtain the second arc, wherein the center angles of the first arc and the second arc are the same. When the extension line is to the right of the auxiliary line, draw an arc from the starting point of the extension line counterclockwise toward the reference point to obtain the first arc, and draw an arc from the reference point clockwise toward the end point of the auxiliary line to obtain the second arc, wherein the center angles of the first arc and the second arc are the same. The curve obtained by combining the first and second arcs is used as the regression line.

[0013] An outdoor cleaning robot curb edge navigation system includes: The storage module is used to store road map data and data related to the cleaning robot; The ranging module is equipped with sensors to measure the positional relationship between the cleaning robot and objects around the road. The positioning module, which combines the BDS Beidou navigation system unit and the IMU inertial sensing unit, is used to obtain the positioning information of the cleaning robot. It can also be combined with the ranging module to obtain more accurate positioning information. The alarm module determines whether the cleaning robot has deviated from the actual navigation route based on the distance data measured by the ranging module. If it deviates from the actual navigation route, it sends an alarm message to the planning module. The planning module is used to determine the cleaning section, execute the route acquisition method, and plan the actual navigation route. After receiving the alarm information from the alarm module, it plans the return route. The control module controls the cleaning robot to travel along the actual navigation route or to return to the actual navigation route via a return path.

[0014] (III) Beneficial Effects This invention provides a method and system for navigating curb edges with an outdoor cleaning robot. It offers the following advantages: 1. The work area is divided into multiple road segments. According to the segment division, the LiDAR is used to scan the curb stones along the road segment to collect data from multiple laser points. The laser point cloud data is extracted from the data and processed into boundary curve data. The boundary curve data is matched with the road segment and written into the road map data to supplement the road map data with curb stone data. The resulting map data includes the curb stones. Based on the curb stone data, it can effectively ensure that the navigation route and the curb stones are always kept at an appropriate distance. This solves the problem of insufficient route planning when the positioning accuracy is low. When the cleaning robot works according to the navigation route, it can ensure good cleaning effect and is less likely to collide with the curb stones.

[0015] 2. By setting an alarm module, the ranging module is controlled to measure distances at regular intervals. Based on the ranging results, it is determined whether the cleaning robot has deviated from the actual navigation route. If it has deviated from the actual navigation route, the planning module can quickly plan a return route. The control module controls the cleaning robot to return to the actual navigation route along the return route, so as to detect and solve the problem of the cleaning robot's route deviation in a timely manner and further ensure the working effect of the cleaning robot. Attached Figure Description

[0016] Figure 1 This is a schematic diagram illustrating the steps of the curb edge navigation method for outdoor cleaning robots according to the present invention; Figure 2 This is a schematic diagram of the navigation route method steps of the outdoor cleaning robot curb edge navigation method of the present invention; Figure 3 This is a schematic diagram illustrating the steps of planning a regression route in the curb edge navigation method for outdoor cleaning robots according to the present invention. Figure 4 This is a schematic diagram of the curb edge navigation system of the outdoor cleaning robot of the present invention. Detailed Implementation

[0017] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0018] Example 1 Please refer to Figure 1 , Figure 2 and Figure 4 This invention provides a method for navigating curb edges with an outdoor cleaning robot, comprising the following steps: S1. Obtain regional road map data, divide the roads in the region into multiple sections with intersections as the boundary, and then divide the multiple sections into multiple segments according to the direction of travel; based on existing conventional map data, divide the roads in the region into multiple sections, and then divide the multiple sections along the center line of the road according to the direction of vehicle travel to form multiple segments.

[0019] S2. Scan the curbstone information of each road segment within the scanning area. Using point cloud data processing technology, process the curbstone information data into boundary curve data. Then, match the boundary curve data with the road segment and write it into the map data. According to the road segment division, use LiDAR to scan the curbstone along the road segment edge, collect data from multiple laser points, extract the laser point cloud data, process the data into boundary curve data, match the boundary curve data with the road segment, and write it into the road map data to complete the curbstone data for the road map data.

[0020] S3. Set the cleaning task for the cleaning robot, determine the route the cleaning robot will take based on the cleaning task, and obtain the boundary curve data corresponding to the route. S4. Sort the boundary curve data according to the order of the road segments, use the route acquisition method, and use the preset navigation route method to process the boundary curve data corresponding to the road segments to obtain one or more ordered road segment navigation routes; the navigation route method steps in step S4 include: S41. Read relevant data about the cleaning robot from the storage module and obtain the working radius R of the cleaning robot; S42. Divide the boundary curve data evenly into multiple small segments, and connect the endpoints of each small segment with straight lines to obtain a set of reference segments. Dividing the curve into multiple small segments can effectively preserve the morphological features such as protruding curb stones and inward curves. In this embodiment, the boundary curve can be divided into multiple small segments with a length of ten centimeters. The curve segments with a length of less than ten centimeters can be ignored. S43. Based on the working radius R of the sweeping robot, translate the midpoint of each line segment in the reference line segment set into the road and in a direction perpendicular to the line segment by a distance equal to the working radius R of the sweeping robot, to obtain multiple travel points. S44. Fit multiple travel points to obtain a fitted curve, and combine the fitted curve with road map data to obtain the road segment navigation route. This method of obtaining the road segment navigation line, based on curbstone data, effectively ensures that the navigation route maintains a suitable distance from the curbstone, solving the problem of inaccurate route planning when positioning accuracy is low. This allows the cleaning robot to ensure good cleaning results and reduce the risk of collisions with curbstones when working according to the navigation route. Furthermore, different navigation routes can be set for different sizes of cleaning robots, improving the method's practicality.

[0021] S5. When there is only one road segment navigation route, use that road segment navigation route as the actual navigation route. When there is more than one road segment navigation route, connect the adjacent road segment navigation lines to obtain a continuous route as the actual road segment navigation line. When there is more than one road segment navigation line in step S5, extract the navigation line data of two adjacent road segments in sequence, and combine the map data to determine the travel relationship between the two road segments. Adjacent road segment navigation lines are connected according to their travel relationship, which includes forward, left, and right. When the travel relationship is forward, the adjacent endpoints of two road segment navigation lines are connected by a straight line. When the travel relationship is left, the adjacent endpoints of two road segment navigation lines are connected by an arc, with the center of the arc facing left, the path of the arc not exceeding the road area, and the central angle corresponding to the arc being less than the turning angle of the cleaning robot. When the travel relationship is right, the adjacent endpoints of two road segment navigation lines are connected by an arc, with the center of the arc facing right, the path of the arc not exceeding the road area, and the central angle corresponding to the arc being less than the turning angle of the cleaning robot. The robot's turning angle in the above method can be read from the data storage module. By using the above method to connect multiple road segment navigation lines, the cleaning robot can be ensured to pass smoothly through intersections without curbstone references.

[0022] S6. The control module controls the cleaning robot to perform cleaning operations according to the actual navigation route.

[0023] Example 2 Reference Figure 3 and Figure 4 Based on the above embodiment one, during the process of the cleaning robot traveling along the actual navigation route, it may deviate from the actual navigation route due to road conditions and other reasons. The actual distance SJ between the cleaning robot and the curb is obtained through the ranging module. The error distance WJ is calculated, where R is the operating radius of the robot vacuum cleaner. The error distance WJ is used to determine whether the navigation route needs to be corrected. When the error distance When this happens, it indicates that the cleaning robot has deviated from its actual navigation route and needs to be corrected. YJ represents the preset warning distance. At this point, the actual distance SJ between the cleaning robot and the curbstone is matched and corrected with the GPS+IMU combined positioning results to determine the real-time positioning of the cleaning vehicle. The real-time positioning is then matched with the actual navigation route to plan a return route to the actual navigation route. The return route is used to guide the cleaning robot back to the actual navigation route. The steps for planning the return route are as follows: obtain the real-time positioning and length data of the cleaning robot; based on the real-time positioning, obtain the centerline of the cleaning robot as the positioning line; extend the positioning line forward by a distance equal to the length of the cleaning robot to obtain an extension line; simultaneously obtain the actual navigation route of two robot lengths as an auxiliary line; determine whether the extension line and the auxiliary line intersect; if they intersect, take the line segment from the starting point of the extension line to the first intersection point between the extension line and the auxiliary line as the return route; if they do not intersect, connect the starting point of the extension line and the ending point of the auxiliary line with a straight line, and take the midpoint of the connecting line as a reference point; obtain the return route based on the relative position of the extension line and the auxiliary line. In this example, the sensor used by the cleaning robot to measure the actual distance to the curb can be a lidar. The lidar can be set to measure the distance every ten seconds, that is, to check whether it deviates from the actual navigation route every ten seconds. This method can detect the cleaning robot's route deviation in time, plan a return route in time, and guide the cleaning robot back to the actual navigation route, thereby further ensuring the working effect of the cleaning robot.

[0024] Example 3 Please see Figure 4 This invention provides a high-precision positioning system for automatic parking, comprising: The ranging module is equipped with sensors to measure the positional relationship between the cleaning robot and objects around the road. The alarm module controls the ranging module to periodically measure the distance between the robot and the curb. Based on the measured distance data, it determines whether the cleaning robot has deviated from the actual navigation route. If it deviates from the actual navigation route, it sends an alarm message to the planning module. The positioning module, which combines the BDS Beidou navigation system unit and the IMU inertial sensing unit, is used to obtain the positioning information of the cleaning robot. It can be combined with the data measured by the ranging module to obtain a more accurate positioning. The planning module is used to set cleaning tasks, determine cleaning routes based on cleaning tasks, execute route acquisition methods, and plan the actual navigation route. After receiving alarm information from the alarm module, it plans the return route. The control module controls the cleaning robot to travel along the actual navigation route. After the judgment module sends an alarm message and the planning module completes the return route, it controls the cleaning robot to return to the actual navigation route along the return route.

[0025] The above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. A semiconductor medium can be a solid-state drive.

[0026] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0027] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0028] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of units is only a logical functional division of a waterway underwater topography change analysis system and method. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces, indirect coupling or communication connection between devices or units, and may be electrical, mechanical, or other forms.

[0029] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0030] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0031] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0032] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

[0033] In conclusion, the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for navigating curb edges of an outdoor cleaning robot, characterized in that: Includes the following steps: S1. Obtain regional road map data, divide the roads within the region into multiple road sections using intersections as boundaries, and then further divide these road sections into multiple road segments according to the direction of travel; S2. Scan the curb information of each road segment in the area, process the curb information data into boundary curve data through point cloud data processing technology, and write the boundary curve data into the road map data after matching it with the road segment. S3. Set the cleaning task for the cleaning robot, determine the route the cleaning robot will take based on the cleaning task, and obtain the boundary curve data corresponding to the route. S4. Sort the boundary curve data according to the order of the road segments, use the route acquisition method, and use the preset navigation route method to process the boundary curve data corresponding to the road segments to obtain one or more ordered road segment navigation routes. S5. When there is only one road segment navigation route, use that road segment navigation route as the actual navigation route. When there is more than one road segment navigation route, connect the adjacent road segment navigation lines to obtain a continuous route as the actual road segment navigation line. S6. Control the cleaning robot to perform cleaning operations according to the actual navigation route through the control module; The navigation route method steps in step S4 include: S41. Obtain the operating radius R of the cleaning robot; S42. Divide the boundary curve data evenly into multiple small segments, and connect the endpoints of each segment with straight lines to obtain a set of reference segments; S43. Based on the working radius R of the sweeping robot, translate the midpoint of each line segment in the reference line segment set into the road and in a direction perpendicular to the line segment by a distance equal to the working radius R of the sweeping robot, to obtain multiple travel points. S44. Fit multiple travel points to obtain a fitted curve, and combine the fitted curve with road map data to obtain the road segment navigation route.

2. The method for navigating curb edges of an outdoor cleaning robot according to claim 1, characterized in that: When there is more than one road segment navigation line in step S5, the navigation line data of two adjacent road segments are extracted in sequence, and the travel relationship between the two road segments is determined by combining the map data. The adjacent road segment navigation lines are then connected according to the travel relationship.

3. The method for navigating curb edges of an outdoor cleaning robot according to claim 2, characterized in that: The movement relationships include forward, left, and right; When the travel relationship is forward, connect the adjacent endpoints of the navigation lines of the two road segments with a straight line; When the travel relationship is to the left, the adjacent endpoints of the two road segment navigation lines are connected by an arc, the center of the arc is facing to the left, the path of the arc does not exceed the road range and the central angle corresponding to the arc is smaller than the turning angle of the cleaning robot. When the travel relationship is to the right, the adjacent endpoints of the two road segment navigation lines are connected by an arc. The center of the arc faces to the right, the path of the arc does not exceed the road range, and the central angle corresponding to the arc is smaller than the turning angle of the cleaning robot.

4. The method for navigating curb edges of an outdoor cleaning robot according to claim 3, characterized in that: In step S6, as the cleaning robot travels along the actual navigation route, the distance SJ between the cleaning robot and the curb is obtained through the ranging module. The error distance WJ is calculated, where R is the operating radius of the robot vacuum cleaner. The error distance WJ is used to determine whether the navigation route needs to be corrected.

5. The method for navigating curb edges of an outdoor cleaning robot according to claim 4, characterized in that: When the error distance When this occurs, it indicates that the cleaning robot has deviated from its actual navigation route, where YJ is the preset warning distance and At this point, the actual distance SJ between the cleaning robot and the curbstone is matched and corrected with the GPS+IMU combined positioning results to determine the real-time positioning of the cleaning vehicle. The real-time positioning is then matched with the actual navigation route to plan a return route to the actual navigation route. The return route is used to allow the cleaning robot to return to the actual navigation route.

6. The method for navigating curb edges of an outdoor cleaning robot according to claim 5, characterized in that: The steps for planning the regression line are as follows: First, obtain the real-time positioning and length data of the cleaning robot. Based on the real-time positioning, obtain the centerline of the cleaning robot as the positioning line. Extend the positioning line forward by a distance equal to the length of a person on the cleaning robot to obtain an extension line. Simultaneously, obtain the actual navigation routes of the two robot lengths as auxiliary lines. Determine whether the extension line intersects the auxiliary line. If the extension line intersects the auxiliary line, take the line segment from the starting point of the extension line to the first intersection point between the extension line and the auxiliary line as the regression line. If the extension line does not intersect the auxiliary line, connect the starting point of the extension line and the ending point of the auxiliary line with a straight line, and take the midpoint of the connecting line as a reference point. Obtain the regression line based on the relative position of the extension line and the auxiliary line.

7. The method for navigating curb edges of an outdoor cleaning robot according to claim 6, characterized in that: When the extension line is located to the left of the auxiliary line, draw an arc from the starting point of the extension line in a clockwise direction towards the reference point to obtain the first arc, and draw an arc from the reference point in a counterclockwise direction towards the end point of the auxiliary line to obtain the second arc, wherein the center angles of the first arc and the second arc are the same. When the extension line is to the right of the auxiliary line, draw an arc from the starting point of the extension line counterclockwise toward the reference point to obtain the first arc, and draw an arc from the reference point clockwise toward the end point of the auxiliary line to obtain the second arc, wherein the center angles of the first arc and the second arc are the same. The curve obtained by combining the first and second arcs is used as the regression line.

8. An outdoor cleaning robot curb edge navigation system, applied to the outdoor cleaning robot curb edge navigation method according to any one of claims 1-7, characterized in that: include: The storage module is used to store road map data and data related to the cleaning robot; The ranging module is equipped with sensors to measure the positional relationship between the cleaning robot and objects around the road. The positioning module, which includes a BDS Beidou navigation system unit and an IMU inertial sensing unit, is used to acquire the positioning information of the cleaning robot. The alarm module determines whether the cleaning robot has deviated from the actual navigation route based on the distance data measured by the ranging module. If it deviates from the actual navigation route, it sends an alarm message to the planning module. The planning module is used to set cleaning tasks, determine cleaning routes based on cleaning tasks, execute route acquisition methods, and plan the actual navigation route. After receiving alarm information from the alarm module, it plans the return route. The control module controls the cleaning robot to travel along the actual navigation route or to return to the actual navigation route via a return path.

Citation Information

Patent Citations

  • Constructing method and navigation method of global boundary map

    CN108507578A

  • Method, device and equipment for cleaning and obstacle avoidance of sweeping robot in area and medium

    CN116149319A