Region division method, robot and computer readable storage medium

By scanning and partition identification of the sweeping robot during the first use, the problem that the sweeping robot cannot partition according to the actual home environment topology structure is solved, and the cleaning efficiency and user experience are improved.

CN118902343APending Publication Date: 2024-11-08TP-LINK
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411189790.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-27
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

When used for the first time, the sweeping robot cannot partition according to the topology of the actual home environment, resulting in inefficient cleaning and repeated walking between multiple rooms, reducing cleaning efficiency and user experience.

Method used

Through the robot performs spatial scanning at the current location, obtains spatial information, identify detected and cleaned areas, build work areas, and partition them according to the connected areas, ensuring that the partition is in line with the topological structure of the actual home environment and avoid repeated walking across rooms .

Benefits of technology

The cleaning efficiency of the sweeping robot is improved, so that each partition is an independent cleaning unit, reducing repeated walking across rooms, and improving cleaning efficiency and user experience.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118902343A_ABST
    Figure CN118902343A_ABST
Patent Text Reader

Abstract

The invention is suitable for the technical field of robots, and provides a region division method, a robot and a computer readable storage medium, the robot executes a space scanning task at a current position to obtain space information, and identifies detected and cleaned regions based on the information, and then constructs a to-be-cleaned working region, and the to-be-cleaned working region is used for cleaning the to-be-cleaned working region. In order to more comprehensively and thoroughly understand the structural layout of the working area, connection areas where the current space of the robot in the working area is communicated with other spaces are recognized, so that the working area is reasonably divided according to the communication areas, and it is ensured that the subareas are matched with the topological structure of the actual home environment. Therefore, each subarea is used as an independent cleaning unit, so that the robot can concentrate on the current cleaning area and does not need to walk repeatedly among a plurality of rooms to complete cleaning, the situation that the robot crosses over the plurality of rooms to complete cleaning is avoided, and the cleaning efficiency of the robot is greatly improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of robotics technology, and in particular, relates to a region division method, a robot, and a computer-readable storage medium. Background Art

[0002] With the development of intelligent electrical appliances, sweeping robots have become an important tool for modern cleaning, and their intelligence and automation levels are constantly improving.

[0003] When the robot vacuum cleaner is used for the first time, it builds Figure 1 While completing the cleaning task, since there is no historical map information when it is used for the first time, it is impossible to partition and execute the cleaning task according to the actual topology of the home environment, but the cleaning task is executed according to the preset partitions, but the preset partitions usually do not conform to the actual topology of the environment, and the preset partitions cannot distinguish different rooms, and a room will be divided into different partitions. When a preset partition includes multiple rooms, the sweeping robot needs to travel back and forth between multiple rooms for multiple times to complete the cleaning task of a preset partition, which reduces the cleaning efficiency of the sweeping robot. Summary of the invention

[0004] The embodiments of the present application provide a method for dividing an area, a robot, and a computer-readable storage medium, which can solve the problem of how to divide the area according to the topology of the actual home environment.

[0005] In a first aspect, an embodiment of the present application provides a method for dividing a region, including:

[0006] Obtain spatial information, which is obtained by the robot performing spatial scanning at its current location;

[0007] According to the detected area and the cleaned area corresponding to the spatial information, a working area is constructed, and the working area is used to represent the area that the robot needs to clean;

[0008] Identify the connection area in the working area. The connection area is used to indicate the area where the robot's current space is connected to other spaces.

[0009] The working area is partitioned according to at least one connection area.

[0010] In the area division method provided in the first aspect, the robot performs a space scanning task at the current position to obtain space information, and identifies the detected and cleaned areas based on the information, and then constructs the work area to be cleaned. In order to more comprehensively and thoroughly understand the structural layout of the work area, the connection area between the current space of the robot in the work area and other spaces is identified, so that the work area is reasonably divided according to these connected areas, ensuring that the partitions are consistent with the topological structure of the actual home environment. In this way, each partition is used as an independent cleaning unit, so that the robot can focus more on the current cleaning area without having to walk repeatedly between multiple rooms to complete the cleaning, avoiding crossing multiple rooms to complete the cleaning, thereby greatly improving the cleaning efficiency of the robot.

[0011] In a second aspect, an embodiment of the present application provides a region division device, including:

[0012] An acquisition unit is used to acquire spatial information, which is obtained by the robot performing spatial scanning at its current location;

[0013] A construction unit, used to construct a working area according to the detected area and the cleaned area corresponding to the spatial information, where the working area is used to represent the area that the robot needs to clean;

[0014] An identification unit, used to identify a connection area in the working area, where the connection area is used to indicate an area where the robot's current space is connected to other spaces;

[0015] The partitioning unit is used to partition the working area according to at least one connection area.

[0016] In a third aspect, an embodiment of the present application provides a robot, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program implements the method described in the first aspect when executed by the processor.

[0017] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, comprising: a computer program is stored in the computer-readable storage medium, and when the computer program is executed, it is used to execute the method described in the first aspect.

[0018] In a fifth aspect, an embodiment of the present application provides a computer program product, which, when executed on a robot, enables the robot to execute the method described in the first aspect above.

[0019] In a sixth aspect, an embodiment of the present application provides a chip, comprising: a processor, configured to call and run a computer program from a memory, so that a robot equipped with the chip executes the first aspect or the method described in the first aspect.

[0020] It can be understood that the beneficial effects of the second to sixth aspects mentioned above can be found in the relevant description of the first aspect mentioned above, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] 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 any creative work.

[0022] Figure 1 It is a schematic diagram of the preset partitions in the prior art provided by the embodiment of the present application;

[0023] Figure 2 is a schematic flow chart of a regional division provided in an embodiment of the present application;

[0024] Figure 3 is a schematic diagram of a map orientation change provided in an embodiment of the present application;

[0025] Figure 4 is a schematic diagram of the morphology of an expanded obstacle provided in an embodiment of the present application;

[0026] Figure 5A is a schematic diagram of a working area when the robot provided in an embodiment of the present application just starts cleaning;

[0027] Figure 5B is a schematic diagram of a working area when the robot provided in an embodiment of the present application cleans for a period of time;

[0028] Figure 6 It is a schematic diagram of the conditions that need to be met for the bottleneck detection provided in the embodiment of the present application;

[0029] Figure 7 is a structural block diagram of a region division device provided in an embodiment of the present application;

[0030] Figure 8 It is a schematic structural diagram of the robot provided in the embodiment of the present application. DETAILED DESCRIPTION

[0031] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.

[0032] It should be understood that when used in the present specification and the appended claims, the term "comprising" indicates the presence of described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.

[0033] It should also be understood that the term “and / or” used in the specification and appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0034] As used in the specification and appended claims of this application, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [described condition or event] is detected" or "in response to detecting [described condition or event]", depending on the context.

[0035] In addition, in the description of the present application specification and the appended claims, the terms "first", "second", "third", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance.

[0036] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways.

[0037] The first cleaning of the robot vacuum cleaner is to build a Figure 1The function of completing the cleaning task while the robot vacuum cleaner is running can allow users to immediately use the robot vacuum cleaner to perform cleaning tasks, so that users do not need to wait for the robot vacuum cleaner to complete the mapping task first and then perform cleaning tasks according to the constructed map. During the cleaning process, the robot vacuum cleaner performs cleaning tasks according to the partition as the smallest unit. However, the robot vacuum cleaner does not have map information before the first cleaning, and cannot perform cleaning tasks according to the actual topology in advance. Instead, it performs cleaning tasks according to the preset partitions, such as Figure 1 As shown, Figure 1 The present application embodiment provides a schematic diagram of preset partitions. Figure 1 In the example, the preset partition is a square, and only one complete square is shown, and the other partitions are all parts of the preset square partition. Figure 1 It can be seen that the preset partitions do not conform to the actual home environment topology. A preset partition can include multiple rooms. When the robot performs cleaning tasks according to the preset partitions, the sweeping robot needs to go back and forth between multiple rooms many times, which reduces the cleaning efficiency of the sweeping robot. Figure 1 The preset partition area corresponding to the lower right corner includes two unconnected areas. When one of the areas is being cleaned, the map information of the other area has not been refreshed, so that the other area in the same preset partition area needs to be subsequently re-scanned. The timing, sequence, and logic of the re-scanning are relatively complicated, which may easily cause missed scanning of the areas that need to be re-scanned, thereby reducing the cleaning efficiency of the sweeping robot and the user experience of the user using the sweeping robot for cleaning.

[0038] In view of this, the embodiment of the present application provides a method for dividing an area, in which the robot performs a space scanning task at the current position to obtain space information, and identifies the areas that have been detected and cleaned based on the information, and then constructs a work area to be cleaned. In order to more comprehensively and thoroughly understand the structural layout of the work area, the connection area between the space where the robot is currently located and other spaces in the work area is identified, so that the work area is reasonably divided according to these connected areas, ensuring that the partitions are consistent with the topological structure of the actual home environment. In this way, each partition is used as an independent cleaning unit, so that the robot can focus more on the current cleaning area without having to repeatedly walk between multiple rooms to complete the cleaning, avoiding crossing multiple rooms to complete the cleaning, thereby greatly improving the cleaning efficiency of the robot.

[0039] The area division method provided in the embodiment of the present application will be described in detail below.

[0040] Figure 2The figure shows a schematic flow chart of the area division method provided in the present application. As an example but not limitation, the method can be applied to robots, especially sweeping robots. The area division method provided in the embodiment of the present application includes S210 to S240.

[0041] S210, acquiring spatial information.

[0042] The spatial information is obtained by the robot performing spatial scanning at its current location.

[0043] Exemplarily, the robot performs spatial scanning at the current location through SLAM (Simultaneous Localization And Mapping) technology to obtain spatial information. Among them, SLAM technology includes laser SLAM or visual SLAM. Among them, laser SLAM uses a laser radar mounted on the robot as the main sensor to obtain spatial information through laser scanning. Visual SLAM uses a visual sensor (such as a monocular camera, a binocular camera, a depth camera RGBD, etc.) mounted on the robot as the main sensor to obtain spatial information through image processing and analysis. The spatial information can be the two-dimensional map (for example: grid map) information of the space where the robot is currently located, as well as the positioning information of the robot in the two-dimensional map.

[0044] Optionally, considering that the orientation of a map model constructed directly using spatial information is usually slanted, and such a map model does not conform to the user's viewing habits, in order to make the orientation of the constructed map model conform to the user's viewing habits and improve the user's viewing experience, the spatial information used to construct the map model can be processed so that the map model constructed with the processed spatial information conforms to the user's viewing habits, thereby improving the user's viewing experience, and the horizontal map model is conducive to the detection of connected areas.

[0045] In the embodiment of the present application, the above step S210 includes S210a, S210b and S210c:

[0046] S210a, performing a spatial scan at the current location to obtain initial spatial information;

[0047] As an example but not limitation, the initial space information includes the robot's own position information and posture information in space, obstacle information, space layout information, etc. The obstacle information is point cloud information reflected by the obstacle, and the point cloud information can be two-dimensional point cloud information or three-dimensional point cloud information.

[0048] It can be understood that the robot can obtain and update spatial information in real time, and update the map model and the position information of the robot in the map model according to the updated spatial information.

[0049] S210b. According to the direction corresponding to the wall in the initial spatial information, adjust the angle of the initial spatial information to obtain first information.

[0050] The first information is the initial spatial information after the angle is adjusted.

[0051] In a possible implementation, the initial spatial information is detected according to a line detection algorithm, a line in the initial spatial information is determined, and the line is a wall in the space where the robot is currently located. The initial spatial information is rotated by a specific angle so that the line in the initial spatial information is horizontal or vertical, and the first information is obtained, so that the map constructed according to the first information is horizontal or vertical. As an example and not a limitation, the line detection algorithm includes one of the following: Hough Transform, gradient line detection (Line Segment Detector, LSD), a line detection algorithm based on deep learning, etc.

[0052] For example, Figure 3 As shown, the embodiment of the present application provides a schematic diagram of a map orientation change. Figure 3 If you rotate the left picture in the middle by a certain angle, you will get the picture on the right.

[0053] Preferably, the straight line in the initial space information is the longest straight line in the space where the robot is currently located. It can be understood that the longest straight line in the space where the robot is located corresponds to the longest wall in the space where the robot is located.

[0054] S210c. Perform expansion processing on the information corresponding to the obstacle in the first information to obtain spatial information.

[0055] Since the rotation map may have errors, the two ends of the pass are misaligned by several points in the horizontal or vertical direction, resulting in the two ends of the pass not being in the same horizontal or vertical direction. For this defect, in the embodiment of the present application, the obstacle boundary in the first information can be expanded outward by a certain distance to obtain the expanded obstacle and obtain the spatial information. It should be noted that the pass is the area where the robot's current space is connected to other spaces, that is, the connection area.

[0056] Exemplarily, all grid points within a certain range (such as 3*3 or 5*5) around the corresponding grid points of all obstacles on the map are set as obstacles, and the bottleneck is a straight line between obstacles, which can ensure that the bottleneck is a horizontal or vertical straight line. Figure 4Shown is a schematic diagram of the shape of the obstacle after expansion shown in the embodiment of the present application. Before the expansion, the obstacles on the left and right sides of the bottleneck (such as the straight lines in the dotted boxes on the left and right sides in the figure) are not on the same horizontal line. The dotted box is the shape of the obstacle after expansion shown in the embodiment of the present application, that is, the expanded obstacle. The straight line between the expanded obstacles is the bottleneck between the obstacles. The expansion of the obstacles improves the fault tolerance of the partitioned bottleneck.

[0057] S220: Construct a working area according to the detected area and the cleaned area corresponding to the spatial information.

[0058] The working area is used to indicate the area that the robot needs to clean.

[0059] When the robot just starts cleaning, since the robot has not yet started cleaning, there is no cleaned area in the spatial information. At this time, the working area is the detected area corresponding to the spatial information. Figure 5A As shown, the embodiment of the present application provides a schematic diagram of the working area when the robot just starts cleaning. Figure 5A In the example, the robot is in room A and starts cleaning from room A. The detected area includes room A, part of room D, and part of room C. The working area is the detected area, that is, the working area includes room A, part of room D, and part of room C.

[0060] When the robot has been cleaning for a period of time, it is necessary to remove the cleaned area from the corresponding detected area in the spatial information, and use the detected area after excluding the cleaned area as the working area. Figure 5B As shown, the embodiment of the present application provides a schematic diagram of the working area when the robot cleans for a period of time. Figure 5B In the figure, the robot is in room D and has finished cleaning room A, that is, room A is the cleaned area, the detected area includes room A, part of room D, part of room C, and part of room B, then the working area includes part of room D, part of room C, and part of room B.

[0061] In a possible implementation, the constructed working area is a grid map corresponding to an area where the robot can move freely.

[0062] S230: Identify the connection area in the working area.

[0063] The connection area is used to indicate the area where the robot's current space is connected to other spaces.

[0064] In the following, S230 will be described in different ways.

[0065] Optionally, S230 includes S2301 and S2302:

[0066] S2301, during the robot cleaning process, the spatial information around the current location is identified to obtain multiple candidate areas.

[0067] Each candidate area among the multiple candidate areas indicates that the space where the robot is currently located may be connected with other spaces through the candidate area.

[0068] In an embodiment of the present application, S2301 can be implemented in the following manner: during the robot cleaning process, the robot starts to move from the location of the robot, identifies the area corresponding to the preset spatial information around the starting position of the robot, and obtains multiple candidate areas.

[0069] In the embodiment of the present application, S2301 can also be implemented by the following steps:

[0070] S2031a, determining the recognition range according to the movement speed of the robot and the preset time.

[0071] Specifically, the robot's movement speed and the preset time length are multiplied to determine the recognition range. Specifically, if the robot's movement speed is 0.2 m / s and the preset time length is 1 s, the recognition range is 0.2 m.

[0072] S2031b, determine the space to be identified based on the identification range and the current location of the robot.

[0073] Specifically, with the current location of the robot as the center, a circular area or a square area formed by the recognition range or multiples of the recognition range radiating outward from the center is determined as the space to be recognized.

[0074] S2031c, identifying the spatial information corresponding to the space to be identified, and obtaining a plurality of candidate regions.

[0075] Specifically, the space to be identified is traversed, spatial information corresponding to the space to be identified is identified, and multiple candidate regions in the space to be identified are determined.

[0076] For example, the robot will continuously detect bottlenecks during the cleaning process, and can traverse map information near the current location of the robot to obtain nearby candidate bottlenecks in the main connected domain that are horizontal or vertical and have appropriate widths between obstacles.

[0077] Optionally, the obtained multiple candidate regions may include: candidate regions that are similar to the repeated candidate regions that have been determined, and candidate regions that are repeated themselves. The implementation method for deduplicating candidate regions provided in the embodiment of the present application is also provided. The implementation method for deduplicating candidate regions provided in the embodiment of the present application is specifically described below:

[0078] A1, according to the direction of each candidate region and the position corresponding to each candidate region, combined with the direction and the corresponding position of the determined connection region, each candidate region is screened to obtain at least one connection region.

[0079] Exemplarily, in the case where the direction of each candidate region and the position corresponding to each candidate region, and the direction and the corresponding position of the determined connected region meet preset conditions, the candidate region meeting the conditions is deleted.

[0080] The preset condition is that the direction of each candidate region is consistent with the direction of the determined connection region, and the distance between the position corresponding to each candidate region and the position corresponding to the determined connection region is within a preset distance.

[0081] Exemplarily, the direction of each candidate region is consistent with the direction of the determined connection region, including: the direction of each candidate region and the direction of the determined connection region are both horizontal or vertical. The distance between the position corresponding to each candidate region and the position corresponding to the determined connection region is within a preset distance: including the distance between the position corresponding to each candidate region and the position corresponding to the determined connection region is less than the preset distance. Among them, the preset distance can be 1m, and step A1 can be achieved by removing the same-direction bottlenecks near the known bottlenecks (less than 1m).

[0082] The preset condition may also be that the direction of each candidate region is consistent with the direction of the determined connection region, and the position corresponding to each candidate region is within a preset area around the position corresponding to the determined connection region.

[0083] Specifically, the connection area that has been determined in the historical identification process is a 1m long pass in the horizontal direction. The grid points near the determined connection area can be marked in the grid map. As an example but not a limitation: the grid points in the 1m*1m rectangular area above and below the pass can be marked on the map. If the position corresponding to the candidate area is within the rectangular area, the candidate area is deleted. It should be noted that there are obstacles on the left and right sides of the pass in the horizontal direction, and there is no need to mark the areas on the left and right sides of the pass.

[0084] A2: If multiple candidate regions are located in the same direction and the candidate regions are adjacent to each other in the same direction, one of the multiple candidate regions is retained to obtain at least one connected region.

[0085] For the same room, there are usually no mutually close passes in the same direction. If there are two mutually close passes in the same direction, the area between the two passes is very small and does not meet the pass screening conditions. In this case, the two mutually close passes in the same direction may actually represent the same pass. Therefore, only one of the passes needs to be retained.

[0086] For example, in the same direction, if the coordinates of multiple candidate regions are continuous, then any candidate region among the candidate regions is selected as the candidate region with the continuous coordinates.

[0087] S2302: Screen multiple candidate regions to obtain at least one connected region.

[0088] According to the above steps A1 and / or A2, multiple candidate regions are deduplicated and screened to obtain at least one connected region.

[0089] In a possible implementation, the candidate regions that do not meet the preset conditions in the above step A1 are retained, and the candidate regions that meet the preset conditions are deleted to obtain at least one continuous region. The candidate regions that do not meet the preset conditions include: candidate regions where the direction of each candidate region is consistent with the direction of the determined connection region, but the distance between the position corresponding to each candidate region and the position corresponding to the determined connection region is outside the preset distance, or candidate regions where the position corresponding to each candidate region is outside the preset area around the position corresponding to the determined connection region.

[0090] In another possible implementation, the candidate regions retained in the above step A2 are screened according to step A1 to obtain at least one connected region. It is understandable that step A1 may be performed first and then step A2. The embodiment of the present application does not limit the execution order of steps A1 and A2.

[0091] Optionally, a reasonable connection area should also satisfy the requirement that the room areas on both sides of the connection area are large enough, so that such a connection area can be used as a partition bottleneck.

[0092] Exemplarily, the above S2302 also includes: for each candidate area, comparing the area length of the candidate area with the space width of the space where the robot is currently located, and comparing the space width of the current space and the space length of the current space with a preset width threshold and a preset length threshold respectively, to obtain a comparison result, and determining at least one connection area based on the comparison result.

[0093] Among them, the space width is used to represent the size of the robot's current space in the direction of the candidate area, such as Figure 6 As shown, Figure 6 Schematic diagram of the conditions that need to be met for the bottleneck detection provided in the embodiment of the present application. The bottleneck is in the horizontal direction, and the space width is the dimension extending in the horizontal direction of the room, which is called the width. The space length is used to represent the dimension corresponding to the direction perpendicular to the direction of the candidate area in the current space of the robot, that is, the dimension extending in the vertical direction of the room, corresponding to Figure 6 Medium depth Depth.

[0094] In a possible implementation, the space width and the space length can be determined by counting the number of free grid points in the horizontal direction and the vertical direction in the pass isolation area and the resolution of the grid map.

[0095] In a possible implementation, if the region length is smaller than the space width, and the space width is larger than a preset width threshold, and the space length is larger than a preset length threshold, the candidate region is taken as a connection region.

[0096] For example, Figure 6 As shown, L represents the region length of the candidate region, that is, the length of the bottleneck. The region length is less than the space width. In other words, the room width is longer than the bottleneck length, indicating that the bottleneck is narrow. This is the first condition that the candidate bottleneck needs to meet to become a partition bottleneck. If the space width is greater than the preset width threshold and the space length is greater than the preset length threshold, it indicates that the room area is large enough. This is the second condition that the candidate bottleneck needs to meet to become a partition bottleneck. Among them, the preset width threshold and the preset length threshold can be determined according to the width and length dimensions corresponding to common rooms. As an example but not a limitation, the preset width threshold and the preset length threshold can take any value between 1.5m and 2m.

[0097] In another possible implementation, if the region length is greater than or equal to the space width, and / or the space width is less than or equal to a preset width threshold and the space length is less than or equal to a preset length threshold, the candidate region is deleted.

[0098] If the area length is greater than or equal to the space width, it means the bottleneck is wide. If the space width is less than or equal to the width threshold, the space length is less than or equal to the length threshold, the area formed by the space width and space length is not large enough, or the room area is not large enough. If the area length is greater than or equal to the space, and / or the width of the space is less than or equal to the width threshold, and the space length is less than or equal to the length threshold, the bottleneck is not an area where the robot's current space is connected to other spaces, then the candidate area needs to be deleted.

[0099] Preferably, the candidate area is the only area where the space where the robot is currently located is connected to other spaces.

[0100] For example, if the path between any point in the current space of the regions on both sides of the candidate region and any point in the space other than the current space in the working area is unreachable, it is determined that the candidate region is the only region that connects the current space with other spaces. If the path between any point in the current space of the regions on both sides of the candidate region and any point in the space other than the current space in the working area is reachable, it is determined that the candidate region is not the only region that connects the current space with other spaces.

[0101] Specifically, after setting the candidate area as a virtual obstacle, take any point in the current space and any point in the space other than the current space in the working area, and traverse the path between the two points to detect whether the path between the two points is reachable. If the path between the two points is reachable, it means that the candidate area is not the only area where the robot's current space is connected to other spaces. Otherwise, it means that the candidate area is the only area where the robot's current space is connected to other spaces.

[0102] Optionally, in order to improve the rationality of the partition, it is also necessary to select a candidate bottleneck with a suitable width. In the embodiment of the present application, the length of the area corresponding to the bottleneck can be determined according to the door width information of the space where the robot is located. Specifically, the robot can determine the door width information of the space where the robot is located according to the space information, and then determine the area length corresponding to the candidate area according to the door width information of the space where the robot is located.

[0103] For example, when the robot obtains spatial information, it can obtain the position and shape of the door, and can determine the door width information of the space where the robot is located based on the position and shape of the door.

[0104] In some embodiments, the area length corresponding to the narrow passage may also satisfy a preset area length. The preset area length is usually determined based on the width of the door in the home scene, and may be any size between 0.6 m and 1.2 m.

[0105] In a possible implementation, the door width information of the space where the robot is located may be used as the area length corresponding to the candidate area.

[0106] In another possible implementation, the dimensions within the error range of the door width information of the space where the robot is located can be used as the area length corresponding to the candidate area.

[0107] It should be noted that after determining the region length corresponding to the candidate region, at least one candidate region that meets the region length corresponding to the candidate region can be retained, and at least one candidate region that does not meet the region length corresponding to the candidate region can be deleted, so as to further screen the candidate regions.

[0108] Optionally, since the spatial information scanned by the robot during the cleaning process is gradually updated, the detection of the connection area also needs to be continuous. However, the continuous detection of the connection area requires a large amount of calculation, and the map constructed by the spatial information has high repeatability. Therefore, it is necessary to set an appropriate time for connecting area detection.

[0109] In some embodiments, S230 includes: periodically identifying the connection area in the working area according to a preset time period or movement distance period.

[0110] As an example but not a limitation, the preset time period may be 1 second, and the connection area of ​​the working area is periodically identified every 1 second; or the movement distance period may be 0.25 meters, and the robot recognizes the connection area in the working area again after moving 0.25 meters after performing one recognition. The above values ​​can be modified according to actual conditions, and this application does not limit them here.

[0111] S240: Partition the working area according to at least one connection area.

[0112] In an embodiment of the present application, at least one connection area is set as a virtual obstacle area, and the working area is divided into at least one sub-area according to the virtual obstacle area. The robot will clean the sub-area corresponding to the current position.

[0113] For example, Figure 5A As shown, in room A, the connection area between room A and room D is detected, and the connection area between room A and room D is set as a virtual obstacle area, and two sub-areas are obtained: the first sub-area: room A, the second sub-area: part of room D and part of room C, and the robot cleans in the first sub-area (i.e., room A).

[0114] For example, Figure 5B As shown, the robot is in room D, detects the connecting area between room D and room C, and the connecting area between room D and room D, sets the connecting area between room D and room C, and the connecting area between room D and room D as virtual obstacle areas, and divides the working area into three sub-areas: the first sub-area: a partial area of ​​room D, the second sub-area: a partial area of ​​room C, the third sub-area: a partial area of ​​room B, and the robot cleans in the first sub-area (i.e., a partial area of ​​room D).

[0115] Further, such as Figure 5BAs shown, while the robot is cleaning a part of the room D, the spatial information of another part of the room D has not been scanned. To complete the overall cleaning of the room D, it is necessary to continue to obtain the spatial information of the room D during the cleaning process.

[0116] Optionally, the area division method provided in the embodiment of the present application further includes:

[0117] S240A1, continuously acquire spatial information during cleaning in the work area;

[0118] For example, Figure 5B As shown, during the cleaning process in room D, it is also necessary to continuously obtain spatial information of unknown areas in room D to ensure that the spatial information in room D is completely known.

[0119] It should be noted that the specific method of obtaining the spatial information in S240A1 is similar to that in S210, and will not be described in detail in this embodiment of the present application.

[0120] S240A2, updating the working area according to the continuously acquired spatial information.

[0121] Exemplarily, spatial information of unknown areas in room D is continuously acquired, the spatial information of room D is completed according to the spatial information of the unknown areas in room D, and the working area is updated.

[0122] Optionally, the area division method provided in the embodiment of the present application further includes:

[0123] S240B: If the work area is updated and the connection area is identified for each sub-area in the work area, the connection area identification of the work area is stopped until the work area is cleaned.

[0124] The completion of the update of the working area indicates that the spatial information corresponding to the working area is completely known, and the working area does not include unknown position grids. After the connected areas of each sub-area in the working area are identified, there is no need to continue detecting the connected areas of the working area. Stop identifying the connected areas of the working area until the working area is cleaned. This can reduce the power consumption of the robot and increase the battery life of the robot.

[0125] It should be noted that, in the process of acquiring spatial information, it can be determined whether each position grid point is known or unknown.

[0126] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0127] In the area division method provided in the embodiment of the present application, the robot performs a space scanning task at the current position to obtain space information, and identifies the detected and cleaned areas based on the information, and then constructs the work area to be cleaned. In order to more comprehensively and thoroughly understand the structural layout of the work area, the connection area between the space where the robot is currently located and other spaces in the work area is identified, so that the work area is reasonably divided according to these connected areas, ensuring that the partitions are consistent with the topological structure of the actual home environment. In this way, each partition is used as an independent cleaning unit, so that the robot can focus more on the current cleaning area without having to repeatedly walk between multiple rooms to complete the cleaning, avoiding crossing multiple rooms to complete the cleaning, thereby greatly improving the cleaning efficiency of the robot.

[0128] Corresponding to the area division method described in the above embodiment, Figure 7 A structural block diagram of a region division device provided in an embodiment of the present application is shown. For ease of explanation, only the parts related to the embodiment of the present application are shown.

[0129] Reference Figure 7 The device 700 includes: an acquisition unit 710, a construction unit 720, an identification unit 730 and a partitioning unit 740, wherein:

[0130] An acquisition unit 710 is used to acquire spatial information, where the spatial information is obtained by the robot performing spatial scanning at its current location;

[0131] A construction unit 720 is used to construct a working area according to the detected area and the cleaned area corresponding to the spatial information, where the working area is used to represent the area that the robot needs to clean;

[0132] An identification unit 730 is used to identify a connection area in the working area, where the connection area is used to indicate an area where the robot's current space is connected to other spaces;

[0133] The partitioning unit 740 is used to partition the working area according to at least one connection area.

[0134] Optionally, in a possible implementation, the identification unit 730 is also used to identify the spatial information around the current position of the robot during the robot cleaning process to obtain multiple candidate areas; and screen the multiple candidate areas to obtain at least one connected area.

[0135] Optionally, in a possible implementation, the identification unit 730 is further configured to determine an identification range according to the movement speed of the robot and a preset duration; and determine a space to be identified according to the identification range and in combination with the current position of the robot;

[0136] The spatial information corresponding to the space to be identified is identified to obtain multiple candidate regions.

[0137] Optionally, in a possible implementation, the identification unit 730 is further used to screen each candidate area according to the direction of each candidate area and the position corresponding to each candidate area, combined with the direction and the corresponding position of the determined connected area, to obtain at least one connected area; and / or, if multiple candidate areas are located in the same direction and the candidate areas are adjacent along the same direction, then retain one candidate area among the multiple candidate areas to obtain at least one connected area.

[0138] Optionally, in a possible implementation, the identification unit 730 is also used to compare the region length of the candidate region with the spatial width for each candidate region, and to compare the spatial width and the spatial length with a preset width threshold and a preset length threshold, respectively, the spatial width being used to indicate the size of the current space in the direction where the candidate region is located, and the spatial length being used to indicate the size of the current space in a direction perpendicular to the direction where the candidate region is located; if the region length is smaller than the spatial width, and the spatial width is greater than the preset width threshold and the spatial length is greater than the preset length threshold, the candidate region is taken as a connected region.

[0139] Optionally, in a possible implementation, the acquisition unit 710 is also used to perform a spatial scan at the current position of the robot to obtain initial spatial information; adjust the angle of the initial spatial information according to the direction corresponding to the wall in the initial spatial information to obtain first information, and the first information is the initial spatial information after the angle adjustment; and expand the information corresponding to the obstacle in the first information to obtain spatial information.

[0140] Optionally, in a possible implementation, the identification unit 730 is further configured to periodically identify the connection area in the working area according to a preset time period or movement distance period.

[0141] Optionally, in a possible implementation, the partitioning unit 740 is further configured to set at least one connection area as a virtual obstacle area; and divide the working area into at least one sub-area according to the obstacle area.

[0142] It should be noted that the information interaction, execution process, etc. between the above-mentioned devices / units are based on the same concept as the method embodiment of the present application. Their specific functions and technical effects can be found in the method embodiment part and will not be repeated here.

[0143] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.

[0144] Figure 8 The figure shows a schematic structural diagram of a robot provided in an embodiment of the present application. Figure 8 As shown, the robot 800 includes: a processor 810, a memory 820, and a computer program 830 stored in the memory 820 and executable on the processor 810. When the processor 810 executes the computer program 830, the steps of the area division method provided in the embodiment of the present application are implemented. Alternatively, when the processor 810 executes the computer program 830, the functions of each unit in the above-mentioned device 700 are implemented.

[0145] Exemplarily, the computer program 830 may be divided into one or more units, one or more units are stored in the memory 820, and executed by the processor 810. One or more units may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program 830 in the area division device 700. For example, the computer program 830 may be divided into: an acquisition unit, a construction unit, an identification unit, and a partitioning unit. The functions of the acquisition unit, the construction unit, the identification unit, and the partitioning unit may refer to the above description of the functions of each unit in the device 700, and for the sake of brevity, they are not repeated here.

[0146] In one example, the unit in any of the above devices may be one or more integrated circuits configured to implement the above method, such as one or more application specific integrated circuits (ASIC), or one or more digital signal processors (DSP), or one or more field programmable gate arrays (FPGA), or a combination of at least two of these integrated circuit forms. For another example, when the unit in the device can be implemented in the form of a processing element scheduler, the processing element can be a general-purpose processor, such as a central processing unit (CPU) or other processor that can call a program. For another example, these units can be integrated together and implemented in the form of a system-on-a-chip (SOC).

[0147] An embodiment of the present application further provides 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 in the above-mentioned method embodiments can be implemented.

[0148] An embodiment of the present application provides a computer program product. When the computer program product runs on a robot, the robot can implement the steps in the above-mentioned method embodiments when executing the computer program product.

[0149] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present application implements all or part of the processes in the above-mentioned embodiment method, which can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may at least include: any entity or device that can carry the computer program code to the area division device or robot, a recording medium, a computer memory, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, RandomAccess Memory), an electric carrier signal, a telecommunication signal, and a software distribution medium. For example, a USB flash drive, a mobile hard disk, a magnetic disk or an optical disk. In some jurisdictions, according to legislation and patent practice, computer-readable media cannot be electric carrier signals and telecommunication signals.

[0150] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0151] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example 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 performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0152] In the embodiments provided in the present application, it should be understood that the disclosed devices / robots and methods can be implemented in other ways. For example, the device / robot embodiments described above are merely schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

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

[0154] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A method for dividing a region, characterized in that: The method comprises: Acquire spatial information, where the spatial information is obtained by the robot performing spatial scanning at its current location; Constructing a working area according to the detected area and the cleaned area corresponding to the spatial information, wherein the working area is used to represent the area that the robot needs to clean; Identify a connection area in the working area, where the connection area is used to indicate an area where the space currently located by the robot is connected with other spaces; The working area is partitioned according to at least one of the connection areas.

2. The method according to claim 1, characterized in that The identifying the connection area in the working area includes: During the robot cleaning process, spatial information around the current location is identified to obtain multiple candidate areas; A plurality of the candidate regions are screened to obtain at least one of the connection regions.

3. The method according to claim 2, characterized in that The identifying of the spatial information around the current location to obtain multiple candidate areas includes: Determining a recognition range according to the movement speed of the robot and a preset duration; Determine a space to be identified based on the identification range and the current location; The spatial information corresponding to the space to be identified is identified to obtain a plurality of candidate areas.

4. The method according to claim 2, characterized in that: The screening of the plurality of candidate regions to obtain at least one connected region comprises: According to the direction of each candidate region and the position corresponding to each candidate region, combined with the direction and the corresponding position of the determined connection region, each candidate region is screened to obtain at least one connection region; And / or, if the plurality of candidate regions are located in the same direction, and the candidate regions are adjacent to each other in the same direction, one of the plurality of candidate regions is retained to obtain at least one connected region.

5. The method according to claim 2, characterized in that: The screening of the plurality of candidate regions to obtain at least one connected region comprises: For each candidate region, compare the region length of the candidate region with the space width of the current space, and compare the space width and the space length of the current space with a preset width threshold and a preset length threshold respectively, the space width is used to represent the size of the current space corresponding to the direction where the candidate region is located, and the space length is used to represent the size of the current space corresponding to the direction perpendicular to the direction where the candidate region is located; If the region length is smaller than the space width, and the space width is larger than the preset width threshold, and the space length is larger than the preset length threshold, the candidate region is used as the connection region.

6. The method according to any one of claims 1 to 5, characterized in that: The obtaining of spatial information includes: Performing a spatial scan at the current location to obtain initial spatial information; According to the direction corresponding to the wall in the initial spatial information, the angle of the initial spatial information is adjusted to obtain first information, where the first information is the initial spatial information after the angle is adjusted; The information corresponding to the obstacle in the first information is expanded to obtain the spatial information.

7. The method according to any one of claims 1 to 5, characterized in that: The identifying the connection area in the working area includes: The connection area in the working area is periodically identified according to a preset time period or movement distance period.

8. The method according to any one of claims 1 to 5, characterized in that: Partitioning the working area according to at least one of the connection areas comprises: Setting at least one of the connection areas as a virtual obstacle area; The working area is divided into at least one sub-area according to the virtual obstacle area.

9. A robot, characterized in that: include: A memory and a processor, wherein the memory is used to store a computer program; and the processor is used to execute the method according to any one of claims 1 to 8 when calling the computer program.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.