Method, device, cleaning robot and storage medium for determining cleaning range

By obtaining and splicing submaps in the cleaning robot, drawing external rectangular boxes and correcting edge contour segments, and determining the cleaning range, the problem that the cleaning robot cannot dynamically adjust the battery capacity and cleaning area, improving intelligence and user experience.

CN115429157BActive Publication Date: 2024-11-08SHENZHEN MOSHANG TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211043223.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-08-29
Publication Date
2024-11-08
Estimated Expiration
2042-08-29

AI Technical Summary

Technical Problem

Existing cleaning robots cannot dynamically adjust the battery capacity and cleaning area during the cleaning process, resulting in poor user experience, especially when the remaining power is insufficient, the battery cannot be recharged in time or reminded users to adjust the cleaning plan.

Method used

By obtaining the submap of the area to be cleaned, splicing it into a total map, and drawing an external rectangular box on the total map for correction processing, obtaining edge contour segments, forming a closed cleaning range, thereby predicting the cleaning area in advance and combining the remaining power of the machine Conduct intelligent allocation, prompt recharge or issue early warnings to users.

Benefits of technology

It realizes that the cleaning robot intelligently allocates power during the cleaning process and reminds users to adjust the cleaning plan, improving the intelligence and user experience of the robot.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115429157B_ABST
    Figure CN115429157B_ABST
Patent Text Reader

Abstract

The present invention discloses a method, device, cleaning robot and storage medium for determining a cleaning range. The method for determining a cleaning range includes: obtaining submaps of each sub-area in the area to be cleaned and splicing them into a total map; drawing circumscribed rectangular frames for each submap on the total map and performing a first correction process so that the circumscribed rectangular frames corresponding to any two adjacent submaps have an intersection; obtaining multiple edge contour line segments on the edge of the circumscribed rectangular frame after the first correction process; performing a second correction process on the multiple edge contour line segments so that the multiple edge contour line segments are all located on the edge of the circumscribed rectangular frame before the first correction process; sequentially connecting the multiple edge contour line segments after the second correction process to form a closed edge contour line, and determining the cleaning range by the edge contour line. The present invention can determine the cleaning range of the area to be cleaned, improve the intelligence of the cleaning robot, and also improve the user experience.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of cleaning robots, and in particular to a method and device for determining a cleaning range, a cleaning robot and a computer-readable storage medium. Background Art

[0002] With the rapid development of sensor technology and control technology, and the urgent needs of human production and life, various intelligent devices with specific functional uses are constantly pouring into people's lives, such as cleaning robots with sweeping, vacuuming, mopping, washing and other functions.

[0003] As people's living standards continue to improve, living areas are getting larger and larger. Limited by the limitations of current hardware, the larger the battery capacity, the higher the cost. It is necessary to find a balance between battery capacity, cleaning area, and manufacturing cost. For cleaning robots, the current common operating method is that the machine cleans continuously. When the remaining power reaches a certain threshold, such as 20%, it will be recharged to replenish the power. If the recharge is successful, it will continue cleaning after it is fully charged; if the recharge is unsuccessful, it will stop and enter standby mode. This method cannot be dynamically adjusted according to the possible cleaning area and battery capacity, and the user experience needs to be improved.

[0004] Therefore, it is hoped to propose a solution that can determine the cleaning range of the area to be cleaned based on the map scanned by the existing cleaning robot, predict the cleaning area in advance, and intelligently allocate the remaining power of the machine. When the remaining power is estimated to be insufficient for comprehensive cleaning, the cleaning robot can be recharged in time or the user can be warned to prompt the user to make better arrangements, thereby improving the intelligence of the cleaning robot. In order to realize the above solution, how to determine the cleaning range of the area to be cleaned in order to predict the cleaning area in advance is the first problem that needs to be solved. Summary of the invention

[0005] In view of this, the present invention provides a method and device for determining a cleaning range, a cleaning robot and a computer-readable storage medium to solve the problem of how to determine the cleaning range of an area to be cleaned so as to predict the cleaning area in advance.

[0006] In order to solve the above technical problems, the first aspect of the present invention is to provide a method for determining a cleaning range, which comprises:

[0007] Obtaining submaps of each sub-area within the area to be cleaned, and splicing all the sub-maps into a total map corresponding to the area to be cleaned;

[0008] Draw a circumscribed rectangular frame for each sub-map on the overall map, and perform a first correction process on the circumscribed rectangular frame so that the circumscribed rectangular frames corresponding to any two adjacent sub-maps have an intersection;

[0009] Acquire a plurality of edge contour line segments on the edge of the circumscribed rectangular frame after the first correction process;

[0010] Performing a second correction process on the plurality of edge contour line segments so that the plurality of edge contour line segments are all located on the edges of the circumscribed rectangular frame before the first correction process;

[0011] The plurality of edge contour line segments after the second correction process are sequentially connected to form a closed edge contour line, and the area surrounded by the closed edge contour line is determined as the cleaning range.

[0012] In a preferred solution, the step of obtaining a plurality of edge contour line segments on the edge of the circumscribed rectangular frame after the first correction process includes:

[0013] Determine the initial scanning point: select any circumscribed rectangular box, and select any point on the side of the circumscribed rectangular box that does not intersect with the other circumscribed rectangular boxes as the initial scanning point;

[0014] Scanning to obtain a first edge contour line segment: taking the one circumscribed rectangular frame as the current circumscribed rectangular frame, taking the initial scanning point as the first starting point, scanning along the edge of the current circumscribed rectangular frame in a clockwise or counterclockwise direction until a vertex of the current circumscribed rectangular frame or an intersection of the current circumscribed rectangular frame and another circumscribed rectangular frame appears, interrupting the scanning to form a first end point, and obtaining a first edge contour line segment between the first starting point and the first end point;

[0015] Scanning to obtain a second edge contour line segment: taking the first end point as the second starting point, scanning to form the second end point in accordance with the method of scanning to obtain the first edge contour line segment, and obtaining a second edge contour line segment between the second starting point and the second end point; wherein, if the first end point is a vertex of the current circumscribed rectangular frame, then continue to use the one circumscribed rectangular frame as the current circumscribed rectangular frame; if the first end point is an intersection of the current circumscribed rectangular frame and another circumscribed rectangular frame, then use the other circumscribed rectangular frame as the current circumscribed rectangular frame;

[0016] Circular scanning to obtain the remaining edge contour line segments: taking the end point of the previous scan as the starting point of the next scan, cyclic scanning is performed in a manner similar to scanning to obtain the second edge contour line segment, and an edge contour line segment is formed between the starting point and the end point of each scan respectively, until the scanning is terminated when the initial scanning point appears, thereby obtaining the plurality of edge contour line segments;

[0017] Among them, if the scanning to obtain the first edge contour line segment is performed in the clockwise direction of the current circumscribed rectangular frame, then the scanning to obtain the second edge contour line segment and the circular scanning to obtain the remaining edge contour line segments are each scanned in the clockwise direction of the current circumscribed rectangular frame; if the scanning to obtain the first edge contour line segment is performed in the counterclockwise direction of the current circumscribed rectangular frame, then the scanning to obtain the second edge contour line segment and the circular scanning to obtain the remaining edge contour line segments are each scanned in the counterclockwise direction of the current circumscribed rectangular frame.

[0018] In a preferred scheme, the following points are selected as initial scanning points: the lower left corner vertex of the circumscribed rectangular box located at the lower left on the overall map; or, the upper left corner vertex of the circumscribed rectangular box located at the upper left on the overall map; or, the lower right corner vertex of the circumscribed rectangular box located at the lower right on the overall map; or, the upper right corner vertex of the circumscribed rectangular box located at the upper right on the overall map.

[0019] In a preferred solution, the first correction processing of the circumscribed rectangular frame includes: performing the first correction processing on part of the circumscribed rectangular frame or the entire circumscribed rectangular frame so that the circumscribed rectangular frames corresponding to any two adjacent sub-maps have an intersection; the first correction processing is moving or enlarging the circumscribed rectangular frame.

[0020] In a preferred scheme, the second correction processing of the multiple edge contour line segments includes: for any edge contour line segment, determining whether the edge of the circumscribed rectangular box in which it is located has changed position during the first correction processing: if so, performing the second correction processing on the any edge contour line segment, correcting the any edge contour line segment to the edge of the corresponding circumscribed rectangular box before the first correction processing; if not, not performing the second correction processing on any edge contour line segment.

[0021] In a preferred solution, a first correction process is performed on the circumscribed rectangular frame so that the circumscribed rectangular frames corresponding to any two adjacent sub-maps have an intersection and the sides are not on the same straight line.

[0022] In order to solve the above technical problems, the second aspect of the present invention is to provide a device for determining a cleaning range, which comprises:

[0023] A map acquisition module, configured to acquire submaps of each subarea within the area to be cleaned, and to stitch all the submaps into a total map corresponding to the area to be cleaned;

[0024] A map preprocessing module is configured to draw a circumscribed rectangular frame for each sub-map on the overall map, and perform a first correction process on the circumscribed rectangular frame so that the circumscribed rectangular frames corresponding to any two adjacent sub-maps have an intersection;

[0025] A contour line segment acquisition module, configured to acquire a plurality of edge contour line segments on the edge of the circumscribed rectangular frame after the first correction processing, and perform a second correction processing on the plurality of edge contour line segments so that the plurality of edge contour line segments are all located on the edge of the circumscribed rectangular frame before the first correction processing;

[0026] The cleaning range determination module is configured to sequentially connect the plurality of edge contour line segments after the second correction process to form a closed edge contour line, and determine the area surrounded by the closed edge contour line as the cleaning range.

[0027] In order to solve the above technical problems, the third aspect of the present invention is to provide a cleaning robot, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of the method for determining the cleaning range as described above are implemented.

[0028] In a preferred embodiment, the cleaning robot also includes a cleaning management unit, which is configured to: predict the required cleaning area based on the determined cleaning range, obtain the remaining power information of the cleaning robot, and evaluate whether the remaining power is sufficient to fully clean the required cleaning area; if the remaining power is insufficient for comprehensive cleaning, a signal is fed back to the processor to prompt the need to recharge the cleaning robot and send a warning signal to the user.

[0029] In order to solve the above technical problem, the fourth aspect of the present invention is to provide a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method for determining the cleaning range as described above are implemented.

[0030] The embodiments of the present invention provide a method, device, cleaning robot and computer-readable storage medium for determining a cleaning range. Based on the map obtained by scanning an existing cleaning robot, a circumscribed rectangular frame is drawn on the sub-map of each sub-area, and then the edge contour line segments of the cleaning range are obtained based on the circumscribed rectangular frame. Then, the cleaning range of the area to be cleaned is determined based on the edge contour line segments, and the cleaning area is predicted in advance. In this way, dynamic adjustments can be made based on the possible cleaning area and battery capacity, and intelligent allocation can be made based on the remaining power of the machine. When the remaining power is insufficient for comprehensive cleaning, the cleaning robot can be recharged in time or the user can be warned to prompt the user to make better arrangements, thereby improving the intelligence of the cleaning robot and the user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 is a flowchart of a method for determining a cleaning range in an embodiment of the present invention;

[0032] Figure 2a to Figure 2d is a diagram of a process for determining a cleaning range in a specific embodiment of the present invention;

[0033] Figure 3 is a structural block diagram of a device for determining a cleaning range in an embodiment of the present invention;

[0034] Figure 4 It is a structural block diagram of a cleaning robot in an embodiment of the present invention. DETAILED DESCRIPTION

[0035] In order to make the purpose, technical scheme and advantages of the present invention clearer, the specific embodiments of the present invention are described in detail below in conjunction with the accompanying drawings. Examples of these preferred embodiments are illustrated in the accompanying drawings. The embodiments of the present invention shown in the accompanying drawings and described according to the accompanying drawings are merely exemplary, and the present invention is not limited to these embodiments.

[0036] It should also be noted that, in order to avoid obscuring the present invention due to unnecessary details, only structures and / or processing steps closely related to the solutions according to the present invention are shown in the accompanying drawings, while other details that are not closely related to the present invention are omitted.

[0037] Figure 1 The method for determining the cleaning range of the present application is applied to a terminal device, such as a cleaning robot, and is mainly used to determine the cleaning range of the area to be cleaned, and thereby predict the cleaning area in advance.

[0038] See also Figure 1 , a method for determining a cleaning range provided in an embodiment of the present application includes the following steps:

[0039] Obtain submaps of each sub-area within the area to be cleaned, and stitch all submaps into a total map corresponding to the area to be cleaned.

[0040] Among them, existing cleaning robots usually include image signal acquisition modules such as cameras and lidars. By controlling the cleaning robot to move in the area to be cleaned, it gradually scans and obtains sub-maps of each sub-area, and then splices all sub-maps into a total map corresponding to the area to be cleaned.

[0041] As a specific example, Figure 2a As shown, the area to be cleaned includes 4 sub-areas, and the corresponding 4 sub-maps obtained are sub-map A1, sub-map A2, sub-map A3, and sub-map A4.

[0042] Draw a circumscribed rectangular frame for each sub-map on the overall map, and perform a first correction process on the circumscribed rectangular frame so that the circumscribed rectangular frames corresponding to any two adjacent sub-maps have an intersection.

[0043] Due to the characteristics of scanning, the sub-maps obtained by scanning with a cleaning robot are usually irregular. By drawing circumscribed rectangular frames for each sub-map, the range of each sub-area can be better covered, thereby improving the accuracy of the final cleaning range.

[0044] In a specific solution, the first correction processing of the circumscribed rectangular frame may be: performing the first correction processing on part or all of the circumscribed rectangular frame so that the circumscribed rectangular frames corresponding to any two adjacent sub-maps have an intersection. The first correction processing may be moving or enlarging the corresponding circumscribed rectangular frame.

[0045] As a preferred solution, in this embodiment, the first correction processing is performed on the circumscribed rectangular frame, so that the circumscribed rectangular frames corresponding to any two adjacent sub-maps have intersections and the edges are not on the same straight line. That is, the two circumscribed rectangular frames corresponding to any two adjacent sub-maps have mutually intersecting parts and the edges of the two circumscribed rectangular frames are not on the same straight line (the edges do not overlap each other), thereby reducing the number of intersections of the two circumscribed rectangular frames. In the subsequent scanning process to obtain edge contour segments, when determining the intersection of the two circumscribed rectangular frames, the amount of calculation can be greatly reduced, and the intersection of the two circumscribed rectangular frames can be determined more quickly.

[0046] As a specific example, Figure 2b As shown, on the overall map, four sub-maps are enclosed by rectangular frames respectively, the enclosed rectangular frame B1 corresponds to the sub-map A1, the enclosed rectangular frame B2 corresponds to the sub-map A2, the enclosed rectangular frame B3 corresponds to the sub-map A3, and the enclosed rectangular frame B4 corresponds to the sub-map A4.

[0047] The first correction process is performed on the circumscribed rectangular frames B1 to B4, so that the circumscribed rectangular frames corresponding to any two adjacent sub-maps have intersections and the edges are not on the same straight line. For example, the circumscribed rectangular frame B2 adjacent to the circumscribed rectangular frame B1 has a mutually intersecting portion with the circumscribed rectangular frame B1, and any edge of the circumscribed rectangular frame B2 is not on the same straight line with any edge of the circumscribed rectangular frame B1; the circumscribed rectangular frame B3 adjacent to the circumscribed rectangular frame B1 has a mutually intersecting portion with the circumscribed rectangular frame B1, and any edge of the circumscribed rectangular frame B3 is not on the same straight line with any edge of the circumscribed rectangular frame B1.

[0048] A plurality of edge contour line segments are obtained on the sides of the circumscribed rectangular frame after the first correction process.

[0049] As a preferred solution, in this embodiment, multiple edge contour line segments are obtained on the edge of the circumscribed rectangular frame after the first correction process according to the following steps:

[0050] Determine the initial scanning point: Select any circumscribed rectangular box, and select any point on the side of the circumscribed rectangular box that does not intersect with the other circumscribed rectangular boxes as the initial scanning point.

[0051] Scan to obtain the first edge contour line segment: take an outer rectangular box as the current outer rectangular box, take the initial scanning point as the first starting point, scan along the edge of the current outer rectangular box in a clockwise or counterclockwise direction until the vertex of the current outer rectangular box or the intersection of the current outer rectangular box and another outer rectangular box appears, interrupt the scanning to form the first end point, and obtain the first edge contour line segment between the first starting point and the first end point.

[0052] Scan to obtain a second edge contour line segment: take the first end point as the second starting point, scan to form the second end point in the manner of scanning to obtain the first edge contour line segment, and obtain the second edge contour line segment between the second starting point and the second end point; wherein, if the first end point is a vertex of the current circumscribed rectangular box, then continue to use one circumscribed rectangular box as the current circumscribed rectangular box; if the first end point is the intersection of the current circumscribed rectangular box and another circumscribed rectangular box, then use the other circumscribed rectangular box as the current circumscribed rectangular box.

[0053] Circular scanning is performed to obtain the remaining edge contour segments: the end point of the previous scan is used as the starting point of the next scan, and the scanning is performed cyclically in the same manner as that of scanning to obtain the second edge contour segment, forming an edge contour segment between the starting point and the end point of each scan, and the scanning is terminated when the initial scanning point appears, thereby obtaining multiple edge contour segments.

[0054] Among them, if the scanning to obtain the first edge contour line segment is performed in the clockwise direction of the current circumscribed rectangular frame, then the scanning to obtain the second edge contour line segment and the circular scanning to obtain the remaining edge contour line segments are each scanned in the clockwise direction of the current circumscribed rectangular frame; if the scanning to obtain the first edge contour line segment is performed in the counterclockwise direction of the current circumscribed rectangular frame, then the scanning to obtain the second edge contour line segment and the circular scanning to obtain the remaining edge contour line segments are each scanned in the counterclockwise direction of the current circumscribed rectangular frame.

[0055] Combine the following Figure 2c The step of obtaining a plurality of edge contour line segments on the sides of the circumscribed rectangular frame after the first correction process is described in detail.

[0056] (1) Select the lower left corner vertex A of the circumscribed rectangular box B1 located at the lower left of the overall map as the initial scanning point.

[0057] (2) With the circumscribed rectangular box B1 as the current circumscribed rectangular box and vertex A as the first starting point, scan along the edge of the current circumscribed rectangular box B1 in a counterclockwise direction until vertex B of the current circumscribed rectangular box B1 appears, interrupt the scanning to form the first end point, and obtain the first edge contour line segment AB between the first starting point and the first end point.

[0058] (3) Take the first end point (i.e., vertex B) as the second starting point. Since the first end point is the vertex of the circumscribed rectangular box B1, continue to take the circumscribed rectangular box B1 as the current circumscribed rectangular box. Take vertex B as the second starting point, scan along the edge of the current circumscribed rectangular box B1 in a counterclockwise direction until the intersection C of the current circumscribed rectangular box B1 and another circumscribed rectangular box B2 appears, interrupt the scanning to form the second end point, and obtain the second edge contour line segment BC between the second starting point and the second end point.

[0059] (4) The second end point (i.e., intersection point C) is used as the third starting point. Since the second end point is the intersection point of the circumscribed rectangular frame B1 and another circumscribed rectangular frame B2, the other circumscribed rectangular frame B2 is used as the current circumscribed rectangular frame. With the intersection point C as the third starting point, scan along the edge of the current circumscribed rectangular frame B2 in a counterclockwise direction until the vertex D of the current circumscribed rectangular frame appears, interrupt the scanning to form the third end point, and obtain the third edge contour line segment CD between the third starting point and the third end point.

[0060] (5) The third end point (i.e., vertex D) is used as the fourth starting point. Since the third end point is the vertex of the circumscribed rectangular frame B2, the circumscribed rectangular frame B2 is continued to be the current circumscribed rectangular frame. Vertex D is used as the fourth starting point, and the edge of the current circumscribed rectangular frame B2 is scanned in a counterclockwise direction until the intersection E of the current circumscribed rectangular frame B2 and another circumscribed rectangular frame B3 appears. The scanning is interrupted to form the fourth end point, and the fourth edge contour line segment DE is obtained between the fourth starting point and the fourth end point.

[0061] (6) Referring to the above scanning process, the end point of the previous scan is taken as the starting point of the next scan, and the edge contour line segments EF, FG, GH, HI, IJ, JK, KL and LA are obtained in sequence. When the initial scanning point A appears, a closed-loop scanning process is formed, and the scanning is terminated at this time, thereby obtaining multiple edge contour line segments.

[0062] In some other preferred embodiments, for example, see Figure 2c, the upper left corner vertex J of the circumscribed rectangular box B4 located at the upper left on the overall map can be selected as the initial scanning point, the lower right corner vertex D of the circumscribed rectangular box B2 located at the lower right on the overall map can be selected as the initial scanning point, or the upper right corner vertex I of the circumscribed rectangular box B4 located at the upper right on the overall map can be selected. It is easy to understand that other points can also be selected as the initial scanning point, such as any point on the line segment AB as the initial scanning point,

[0063] A second correction process is performed on the plurality of edge contour line segments, so that the plurality of edge contour line segments are all located on the edge of the circumscribed rectangular frame before the first correction process.

[0064] The second correction process can be understood as the reverse correction of the first correction process. Specifically, for any edge contour line segment, it is determined whether the edge of the circumscribed rectangular frame in which it is located has changed position in the first correction process: if so, the second correction process is performed on the edge contour line segment to correct the edge contour line segment to the edge of the corresponding circumscribed rectangular frame before the first correction process; if not, the second correction process is not performed on the edge contour line segment.

[0065] The plurality of edge contour line segments after the second correction process are sequentially connected to form a closed edge contour line, and the area surrounded by the closed edge contour line is determined as the cleaning range.

[0066] like Figure 2d As shown, the plurality of edge contour line segments after the second correction process are sequentially connected to form a closed edge contour line X, and the area surrounded by the edge contour line X is the cleaning range determined in the specific case.

[0067] The method for determining the cleaning range provided in the above embodiment, based on the map obtained by scanning the existing cleaning robot, draws a circumscribed rectangular frame on the sub-map of each sub-area, and then obtains the edge contour line segments of the cleaning range based on the circumscribed rectangular frame, and determines the cleaning range of the area to be cleaned based on the edge contour line segments, thereby being able to predict the cleaning area in advance. Then, it can be dynamically adjusted according to the possible cleaning area and battery capacity, and can be intelligently allocated in combination with the remaining power of the machine. When the remaining power is insufficient for comprehensive cleaning, the cleaning robot can be recharged in time or the user can be warned to prompt the user to make better arrangements, thereby improving the intelligence of the cleaning robot and the user experience.

[0068] Based on the method for determining the cleaning range provided in the above embodiment, the embodiment of the present application also provides a device for determining the cleaning range, such as Figure 3 As shown, the device includes a map acquisition module 1, a map preprocessing module 2, a contour segment acquisition module 3 and a cleaning range determination module 4.

[0069] The map acquisition module 1 is configured to acquire sub-maps of various sub-areas within the area to be cleaned, and to splice all the sub-maps into a total map corresponding to the area to be cleaned.

[0070] The map preprocessing module 2 is configured to draw a bounding rectangle for each sub-map on the overall map, and perform a first correction process on the bounding rectangle so that the bounding rectangles corresponding to any two adjacent sub-maps have an intersection.

[0071] Among them, the contour line segment acquisition module 3 is configured to obtain multiple edge contour line segments on the edge of the circumscribed rectangular frame after the first correction processing, and perform a second correction processing on the multiple edge contour line segments so that the multiple edge contour line segments are all located on the edge of the circumscribed rectangular frame before the first correction processing.

[0072] The cleaning range determination module 4 is configured to sequentially connect the plurality of edge contour line segments after the second correction process to form a closed edge contour line, and determine the area surrounded by the closed edge contour line as the cleaning range.

[0073] Based on the method for determining the cleaning range provided in the above embodiment, the embodiment of the present application also provides a cleaning robot, such as Figure 4 As shown, the cleaning robot 100 includes: a processor 10, a memory 20, an input device 30 and an output device 40. The processor 10 is provided with a GPU. The number of the processors 10 can be one or more. Figure 4 A processor 10 is taken as an example. The processor 10, the memory 20, the input device 30 and the output device 40 in the cleaning robot 100 may be connected via a bus or other means.

[0074] Among them, the memory 20 is a computer-readable storage medium that can be used to store software programs, computer executable programs and modules. The processor 10 executes various functional applications and data processing of the device by running the software programs, instructions and modules stored in the memory 20, that is, the steps of the method for determining the cleaning range provided in the aforementioned embodiment of the present application are implemented. The input device 30 is used to receive image data, input digital or character information, and generate key signal input related to user settings and function control of the device. The output device 40 may include a display device such as a display screen, for example, for displaying images.

[0075] In this embodiment, Figure 4As shown, the cleaning robot 100 also includes a cleaning management unit 50, which is configured to: predict the required cleaning area based on the determined cleaning range, obtain the remaining power information of the cleaning robot 100, and evaluate whether the remaining power can fully clean the required cleaning area. If the remaining power is not enough for full cleaning, a signal is fed back to the processor 10 to prompt that the cleaning robot 100 needs to be recharged and a warning signal is sent to the user.

[0076] Based on the method for determining the cleaning range provided in the above embodiment, the embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the method for determining the cleaning range provided in the above embodiment of the present application are implemented. The computer storage medium can be any available medium or data storage device that can be accessed by a computer, including but not limited to magnetic storage, optical storage, and semiconductor storage.

[0077] It should be pointed out that the above embodiments are only for illustrating the technical concept and features of the present invention, and their purpose is to enable people familiar with the technology to understand the content of the present invention and implement it accordingly, and they cannot be used to limit the protection scope of the present invention. Any equivalent changes or modifications made according to the spirit of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for determining a cleaning range, characterized in that: include: Obtaining submaps of each sub-area within the area to be cleaned, and splicing all the sub-maps into a total map corresponding to the area to be cleaned; Draw a bounding rectangle for each sub-map on the overall map, and perform a first correction process on the bounding rectangle so that the bounding rectangles corresponding to any two adjacent sub-maps have an intersection; specifically, the process includes: performing the first correction process on part or all of the bounding rectangles so that the bounding rectangles corresponding to any two adjacent sub-maps have an intersection and the edges are not on the same straight line; the first correction process is to move or enlarge the bounding rectangle; and obtain a plurality of edge contour line segments on the edge of the bounding rectangle after the first correction process; The second correction processing is performed on the plurality of edge contour line segments so that the plurality of edge contour line segments are all located on the edge of the circumscribed rectangular frame before the first correction processing; specifically comprising: for any edge contour line segment, determining whether the edge of the circumscribed rectangular frame in which the edge contour line segment is located has changed position in the first correction processing; if so, performing the second correction processing on the any edge contour line segment to correct the any edge contour line segment to be located on the edge of the corresponding circumscribed rectangular frame before the first correction processing; if not, not performing the second correction processing on the any edge contour line segment; The plurality of edge contour line segments after the second correction process are sequentially connected to form a closed edge contour line, and the area surrounded by the closed edge contour line is determined as the cleaning range.

2. The method for determining the cleaning range according to claim 1, characterized in that: The step of obtaining a plurality of edge contour line segments on the edge of the circumscribed rectangular frame after the first correction process comprises: Determine the initial scanning point: select any circumscribed rectangular box, and select any point on the side of the circumscribed rectangular box that does not intersect with the other circumscribed rectangular boxes as the initial scanning point; Scanning to obtain a first edge contour line segment: taking the one circumscribed rectangular frame as the current circumscribed rectangular frame, taking the initial scanning point as the first starting point, scanning along the edge of the current circumscribed rectangular frame in a clockwise or counterclockwise direction until a vertex of the current circumscribed rectangular frame or an intersection of the current circumscribed rectangular frame and another circumscribed rectangular frame appears, interrupting the scanning to form a first end point, and obtaining a first edge contour line segment between the first starting point and the first end point; Scanning to obtain a second edge contour line segment: taking the first end point as the second starting point, scanning to form the second end point in accordance with the method of scanning to obtain the first edge contour line segment, and obtaining a second edge contour line segment between the second starting point and the second end point; wherein, if the first end point is a vertex of the current circumscribed rectangular frame, then continue to use the one circumscribed rectangular frame as the current circumscribed rectangular frame; if the first end point is an intersection of the current circumscribed rectangular frame and another circumscribed rectangular frame, then use the other circumscribed rectangular frame as the current circumscribed rectangular frame; Circular scanning to obtain the remaining edge contour line segments: taking the end point of the previous scan as the starting point of the next scan, cyclic scanning is performed in a manner similar to scanning to obtain the second edge contour line segment, and an edge contour line segment is formed between the starting point and the end point of each scan respectively, until the scanning is terminated when the initial scanning point appears, thereby obtaining the plurality of edge contour line segments; Among them, if the scanning to obtain the first edge contour line segment is performed in the clockwise direction of the current circumscribed rectangular frame, then the scanning to obtain the second edge contour line segment and the circular scanning to obtain the remaining edge contour line segments are each scanned in the clockwise direction of the current circumscribed rectangular frame; if the scanning to obtain the first edge contour line segment is performed in the counterclockwise direction of the current circumscribed rectangular frame, then the scanning to obtain the second edge contour line segment and the circular scanning to obtain the remaining edge contour line segments are each scanned in the counterclockwise direction of the current circumscribed rectangular frame.

3. The method for determining the cleaning range according to claim 2, characterized in that: Select the following points as initial scan points: The lower left corner vertex of the circumscribed rectangular box located at the lower left corner on the overall map; or, The top left corner vertex of the circumscribed rectangular box located at the top left on the overall map; Or, The lower right corner vertex of the circumscribed rectangular box located at the lower right corner on the overall map; or, The top right corner vertex of the circumscribed rectangular box located at the top right on the overall map.

4. A device for determining a cleaning range, characterized in that: include: A map acquisition module, configured to acquire submaps of each subarea within the area to be cleaned, and to stitch all the submaps into a total map corresponding to the area to be cleaned; The map preprocessing module is configured to draw a bounding rectangle for each sub-map on the overall map, and perform a first correction process on the bounding rectangle so that the bounding rectangles corresponding to any two adjacent sub-maps have an intersection; specifically, the first correction process is performed on part or all of the bounding rectangles so that the bounding rectangles corresponding to any two adjacent sub-maps have an intersection and the edges are not on the same straight line; the first correction process is to move or enlarge the bounding rectangle; The contour line segment acquisition module is configured to acquire a plurality of edge contour line segments on the edge of the circumscribed rectangular frame after the first correction processing, and perform a second correction processing on the plurality of edge contour line segments so that the plurality of edge contour line segments are all located on the edge of the circumscribed rectangular frame before the first correction processing, specifically comprising: for any edge contour line segment, determining whether the edge of the circumscribed rectangular frame in which the edge contour line segment is located has undergone a position change in the first correction processing; if so, performing a second correction processing on the any edge contour line segment, correcting the any edge contour line segment to be located on the edge of the corresponding circumscribed rectangular frame before the first correction processing; if not, not performing the second correction processing on the any edge contour line segment; The cleaning range determination module is configured to sequentially connect the plurality of edge contour line segments after the second correction process to form a closed edge contour line, and determine the area surrounded by the closed edge contour line as the cleaning range.

5. A cleaning robot, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the steps of the method for determining the cleaning range as described in any one of claims 1-3 are implemented.

6. The cleaning robot according to claim 5, characterized in that: The cleaning robot further comprises a cleaning management unit, which is configured as follows: The required cleaning area is predicted based on the determined cleaning range, the remaining power information of the cleaning robot is obtained, and it is evaluated whether the remaining power is sufficient to fully clean the required cleaning area; if the remaining power is insufficient for comprehensive cleaning, a signal is fed back to the processor to prompt the need to recharge the cleaning robot and send a warning signal to the user.

7. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method for determining the cleaning range as described in any one of claims 1 to 3 are implemented.