Cleaning path planning method, cleaning robot and medium
By dividing the area to be cleaned into local areas and planning the cleaning path according to the shape, the problem of the frequent number of cleaning robots returning in the prior art is solved, and the cleaning efficiency is improved.
Patent Information
- Application Number
- CN202411036125.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-31
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-07-31
AI Technical Summary
The existing cleaning paths are too often returned by the robot during the cleaning process, resulting in low cleaning efficiency.
Reduce the number of retracements by dividing it into at least two different local areas according to multiple inflection points of the area to be cleaned and planning the cleaning path according to the shape of the local area.
It effectively reduces the number of times the cleaning robot returns when cleaning various local areas, reduces the cleaning time, and improves the cleaning efficiency.
Smart Images

Figure CN118565487B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of mobile cleaning technology, and in particular to a cleaning path planning method, a cleaning robot and a medium. Background Art
[0002] Cleaning robots usually have a zoned cleaning function. Through built-in sensors, they automatically draw a map of the area to be cleaned and then clean the area along a certain cleaning path. In the existing cleaning path, the robot turns back too many times during the cleaning process, resulting in low cleaning efficiency. Summary of the invention
[0003] In view of this, the purpose of the present invention is to overcome the deficiencies in the prior art and provide a cleaning path planning method, a cleaning robot and a medium, aiming to reduce the number of times the cleaning robot turns back and improve the cleaning efficiency of the cleaning robot. The present invention provides the following technical solutions:
[0004] In a first aspect, the present invention provides a cleaning path planning method, the method comprising:
[0005] According to multiple inflection points of the area to be cleaned, the area to be cleaned is divided into at least two different local areas; wherein two adjacent local areas have an area dividing edge at the junction, and the two ends of the area dividing edge are two non-adjacent inflection points; according to the shape of each local area, a cleaning path corresponding to each local area is planned.
[0006] In one embodiment, before dividing the area to be cleaned into at least two different local areas according to multiple inflection points of the area to be cleaned, the step also includes obtaining the edge path of the cleaning robot in the area to be cleaned, and the multiple inflection points are determined according to the edge path.
[0007] In one embodiment, one end of the area division edge is a to-be-connected inflection point among the inflection points, and the other end is a target connection inflection point among the inflection points; the distance between the to-be-connected inflection point and two adjacent inflection points corresponding to the to-be-connected inflection point is greater than the distance between the to-be-connected inflection point and the target connection inflection point; the adjacent inflection points are inflection points adjacent to the to-be-connected inflection point along the edge path.
[0008] In one embodiment, the two ends of the area dividing edge are two non-adjacent inflection points, including: if there are multiple non-adjacent inflection points of the inflection point to be connected, then the target connection inflection point is the non-adjacent inflection point closest to the inflection point to be connected; the non-adjacent inflection point is an inflection point along the edge path that is non-adjacent to the inflection point to be connected.
[0009] In one embodiment, the edge path has multiple coordinate points, each of the coordinate points has a corresponding first adjacent coordinate point and a second adjacent coordinate point, and the multiple inflection points are determined according to the edge path, including: if the angle between the direction line from the first adjacent coordinate point to the coordinate point and the direction line from the coordinate point to the second adjacent coordinate point is greater than or equal to a preset angle threshold, then the coordinate point is taken as a corner point, and the corner point that meets the preset inflection point condition is taken as an inflection point.
[0010] In one embodiment, taking the corner point that meets the preset inflection point condition as the inflection point includes: taking each corner point as the center corner point in turn, performing a deletion operation on multiple corner points within a preset range of the center corner point, and taking the center corner point that meets the preset inflection point condition as the inflection point.
[0011] In one embodiment, the central corner point that satisfies the preset inflection point condition is used as the inflection point, including: taking each of the central corner points as the current detected corner point in turn, determining the first adjacent corner point and the second adjacent corner point corresponding to the current detected corner point; connecting the current detected corner point with the first adjacent corner point to obtain a corner point line; if the distance between the second adjacent corner point and the straight line where the corner point line is located is greater than the preset point-line distance, then determining that the current detected corner point meets the preset inflection point condition; the first adjacent corner point is the inflection point or the to-be-determined corner point that is closest to the current detected corner point along the first direction of the edge path; the second adjacent corner point is the inflection point or the to-be-determined corner point that is closest to the current detected corner point along the second direction of the edge path; wherein, the first direction is opposite to the second direction, and the to-be-determined corner point is the central corner point for which it is not yet determined whether it meets the preset inflection point condition.
[0012] In one implementation, the preset angle threshold is one between 35 degrees and 45 degrees.
[0013] In one embodiment, planning a cleaning path corresponding to each of the local areas according to the shape of each of the local areas includes: determining a cleaning direction axis corresponding to each of the local areas according to the shape of each of the local areas; and planning a cleaning path corresponding to each of the local areas according to the cleaning direction axis corresponding to each of the local areas.
[0014] In one embodiment, the cleaning direction axis corresponding to each local area is determined based on the shape of each local area, including: if the shape contour of the local area is longer in the transverse direction, then the cleaning direction axis is determined to be consistent with the transverse direction; if the shape contour of the local area is longer in the longitudinal direction, then the cleaning direction axis is determined to be consistent with the longitudinal direction.
[0015] In one embodiment, the cleaning path within the local area includes multiple first cleaning paths and multiple second cleaning paths; the cleaning direction axis of the first cleaning path is consistent with the lateral direction or the longitudinal direction; two adjacent first cleaning paths are connected through one second cleaning path, or one first cleaning path located at the beginning or end of the cleaning path is connected to one second cleaning path; there is at least one inclined straight path among the multiple second cleaning paths; the angle between the inclined straight path and the first cleaning path connected to it is an acute angle or an obtuse angle.
[0016] In one embodiment, the angle between the area dividing edge and the cleaning direction axis is an acute angle or an obtuse angle.
[0017] In a second aspect, the present invention provides a cleaning robot, comprising a memory and a processor, wherein the memory stores a computer program, and when the computer program runs on the processor, the cleaning path planning method described in the first aspect is executed.
[0018] In a third aspect, the present invention provides a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, the cleaning path planning method described in the first aspect is implemented.
[0019] The cleaning path planning method, cleaning robot and medium provided by the embodiments of the present invention include: dividing the area to be cleaned into at least two different local areas according to multiple inflection points of the area to be cleaned, wherein two adjacent local areas have a region dividing edge at the junction, and the two ends of the region dividing edge are two non-adjacent inflection points; and planning the cleaning path corresponding to each local area according to the shape of each local area. The present invention plans the corresponding cleaning path according to the different shapes of the local areas, reduces the number of times the cleaning robot turns back when cleaning each local area, reduces the cleaning time, and improves the cleaning efficiency.
[0020] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and understandable, preferred embodiments are given below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0021] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments are briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without creative work.
[0022] Figure 1A schematic diagram of a process of a cleaning path planning method provided by an embodiment of the present invention is shown;
[0023] Figure 2 Another schematic diagram of the cleaning path planning method provided by an embodiment of the present invention is shown;
[0024] Figure 3 A schematic diagram showing a path along the edge of a cleaning robot provided by an embodiment of the present invention is shown;
[0025] Figure 4 A schematic diagram showing the angle between a direction line from a first adjacent coordinate point to a coordinate point and a direction line from a coordinate point to a second adjacent coordinate point provided by an embodiment of the present invention;
[0026] Figure 5 Another schematic diagram of a cleaning path planning method provided by an embodiment of the present invention is shown;
[0027] Figure 6 A schematic diagram showing multiple inflection points in an edge path provided by an embodiment of the present invention;
[0028] Figure 7 Another schematic diagram of a cleaning path planning method provided by an embodiment of the present invention is shown;
[0029] Figure 8 A schematic diagram showing multiple local areas and their corresponding cleaning paths provided by an embodiment of the present invention is shown;
[0030] Fig. 9A Another schematic diagram showing multiple local areas and their corresponding cleaning paths provided by an embodiment of the present invention;
[0031] Fig. 9B Another schematic diagram showing multiple local areas and their corresponding cleaning paths provided by an embodiment of the present invention;
[0032] Fig.10 A schematic diagram showing a cleaning path of an area to be cleaned provided by an embodiment of the present invention;
[0033] Fig.11 A schematic diagram of the structure of a cleaning path planning device provided by an embodiment of the present invention is shown;
[0034] Fig.12 A schematic structural diagram of an electronic device provided by an embodiment of the present invention is shown.
[0035] Description of main component symbols:
[0036] 1100 - cleaning path planning device; 1110 - area division module; 1120 - path planning module; 1200 - cleaning robot; 1201 - transceiver; 1202 - processor; 1203 - memory. DETAILED DESCRIPTION
[0037] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be understood as limiting the present invention.
[0038] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of the present invention, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.
[0039] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein in the specification of the template are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more of the related listed items.
[0040] Example 1
[0041] The present invention provides a cleaning path planning method. Figure 1 , the method includes steps S110~S120.
[0042] Step S110 : dividing the area to be cleaned into at least two different local areas according to a plurality of inflection points of the area to be cleaned.
[0043] In this embodiment, two adjacent local areas have an area division edge at the junction, and the two ends of the area division edge are two non-adjacent inflection points. The inflection point is a point where the cleaning robot changes the cleaning direction on the edge path, such as the corner of a room; the two non-adjacent inflection points are two non-adjacent inflection points along the contour of the area to be cleaned.
[0044] In order to accurately divide the local area in the area to be cleaned, the cleaning robot performs at least one edge operation on the area to be cleaned. During the edge operation, the coordinates of each point on the edge motion trajectory are recorded. The edge path is composed of multiple coordinate points. After screening multiple coordinate points constituting the edge path and obtaining multiple inflection points, non-adjacent inflection points that meet certain conditions among the multiple inflection points are connected to obtain at least one area division edge. The at least one area division edge divides the area to be cleaned into at least two different local areas.
[0045] In one embodiment, see Figure 2 , before step S110, it also includes: step S100, obtaining the edge path of the cleaning robot in the area to be cleaned.
[0046] Preferably, see Figure 3 , Figure 3 An example diagram of an edge path provided by an embodiment of the present invention is shown. The cleaning robot performs edge cleaning on the area to be cleaned along the edge of the area to be cleaned. During the edge cleaning process, if an obstacle is encountered, the cleaning robot will turn to avoid it. After the edge cleaning is completed, the edge path of the cleaning robot in the area to be cleaned is determined based on multiple coordinate points recorded during the edge cleaning process.
[0047] It should be noted that Figure 3 Multiple areas are shown, including area A, area B, area C, area D, area E and area F, each area represents a different room, where area A is the area to be cleaned, and the area limited by the rectangular box in the area to be cleaned is the user-defined prohibited cleaning area, that is, the area that the cleaning robot is prohibited from entering.
[0048] Furthermore, the plurality of inflection points are determined according to the edge path. Specifically, a plurality of coordinate points on the edge path that meet certain conditions are determined as corner points, and among the plurality of corner points selected, a corner point that meets certain conditions is determined as an inflection point.
[0049] In one embodiment, the edge path has multiple coordinate points, each of the coordinate points has a corresponding first adjacent coordinate point and a second adjacent coordinate point, and the multiple inflection points are determined according to the edge path, including: if the angle between the direction line from the first adjacent coordinate point to the coordinate point and the direction line from the coordinate point to the second adjacent coordinate point is greater than or equal to a preset angle threshold, then the coordinate point is taken as a corner point, and the corner point that meets the preset inflection point condition is taken as an inflection point.
[0050] It should be noted that the direction line from the first adjacent coordinate point to the coordinate point is directed from the first adjacent coordinate point to the coordinate point, and the direction line from the coordinate point to the second adjacent coordinate point is directed from the coordinate point to the second adjacent coordinate point. The angle between the two direction lines represents the turning angle of the cleaning robot at the coordinate point.
[0051] Preferably, a coordinate point on the edge path has an adjacent coordinate point in the clockwise direction and the counterclockwise direction of the edge path, namely, a first adjacent coordinate point and a second adjacent coordinate point. For each coordinate point on the edge path, it is determined whether the turning angle of the cleaning robot at the coordinate point is greater than or equal to a preset angle threshold. If it is satisfied, the corresponding coordinate point is determined as a corner point. Specifically, it can be determined based on the angle between the direction line from the first adjacent coordinate point to the coordinate point and the direction line from the coordinate point to the second adjacent coordinate point. For example, see Figure 4 , Figure 4 Coordinate point 1 is the first adjacent coordinate point of coordinate point 2 in the counterclockwise direction, and coordinate point 3 is the second adjacent coordinate point of coordinate point 2 in the clockwise direction. The direction line from the first adjacent coordinate point to the coordinate point is from coordinate point 1 to coordinate point 2, and the direction line from the coordinate point to the second adjacent coordinate point is from coordinate point 2 to coordinate point 3. The angle between the direction line from coordinate point 1 to coordinate point 2 and the direction line from coordinate point 2 to coordinate point 3 is θ, that is, the turning angle of the cleaning robot at coordinate point 2 is θ. If the angle θ is greater than or equal to the preset angle threshold, coordinate point 2 can be determined as a corner point. After determining multiple corner points from multiple coordinate points, further determine whether each corner point meets the preset turning point condition, and then select multiple turning points from multiple corner points.
[0052] Preferably, the preset angle threshold is one between 35 degrees and 45 degrees.
[0053] In this embodiment, the coordinate point with a larger angle and a line between the coordinate points that is close to vertical may be the place where the cleaning robot changes direction in the edge path. If the angle is smaller, the coordinate point and its first adjacent coordinate point and the second adjacent coordinate point are likely to be in the same direction of the edge path. Therefore, by comparing the size of the angle between the direction line from the first adjacent coordinate point to the coordinate point and the direction line from the coordinate point to the second adjacent coordinate point, an accurate preliminary screening of the turning points can be performed.
[0054] In one embodiment, taking the corner point that meets the preset inflection point condition as the inflection point includes: taking each corner point as the center corner point in turn, performing a deletion operation on multiple corner points within a preset range of the center corner point, and taking the center corner point that meets the preset inflection point condition as the inflection point.
[0055] Preferably, to facilitate subsequent data processing, for multiple corner points with similar positions, one of them is selected and retained. Specifically, one corner point is selected as the central corner point, and the remaining corner points within the preset range of the central corner point are deleted. Another central corner point is selected from the remaining multiple corner points, and the operation is repeated in sequence, and then it is further determined whether each central corner point meets the preset inflection point condition, and then multiple inflection points are selected from the multiple central corner points. The preset range can be set based on experience. Optionally, the preset range is a square area with a side length of 8 cm to 12 cm centered on the central corner point, or a circular area with a diameter of 8 cm to 12 cm.
[0056] In one embodiment, see Figure 5 , taking the central corner point that meets the preset inflection point condition as the inflection point includes steps S501 to S503.
[0057] Step S501, taking each of the central corner points as a current detection corner point in turn, determining a first adjacent corner point and a second adjacent corner point corresponding to the current detection corner point.
[0058] Preferably, the first adjacent corner point is the inflection point or the to-be-determined corner point that is closest to the currently detected corner point along the first direction of the edge path; the second adjacent corner point is the inflection point or the to-be-determined corner point that is closest to the currently detected corner point along the second direction of the edge path; wherein the first direction is opposite to the second direction. The to-be-determined corner point is the central corner point for which it is not determined whether it meets the preset inflection point condition.
[0059] Optionally, if the first direction is a clockwise direction along the edge path, the second direction is a counterclockwise direction along the edge path; if the first direction is a counterclockwise direction along the edge path, the second direction is a clockwise direction along the edge path.
[0060] Step S502: Connect the currently detected corner point with the first adjacent corner point to obtain a corner point line.
[0061] Further, the distance from the second adjacent corner point to the corner point connection line is compared with the preset point-line distance to determine whether the currently detected corner point meets the preset inflection point condition, wherein the second adjacent corner point refers to the central corner point that is closest to the currently detected corner point along the second direction of the edge path and has not yet been determined to be an inflection point. The preset point-line distance is set based on experience. Optionally, the preset point-line distance is a distance of 1 to 3 cells on the grid map of the cleaning robot.
[0062] Step S503: If the distance between the second adjacent corner point and the straight line where the corner point connection line is located is greater than a preset point-line distance, it is determined that the currently detected corner point meets a preset inflection point condition.
[0063] Specifically, the distance between the second adjacent corner point and the straight line on which the corner point connection line lies is a vertical distance.
[0064] Exemplarily, initially three adjacent central corner points X1, X2, and X3 are selected in sequence, X2 is used as the current detection corner point, X1 is the corner point to be determined that is closest to X2 in the clockwise direction along the edge path, that is, the first adjacent corner point of X2, X3 is the corner point to be determined that is closest to X2 in the counterclockwise direction along the edge path, that is, the second adjacent corner point of X2, X2 is connected to X1 to obtain a corner point line, and the distance d from X3 to the corner point line formed by X1 and X2 is determined;
[0065] If d is less than or equal to the preset point-line distance, it is determined that X2 does not meet the preset inflection point condition. At this time, the next central corner point X4 adjacent to X3 is introduced, and X3 is used as the current detection corner point. X1 is the corner point to be determined that is closest to X3 in the clockwise direction along the edge path, that is, the first adjacent corner point of X3. X4 is the corner point to be determined that is closest to X3 in the counterclockwise direction along the edge path, that is, the second adjacent corner point of X3. X1 and X3 are connected to obtain a corner point line, and then it is determined whether the distance from X4 to the corner point line formed by X1 and X3 is greater than the preset point-line distance, and the selection is carried out in sequence;
[0066] If d is greater than the preset point-line distance, then X2 is determined to meet the preset inflection point condition, and the central corner point X2 is determined as the inflection point X2. The next central corner point X4 adjacent to the central corner point X3 is introduced, and X3 is used as the current detected corner point. X2 is the inflection point closest to X3 in the clockwise direction along the edge path, that is, the first adjacent corner point of X3. X4 is the undetermined corner point closest to X3 in the counterclockwise direction along the edge path, that is, the second adjacent corner point of X3. X2 and X3 are connected to obtain the corner point line, and it is determined whether the distance from X4 to the corner point line formed by X2 and X3 is greater than the preset point-line distance. The points are screened in turn. When there are no undetermined corner points, all inflection points are determined.
[0067] In this embodiment, by judging that the distance between the second adjacent corner point and the straight line connecting the corner points is greater than the preset point-line distance, it is determined that the currently detected corner point meets the preset inflection point condition. Corner points with a close straight line distance to the currently detected corner point can be filtered out, so that the inflection point can be determined more accurately.
[0068] In one embodiment, one end of the area division edge is a to-be-connected inflection point among the inflection points, and the other end is a target connection inflection point among the inflection points; the distance between the to-be-connected inflection point and two adjacent inflection points corresponding to the to-be-connected inflection point is greater than the distance between the to-be-connected inflection point and the target connection inflection point; the adjacent inflection points are inflection points adjacent to the to-be-connected inflection point along the edge path.
[0069] Preferably, each turning point in the clockwise or counterclockwise direction along the edge path is taken as the turning point to be connected, and the distances L1 and L2 between the turning point to be connected and the two adjacent turning points are determined respectively. The distance L corresponding to each non-adjacent turning point is compared with the distances L1 and L2 in turn, and the non-adjacent turning point whose corresponding distance L is less than or equal to the distance L1 and less than or equal to the distance L2 among multiple non-adjacent turning points is determined as the initial target connection turning point; if there is no non-adjacent turning point that meets the conditions, the next turning point is taken as the turning point to be connected, and the target connection turning point is further determined; if there is only one initial target connection turning point, the initial target connection turning point is determined as the target connection turning point, and the turning point to be connected is connected with the target connection turning point as the area division edge.
[0070] It should be noted that the two non-adjacent inflection points that have been used as the two ends of the region division edge will no longer be used as the inflection points to be connected and the target connection inflection points in the future.
[0071] For example, see Figure 6 , Figure 6 , multiple inflection points in the edge path are shown in FIG. 1 , where if inflection point 1 is the inflection point to be connected, inflection point 2 and inflection point 8 are adjacent inflection points of inflection point 1 in the counterclockwise direction and clockwise direction along the edge path, respectively. Inflection point 3, inflection point 4, inflection point 5, inflection point 6 and inflection point 7 are all non-adjacent inflection points of inflection point 1. The distance L1 between inflection point 1 and inflection point 2 and the distance L2 between inflection point 1 and inflection point 8 are determined. The distances L between inflection point 3, inflection point 4, inflection point 5, inflection point 6 and inflection point 7 and inflection point 1 are determined respectively. The distances L corresponding to inflection point 3, inflection point 4, inflection point 5, inflection point 6 and inflection point 7 are compared with the distances L1 and L2 respectively, and it is determined that the distance L corresponding to inflection point 4 is less than L1 and less than L2. Therefore, inflection point 4 is determined as the initial target connection inflection point. Since only the distance L corresponding to inflection point 4 is less than L1 and less than L2, inflection point 4 is the target connection inflection point of inflection point 1, and inflection point 1 and inflection point 4 are connected as the area division edge.
[0072] Furthermore, inflection point 5 is taken as the inflection point to be connected, and the target connection inflection point of inflection point 5 is selected from inflection point 2, inflection point 3, inflection point 7 and inflection point 8 for connection. In this way, each inflection point is taken as the inflection point to be connected in turn. When there is no new inflection point to be connected or target connection inflection point, the division of the local area in the area to be cleaned is completed.
[0073] In this embodiment, by judging whether the distance between the inflection point to be connected and the two adjacent inflection points corresponding to the inflection point to be connected is greater than the distance between the inflection point to be connected and its non-adjacent inflection point, the target connection inflection point is screened out, so that the division of the local area in the area to be cleaned can be more reasonable, and the local area will not be divided to be too small.
[0074] In one embodiment, the two ends of the area dividing edge are two non-adjacent inflection points, including: if there are multiple non-adjacent inflection points of the inflection point to be connected, then the target connection inflection point is the non-adjacent inflection point closest to the inflection point to be connected; the non-adjacent inflection point is an inflection point along the edge path that is non-adjacent to the inflection point to be connected.
[0075] Preferably, if there are multiple non-adjacent inflection points that satisfy the following condition: the distance between the inflection point to be connected and the corresponding two adjacent inflection points is greater than the distance between the inflection point to be connected and the non-adjacent inflection points, the multiple non-adjacent inflection points that satisfy this condition are used as initial target connection inflection points, and the initial target connection inflection point closest to the inflection point to be connected is selected as the target connection inflection point.
[0076] In this embodiment, by selecting the nearest non-adjacent inflection point as the target connection inflection point of the inflection point to be connected, the narrow area in the area to be cleaned can be divided into local areas. The narrow area can be the narrow space separated by furniture in the home environment. If the cleaning robot cleans the area to be cleaned in a fixed cleaning direction, the cleaning robot may turn back too much when cleaning in the narrow area, resulting in low cleaning efficiency. Therefore, the narrow area in the area to be cleaned is divided into local areas to perform path planning for the narrow area, which can improve the cleaning efficiency.
[0077] Step S120 , planning a cleaning path corresponding to each of the local areas according to the shape of each of the local areas.
[0078] In this embodiment, since the shapes of each local area are different, in order to ensure the cleaning efficiency of the cleaning robot, it is necessary to plan a corresponding cleaning path according to the shape of each local area, so that the cleaning robot can clean according to the corresponding cleaning path in each local area, thereby improving the cleaning efficiency of the cleaning robot.
[0079] In one embodiment, see Figure 7 , step S120 includes steps S121~S122.
[0080] Step S121 : determining the cleaning direction axis corresponding to each of the local areas according to the shape of each of the local areas.
[0081] Preferably, by comparing the lengths of the sides of the local area, the cleaning direction axis is consistent with the direction of the longest side of the local area, wherein the direction of the longest side can be horizontal, vertical or oblique, and the oblique direction refers to a direction at a certain angle to the horizontal axis.
[0082] It should be noted that each cleaning path obtained according to the cleaning direction axis planning is parallel to the cleaning direction. If the cleaning direction axis is consistent with the longest side direction of the local area, it can be ensured that the straight line area covered by the cleaning robot in a single time is the largest, thereby reducing the number of times the cleaning robot turns back and reducing the cleaning time of the cleaning robot to clean the area.
[0083] In another embodiment, the cleaning direction axis is consistent with the direction of the shortest side of the local area. If the cleaning direction axis is consistent with the direction of the shortest side of the local area, the number of times the cleaning robot turns back will increase, which can improve the cleaning effect on corners and edges and clean more thoroughly.
[0084] In one embodiment, step S121 includes: if the shape contour of the local area is longer in the transverse direction, determining that the cleaning direction axis is consistent with the transverse direction.
[0085] Preferably, see Figure 8 , Figure 8 Multiple local areas and their corresponding cleaning paths are shown, where the dotted lines represent the dividing edges of two adjacent local areas. It can be understood that the local area surrounded by inflection point 1, inflection point 4, inflection point 5 and inflection point 8 has a contour shape that is longer in the horizontal axis direction, so its corresponding cleaning direction axis is consistent with the horizontal axis direction. Specifically, the cleaning direction axis can point from inflection point 1 to inflection point 8, or from inflection point 8 to inflection point 1.
[0086] In one embodiment, step S121 includes: if the shape contour of the local area is longer in the longitudinal direction, determining that the cleaning direction axis is consistent with the longitudinal direction.
[0087] Further, please see again Figure 8 The local area surrounded by inflection points 1, 2, 3, and 4 has a shape contour that is longer in the longitudinal direction, so its corresponding cleaning direction axis is consistent with the longitudinal direction. Specifically, the cleaning direction axis can point from inflection point 1 to inflection point 2, or from inflection point 2 to inflection point 1.
[0088] If the shape contour of the local area is longer in a certain oblique direction, it is determined that the cleaning direction axis of the local area is consistent with the oblique direction. Specifically, in view of the above description of the transverse direction and the longitudinal direction, the oblique direction will not be described in detail here.
[0089] Step S122 , planning a cleaning path corresponding to each of the local areas according to the cleaning direction axis corresponding to each of the local areas.
[0090] Furthermore, the cleaning path corresponding to each local area includes a plurality of first cleaning paths, each first cleaning path is parallel to the cleaning direction axis, and the directions of two adjacent first cleaning paths are opposite.
[0091] In one embodiment, the cleaning path within the local area includes multiple first cleaning paths and multiple second cleaning paths; the cleaning direction axis of the first cleaning path is consistent with the lateral direction or the longitudinal direction; two adjacent first cleaning paths are connected through one second cleaning path, or one first cleaning path located at the beginning or end of the cleaning path is connected to one second cleaning path; there is at least one inclined straight path among the multiple second cleaning paths; the angle between the inclined straight path and the first cleaning path connected to it is an acute angle or an obtuse angle.
[0092] Preferably, see Fig. 9A , Fig. 9A An example diagram of the first cleaning path and the second cleaning path is shown. The first cleaning path and the second cleaning path are linear paths. When the cleaning robot moves along the first cleaning path to an infinitely close edge of the area division, it can be determined that the cleaning robot has completed cleaning along the first cleaning path, and the cleaning robot begins to transition to the next first cleaning path along the second cleaning path, wherein the second cleaning path is perpendicular to the first cleaning path connected thereto, or intersects with it, and the angle of intersection is an acute angle or an obtuse angle.
[0093] In another embodiment, the second cleaning path may also be an arc-shaped path, see Fig. 9B , Fig. 9B Another example diagram of the first cleaning path and the second cleaning path is shown. When the second cleaning path is an arc-shaped path, the two first cleaning paths connected to the second cleaning path form two intersections, and the line between the two intersections is perpendicular to the two first cleaning paths connected to the second cleaning path.
[0094] For example, see Fig.10 , Fig.10 An example diagram of a cleaning path planned according to an embodiment of the present application is shown, where two adjacent first cleaning paths are connected via a second cleaning path A, or a first cleaning path located at the head end of the cleaning path is connected to a second cleaning path B.
[0095] If the cleaning robot completes cleaning along the first cleaning path and is infinitely close to the edge of the area dividing path, at this time, if it follows the straight second cleaning path that is connected to it and is perpendicular to the first cleaning path, or turns and transitions to the next first cleaning path along the arc-shaped second cleaning path connected to it, the cleaning robot may exceed the current local area. To avoid the cleaning robot exceeding the current area, when the cleaning robot approaches the edge of the area dividing path and transitions from the current first cleaning path to the next cleaning path via the second cleaning path, the corresponding second cleaning path is parallel to the edge of the area dividing path, that is, the angle between the first cleaning path connected to it is an acute angle or an obtuse angle.
[0096] If the cleaning robot cleans along the first cleaning path and is infinitely close to the edge of the local area, and the edge of the local area is not an area dividing edge, or the area dividing edge is perpendicular to the first cleaning path, when transitioning from the current first cleaning path to the next cleaning path via the second cleaning path, the corresponding second cleaning path is perpendicular to the first cleaning path connected to it.
[0097] In this embodiment, since the area dividing edge is a virtual edge, the cleaning robot cannot clean along the area dividing edge. Therefore, when the cleaning robot moves along the first cleaning path to be infinitely close to the area dividing edge, the corresponding second cleaning path is parallel to the area dividing edge, which can improve the cleaning effect of the area dividing edge and prevent the area dividing edge from being missed.
[0098] In one embodiment, the angle between the area dividing edge and the cleaning direction axis is an acute angle or an obtuse angle.
[0099] Preferably, the angle between the area dividing edge and the cleaning direction axis is an acute angle or an obtuse angle, such as 30 degrees, 40 degrees, 110 degrees or 125 degrees.
[0100] The embodiment of the present invention provides a cleaning path planning method, which divides the area to be cleaned into at least two different local areas according to multiple inflection points of the area to be cleaned, wherein two adjacent local areas have a region dividing edge at the junction, and the two ends of the region dividing edge are two non-adjacent inflection points; and according to the shape of each local area, a cleaning path corresponding to each local area is planned. The present invention plans corresponding cleaning paths according to different shapes of local areas, reduces the number of times the cleaning robot turns back when cleaning each local area, reduces the cleaning time, and improves the cleaning efficiency.
[0101] See also Fig.10 , Fig.10 An example diagram of the cleaning paths planned according to the embodiment of the present application is shown. According to experimental data, for area A, the same 7 square meters of area to be cleaned, there are 22 cleaning paths planned according to the present application, and the cleaning robot takes 6 minutes to complete the cleaning. However, there are 33 cleaning paths planned according to the prior art, and the cleaning robot takes 7 minutes to complete the cleaning.
[0102] Example 2
[0103] The present invention provides a cleaning path planning device, see Fig.11 , see Fig.11 , the cleaning path planning device 1100 includes:
[0104] The area division module 1110 is used to divide the area to be cleaned into at least two different local areas according to multiple inflection points of the area to be cleaned; wherein two adjacent local areas have an area division edge at the junction, and the two ends of the area division edge are two non-adjacent inflection points.
[0105] The path planning module 1120 is used to plan a cleaning path corresponding to each of the local areas according to the shape of each of the local areas.
[0106] In one embodiment, the cleaning path planning device 1100 further includes an inflection point determination module for obtaining an edge path of the cleaning robot in the area to be cleaned, and the multiple inflection points are determined according to the edge path.
[0107] In one embodiment, one end of the area division edge is a to-be-connected inflection point among the inflection points, and the other end is a target connection inflection point among the inflection points; the distance between the to-be-connected inflection point and two adjacent inflection points corresponding to the to-be-connected inflection point is greater than the distance between the to-be-connected inflection point and the target connection inflection point; the adjacent inflection points are inflection points adjacent to the to-be-connected inflection point along the edge path.
[0108] In one embodiment, if there are multiple non-adjacent inflection points of the inflection point to be connected, the target connection inflection point is the non-adjacent inflection point closest to the inflection point to be connected; the non-adjacent inflection point is an inflection point along the edge path that is non-adjacent to the inflection point to be connected.
[0109] In one embodiment, there are multiple coordinate points in the edge path, each of the coordinate points has a corresponding first adjacent coordinate point and a second adjacent coordinate point, and the inflection point determination module is also used to take the coordinate point as a corner point if the angle between the direction line from the first adjacent coordinate point to the coordinate point and the direction line from the coordinate point to the second adjacent coordinate point is greater than or equal to a preset angle threshold, and take the corner point that meets the preset inflection point condition as an inflection point.
[0110] In one embodiment, the inflection point determination module is further used to sequentially use each of the corner points as the central corner point, perform a deletion operation on multiple corner points within a preset range of the central corner point, and use the central corner point that meets the preset inflection point condition as the inflection point.
[0111] In one embodiment, the inflection point determination module is also used to take each of the central corner points as the current detected corner point in turn, determine the first adjacent corner point and the second adjacent corner point corresponding to the current detected corner point; connect the current detected corner point with the first adjacent corner point to obtain a corner point line; if the distance between the second adjacent corner point and the straight line where the corner point line is located is greater than a preset point-line distance, then it is determined that the current detected corner point meets the preset inflection point condition; the first adjacent corner point is the inflection point or the to-be-determined corner point that is closest to the current detected corner point along the first direction of the edge path; the second adjacent corner point is the inflection point or the to-be-determined corner point that is closest to the current detected corner point along the second direction of the edge path; wherein, the first direction is opposite to the second direction, and the to-be-determined corner point is the corner point for which it is not yet determined whether it meets the preset inflection point condition.
[0112] In one implementation, the preset angle threshold is one between 35 degrees and 45 degrees.
[0113] In one embodiment, the path planning module 1120 is further used to determine the cleaning direction axis corresponding to each of the local areas according to the shapes of each of the local areas; and plan the cleaning path corresponding to each of the local areas according to the cleaning direction axis corresponding to each of the local areas.
[0114] In one embodiment, the path planning module 1120 is also used to determine that the cleaning direction axis is consistent with the transverse direction if the shape contour of the local area is longer in the transverse direction; if the shape contour of the local area is longer in the longitudinal direction, then determine that the cleaning direction axis is consistent with the longitudinal direction.
[0115] In one embodiment, the cleaning path within the local area includes multiple first cleaning paths and multiple second cleaning paths; the cleaning direction axis of the first cleaning path is consistent with the lateral direction or the longitudinal direction; two adjacent first cleaning paths are connected through one second cleaning path, or one first cleaning path located at the beginning or end of the cleaning path is connected to one second cleaning path; there is at least one inclined straight path among the multiple second cleaning paths; the angle between the inclined straight path and the first cleaning path connected to it is an acute angle or an obtuse angle.
[0116] In one embodiment, the angle between the area dividing edge and the cleaning direction axis is an acute angle or an obtuse angle.
[0117] The cleaning path planning device 1100 provided in the embodiment of the present invention can execute the cleaning path planning method provided in the above method embodiment 1, which will not be described again here to avoid repetition.
[0118] The embodiment of the present invention provides a cleaning path planning device, which divides the area to be cleaned into at least two different local areas according to multiple inflection points of the area to be cleaned through an area division module, and two adjacent local areas have an area division edge at the junction, and the two ends of the area division edge are two non-adjacent inflection points; the path planning module plans the cleaning path corresponding to each local area according to the shape of each local area. The present invention plans the corresponding cleaning path according to different local area shapes, reduces the number of times the cleaning robot turns back when cleaning a part of the area to be cleaned, reduces the cleaning time, and improves the cleaning efficiency.
[0119] Example 3
[0120] In addition, an embodiment of the present invention provides a cleaning robot, including a memory and a processor, wherein the memory stores a computer program, and when the computer program runs on the processor, the cleaning path planning method provided in Example 1 is executed.
[0121] For details, see Fig.12 The cleaning robot 1200 includes: a transceiver 1201, a bus interface and a processor 1202, wherein the processor 1202 is used to divide the area to be cleaned into at least two different local areas according to multiple inflection points of the area to be cleaned, and two adjacent local areas have an area dividing edge at the junction, and the two ends of the area dividing edge are two non-adjacent inflection points; according to the shape of each local area, a cleaning path corresponding to each local area is planned.
[0122] In the embodiment of the present invention, the cleaning robot 1200 further includes a memory 1203. Fig.12 In the embodiment, the bus architecture may include any number of interconnected buses and bridges, specifically linking together various circuits of one or more processors represented by processor 1202 and memory represented by memory 1203. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface. The transceiver 1201 may be a plurality of components, namely, a transmitter and a receiver, providing a unit for communicating with various other devices on a transmission medium. The processor 1202 is responsible for managing the bus architecture and general processing, and the memory 1203 may store data used by the processor 1202 when performing operations.
[0123] The cleaning robot 1200 provided in the embodiment of the present invention can execute the cleaning path planning method provided in the above method embodiment 1, which will not be described again here to avoid repetition.
[0124] Example 4
[0125] In addition, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the cleaning path planning method provided in Example 1 is implemented.
[0126] In this embodiment, the computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.
[0127] The computer-readable storage medium provided in this embodiment can implement the cleaning path planning method provided in Example 1, and will not be described again here to avoid repetition.
[0128] In all examples shown and described herein, any specific values should be interpreted as merely exemplary and not as limiting, and thus other examples of the exemplary embodiments may have different values.
[0129] It should be noted that similar reference numerals and letters denote similar items in the following drawings, and therefore, once an item is defined in one drawing, further definition and explanation thereof is not required in subsequent drawings.
[0130] The above-mentioned embodiments only express several implementation methods of the present invention, and the description thereof is relatively specific and detailed, but it cannot be understood as limiting the scope of the present invention. It should be pointed out that for ordinary technicians in this field, several modifications and improvements can be made without departing from the concept of the present invention, which all belong to the protection scope of the present invention.
Claims
1. A cleaning path planning method, characterized in that: The method comprises: The cleaning robot performs edge cleaning on the area to be cleaned along the edge of the area to be cleaned to obtain an edge path of the cleaning robot in the area to be cleaned, and determines a plurality of inflection points according to the edge path; According to the plurality of inflection points on the path along the edge of the area to be cleaned, the area to be cleaned is divided into at least two different local areas; wherein two adjacent local areas have a region dividing edge at the junction, and the two ends of the region dividing edge are two non-adjacent inflection points; Determining the cleaning direction axis corresponding to each of the local areas according to the shape of each of the local areas; If the shape profile of the local area is longer in the transverse direction, determining that the cleaning direction axis is consistent with the transverse direction; If the shape profile of the local area is longer in the longitudinal direction, determining that the cleaning direction axis is consistent with the longitudinal direction; The cleaning paths within the local area include a plurality of first cleaning paths and a plurality of second cleaning paths; the cleaning direction axis of the first cleaning paths is consistent with the transverse direction or the longitudinal direction; Two adjacent first cleaning paths are connected through one second cleaning path, or one first cleaning path located at the beginning or end of the cleaning path is connected with one second cleaning path; Among the plurality of the second cleaning paths, there is at least one inclined straight path.
2. The cleaning path planning method according to claim 1, characterized in that: One end of the area division edge is a to-be-connected inflection point among the inflection points, and the other end is a target connection inflection point among the inflection points; the distance between the to-be-connected inflection point and two adjacent inflection points corresponding to the to-be-connected inflection point is greater than the distance between the to-be-connected inflection point and the target connection inflection point; the adjacent inflection points are inflection points adjacent to the to-be-connected inflection point along the edge path.
3. The cleaning path planning method according to claim 2, characterized in that: The two ends of the area division edge are two non-adjacent inflection points, including: If there are multiple non-adjacent inflection points of the inflection point to be connected, the target connection inflection point is the non-adjacent inflection point closest to the inflection point to be connected; the non-adjacent inflection point is an inflection point along the edge path that is non-adjacent to the inflection point to be connected.
4. The cleaning path planning method according to claim 1, characterized in that: The edge path has a plurality of coordinate points, each of the coordinate points has a corresponding first adjacent coordinate point and a second adjacent coordinate point, and the plurality of inflection points are determined according to the edge path, including: If the angle between the direction line from the first adjacent coordinate point to the coordinate point and the direction line from the coordinate point to the second adjacent coordinate point is greater than or equal to a preset angle threshold, the coordinate point is taken as a corner point, and the corner point that meets the preset inflection point condition is taken as an inflection point.
5. The cleaning path planning method according to claim 4, characterized in that: The step of taking the corner point that satisfies the preset inflection point condition as the inflection point comprises: Taking each of the corner points as the central corner point in turn, a deletion operation is performed on a plurality of the corner points within a preset range of the central corner point, and the central corner point that meets the preset inflection point condition is taken as the inflection point.
6. The cleaning path planning method according to claim 5, characterized in that: The taking the central corner point that meets the preset inflection point condition as the inflection point comprises: Taking each of the central corner points as a current detection corner point in turn, determining a first adjacent corner point and a second adjacent corner point corresponding to the current detection corner point; Connecting the currently detected corner point with the first adjacent corner point to obtain a corner point line; If the distance between the second adjacent corner point and the straight line where the corner point connection line is located is greater than a preset point-line distance, it is determined that the currently detected corner point meets the preset inflection point condition; The first adjacent corner point is the turning point or the to-be-determined corner point that is closest to the currently detected corner point along the first direction of the edge path; the second adjacent corner point is the turning point or the to-be-determined corner point that is closest to the currently detected corner point along the second direction of the edge path; wherein the first direction is opposite to the second direction, and the to-be-determined corner point is the central corner point for which it is not yet determined whether it meets the preset turning point condition.
7. The cleaning path planning method according to claim 4, characterized in that: The preset angle threshold is one between 35 degrees and 45 degrees.
8. The cleaning path planning method according to any one of claims 1 to 7, characterized in that: The angle between the inclined straight path and the first cleaning path connected thereto is an acute angle or an obtuse angle; Specifically, when the cleaning robot approaches the area dividing edge and transitions from the current first cleaning path to the next cleaning path via the second cleaning path, the angle between the corresponding second cleaning path and the first cleaning path connected thereto is an acute angle or an obtuse angle.
9. The cleaning path planning method according to claim 1, characterized in that: The angle between the area dividing edge and the cleaning direction axis is an acute angle or an obtuse angle.
10. A cleaning robot, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program, and when the computer program is run on the processor, the cleaning path planning method according to any one of claims 1 to 9 is executed.
11. 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 cleaning path planning method according to any one of claims 1 to 9 is implemented.
