Path planning method and device, self-moving cleaning equipment and readable storage medium

By updating and weighting the driving duration of the historical driving path, combining semantic maps and driving speed, the problem of inaccurate estimated duration when planning the path is solved, and more accurate path screening and cleaning effects are achieved.

CN118938889APending Publication Date: 2024-11-12MIDEA ROBOZONE TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310519353.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-10
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

When planning the cleaning path, existing cleaning robots find it difficult to accurately estimate the driving time, resulting in the inability to effectively select paths that meet user needs.

Method used

By obtaining the driving duration of the historical driving path, updating the estimated driving duration, filtering the target path based on the updated duration, combining parameters such as semantic map and driving speed, dividing the path into straight, steering and navigation paths, and weighted calculations are performed to improve the pre-predictions Estimate the accuracy of the duration.

Benefits of technology

Improve the accuracy of path planning and automatic screening efficiency to ensure that cleaning equipment is cleaned according to the actual needs of users.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118938889A_ABST
    Figure CN118938889A_ABST
Patent Text Reader

Abstract

The invention provides a path planning method and device, self-moving cleaning equipment and a readable storage medium, the path planning method is executed by the self-moving cleaning equipment, and the path planning method comprises the following steps: under the condition that at least two planned driving paths are obtained, determining the driving path of the self-moving cleaning equipment; determining an estimated driving duration corresponding to each planned driving path in the at least two planned driving paths; updating at least one of the at least two estimated driving durations according to the historical driving duration of the historical driving path; and screening a target path of the at least two planned driving paths according to the updated at least two estimated driving durations.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of self-moving cleaning equipment, and in particular to a path planning method, device, self-moving cleaning equipment and a readable storage medium. Background Art

[0002] With the development of intelligent cleaning technology, cleaning robots are entering more and more households, greatly reducing the labor of house cleaning.

[0003] In the related art, before a cleaning robot starts cleaning a house, it can automatically plan multiple different driving routes, estimate the cleaning time corresponding to the planned driving routes, and select a driving route to perform the cleaning operation. The cleaning robot can only estimate the cleaning time based on pre-stored internal parameters, which is difficult to ensure accuracy, resulting in the cleaning robot being unable to accurately select a driving route that meets user needs for cleaning. Summary of the invention

[0004] The present application aims to solve one of the technical problems existing in the prior art or related technology.

[0005] To this end, the first aspect of the present application proposes a path planning method.

[0006] A second aspect of the present application provides a path planning device.

[0007] A third aspect of the present application provides a path planning device.

[0008] A fourth aspect of the present application proposes a computer program product.

[0009] A fifth aspect of the present application provides a readable storage medium.

[0010] A sixth aspect of the present application proposes a self-moving cleaning device.

[0011] In view of this, according to the first aspect of the present application, a path planning method is proposed, which is executed by a self-moving cleaning device. The path planning method includes: when at least two planned driving paths are obtained, determining the estimated driving time corresponding to each of the at least two planned driving paths; updating at least one of the at least two estimated driving times based on the historical driving time of the historical driving paths; and screening the target path of the at least two planned driving paths based on the updated at least two estimated driving times.

[0012] The technical solution of the present application proposes a path planning method for obtaining the estimated driving times corresponding to the multiple planned driving paths when the self-mobile cleaning device plans multiple planned driving paths. At least one of the multiple estimated driving times is updated by the historical driving time corresponding to the historical driving path, ensuring that the updated multiple estimated driving times are more consistent with the actual driving conditions of the self-mobile cleaning device, thereby improving the accuracy of the updated estimated driving times. The target paths among the multiple planned driving paths are screened by the updated multiple estimated driving times, and the accuracy of the screened target paths is further guaranteed while achieving the automatic screening of the target paths with higher efficiency.

[0013] In this technical solution, the planned driving path is the planned driving path obtained by the self-mobile cleaning device according to the semantic map. The self-mobile cleaning device can plan multiple planned driving paths according to the semantic map. The self-mobile cleaning device has different driving times for cleaning the house along different planned driving paths. The historical driving path is the path that the self-mobile cleaning device has traveled during the historical cleaning. The self-mobile cleaning device records the corresponding driving time during the historical cleaning process and stores it in association with the historical driving record. It finds the planned driving path that matches the historical driving path among the multiple planned driving paths, and updates the estimated driving time corresponding to the planned driving path according to the historical driving time.

[0014] In this technical solution, the number of historical driving paths is at least one. When the number of historical driving paths is multiple, different historical driving paths may match planned driving paths obtained from different plans, and different historical driving paths may also match planned driving paths obtained from the same plan.

[0015] In this technical solution, after determining the updated estimated driving time, the self-propelled cleaning device can filter the target path according to the updated estimated driving time. The specific filtering rules can be set according to the actual needs of the user.

[0016] In this technical solution, since the driving speed of the self-moving cleaning device and the distance of the planned driving path are known, the self-moving cleaning device can accurately estimate the driving time according to the driving speed and distance. Specifically, when the self-moving cleaning device travels along different planned driving paths, the shape of the driving track is different, and different shapes of driving tracks correspond to different driving speeds.

[0017] In the technical solution of the present application, when the self-mobile cleaning device plans multiple planned driving routes, the self-mobile cleaning device can estimate the estimated driving time of each planned driving route according to the operating parameters of the self-mobile cleaning device, and then update the multiple estimated driving times according to the historical driving times corresponding to the historical driving routes, to ensure that the updated estimated driving time is closer to the time required for the actual driving of the self-mobile cleaning device, further improve the accuracy of the target path selected by the self-mobile cleaning device according to the updated estimated driving time, and better meet the actual needs of users.

[0018] In the above technical solution, at least one of at least two estimated driving times is updated according to the historical driving time of the historical driving path, including: according to the historical driving path, screening matching paths in at least two planned driving paths, and matching the matching paths with the historical driving paths; according to the historical driving time, performing weighted calculation on the estimated driving time corresponding to the matching path to update the estimated driving time corresponding to the matching path.

[0019] This technical solution proposes a solution for updating the estimated driving duration corresponding to the matching paths among multiple planned driving paths through historical driving paths.

[0020] In the technical solution of the present application, all historical driving paths in the historical driving records are extracted, and matching paths in multiple planned driving paths are searched according to each historical driving path. Among them, multiple matching paths can be found according to a certain historical driving path, and a certain historical driving path may not find a corresponding matching path.

[0021] In the technical solution of the present application, after screening out a matching path corresponding to a historical driving path, the estimated driving time of the matching path and the historical driving time of the historical driving path are weighted and calculated, and the weighted calculated time is used as the updated estimated driving time.

[0022] In the technical solution of the present application, the estimated driving time of the matching path and the historical driving time of the corresponding historical driving path are weighted to obtain the updated estimated driving time. The estimated driving time of the matching path corresponding to each historical driving path is weighted to calculate the updated estimated driving time of multiple planned paths.

[0023] In any of the above technical solutions, a weighted calculation is performed on the estimated driving time corresponding to the matching path based on the historical driving time, including: obtaining the confidence of the historical driving path, the confidence is associated with the obstacles along the historical driving path; determining the weight coefficient of the historical driving path based on the confidence; and based on the weight coefficient and the historical driving time, performing a weighted calculation on the estimated driving time corresponding to the matching path.

[0024] This technical solution proposes determining the weight coefficient in the weighted calculation process according to the confidence of the historical driving path, and performing weighted calculation on the estimated driving time according to the weight coefficient and the corresponding historical driving time.

[0025] In the technical solution of the present application, after obtaining the historical driving path, the self-mobile cleaning device determines the weight coefficient corresponding to the historical driving path through the confidence of the historical driving path, and the updated estimated driving time can be calculated through the weight coefficient, historical driving time and estimated driving time.

[0026] It should be noted that the confidence level is a parameter determined during the driving process of the historical driving route, and the confidence level can reflect the credibility of the historical driving time corresponding to the historical driving route.

[0027] The confidence level of the historical driving path is associated with the number of obstacles on the historical driving path. For example, the greater the number of obstacles, the lower the confidence level. When the self-moving cleaning device is driving along the historical driving path, the self-moving cleaning device can set the confidence level corresponding to the historical driving path according to the number of obstacles encountered, and after the driving is completed, the confidence level is associated with the historical driving path and the historical driving duration and stored in the historical driving record, so that the self-moving cleaning device can read the confidence level later.

[0028] In the technical solution of the present application, the self-moving cleaning equipment can determine the weight coefficient corresponding to the historical driving path according to the corresponding confidence of the historical driving path, and perform weighted calculation on the estimated driving time according to the weight coefficient and the historical driving time, thereby ensuring the accuracy of the updated estimated driving time.

[0029] In any of the above technical solutions, the number of historical driving paths corresponding to the matching path is at least two; based on the weight coefficient and the historical driving time, the estimated driving time corresponding to the matching path is weighted calculated, including: based on at least two historical driving times corresponding to at least two historical driving paths and at least two weight coefficients, the estimated driving time is weighted calculated.

[0030] This technical solution proposes a process of weighted calculation using corresponding multiple historical driving times and corresponding weight coefficients when a matching path corresponds to multiple different historical driving paths.

[0031] In the technical solution of the present application, when the historical driving records include multiple historical driving paths with the same driving trajectory, these historical driving paths with the same driving trajectory may correspond to the same matching path. In this case, it is necessary to obtain multiple weight coefficients from multiple historical driving records, and perform weighted calculation on the estimated driving duration of the matching path based on the multiple weight coefficients.

[0032] In the technical solution of the present application, when it is determined that a matching path corresponds to multiple historical driving paths, the estimated driving duration of the matching path can be updated with reference to the historical driving durations of the multiple historical driving paths, thereby further improving the matching of the updated estimated driving duration with the actual driving duration required for the self-mobile cleaning equipment, and ensuring the accuracy of the target path obtained by screening.

[0033] In any of the above technical solutions, when at least two planned driving paths are obtained, the estimated driving time corresponding to each of the at least two planned driving paths is determined, including: dividing each planned driving path into a straight path, a turning path and a navigation path; determining the straight driving time corresponding to the straight path, the turning time corresponding to the turning path, and the navigation time corresponding to the navigation path; determining the estimated driving time for each planned driving path based on the straight driving time, the turning time and the navigation time corresponding to each planned driving path.

[0034] This technical solution proposes dividing the planned driving path of the self-moving cleaning equipment into a straight path, a turning path and a navigation path, and calculating the corresponding straight-line time, turning time and navigation time for the straight path, the turning path and the navigation path respectively, so as to obtain a relatively accurate estimated driving time.

[0035] In the technical solution of the present application, when the self-moving cleaning device divides the planned driving path, the planned driving path is divided into a straight path, a turning path, and a navigation path according to the different driving states of the self-moving cleaning device. Specifically, the planned driving path is a "bow"-shaped path, and when the self-moving cleaning device is driving along the "bow"-shaped path, there are straight driving processes, turning processes, and navigation processes, and the paths traveled in each process are the straight path, the turning path, and the navigation path.

[0036] It should be noted that the straight path is the path along which the self-moving cleaning device travels in a straight line in the "bow"-shaped path. The "bow"-shaped path includes multiple straight paths. Between two adjacent straight paths, the self-moving cleaning device needs to turn and travel, and the path along which it turns and travels is the turning path. When the self-moving cleaning device performs a "bow"-shaped cleaning of the house, it may pass through an area where there are obstacles, so the self-moving cleaning device will bypass the obstacles and continue to perform the "bow"-shaped cleaning. The path along which the self-moving cleaning device travels between two "bow"-shaped cleaning sections is the navigation path.

[0037] In this technical solution, the self-moving cleaning device can calculate the straight-line time, turning time and navigation time corresponding to the divided straight-line path, turning path and navigation path. After obtaining the corresponding straight-line time, turning time and navigation time, the self-moving cleaning device can calculate the estimated driving time based on this.

[0038] In the technical solution of the present application, the self-moving cleaning equipment can calculate the path driving time corresponding to each planned driving path based on the straight driving time, turning time, and navigation time corresponding to each planned driving path, thereby improving the accuracy of the estimated driving time.

[0039] In any of the above technical solutions, each planned driving path is divided into a straight path, a turning path and a navigation path, including: based on each planned driving path, the target area is segmented to obtain at least two sub-areas; a cleaning path and a navigation path for cleaning at least two sub-areas in each planned driving path are obtained, and the cleaning path includes a straight path and a turning path.

[0040] This technical solution proposes a process in which a self-mobile cleaning device divides a planned driving path. Specifically, the target area to be cleaned by the self-mobile cleaning device is divided, and the planned driving path between the two target areas is determined as a navigation path. The path within the target area is determined to include a straight path and a turning path.

[0041] Specifically, in the process of dividing the planned driving path, it is necessary to consider the path shape, driving direction, etc. of the entire planned driving path, and divide the target area to be cleaned into multiple sub-areas accordingly, ensuring that each sub-area includes a straight path and a turning path, and includes a navigation path between multiple sub-areas. It should be noted that when the same target area is divided based on different planned driving paths, the number and position of the divided sub-areas may also be different due to the different driving directions of the planned driving paths.

[0042] In the technical solution of the present application, the self-moving cleaning equipment can divide the target area into multiple sub-areas according to different planned driving paths, and determine the path located inside the sub-area as a planned driving path including a straight path and a turning path, and determine the planned driving path between multiple sub-areas as a navigation path, thereby ensuring the accuracy of dividing the planned driving path.

[0043] In any of the above technical solutions, determining the straight-line time corresponding to the straight path, the turning time corresponding to the turning path, and the navigation time corresponding to the navigation path includes: determining a first driving distance of the straight path and a second driving distance of the turning path based on first size information of at least two sub-areas; determining a third driving distance of the navigation path based on second size information of the target object in the target area; determining the straight-line time based on the first driving distance; determining the turning time based on the second driving distance; and determining the navigation time based on the third driving distance.

[0044] This technical solution proposes a solution for determining the driving times corresponding to different sub-paths in the planned driving path according to the first size information corresponding to the two sub-areas obtained by division.

[0045] In this technical solution, the first driving distance is the driving distance of the self-mobile cleaning device on the straight path, the second driving distance is the driving distance of the self-mobile cleaning device on the turning path, and the third driving distance is the driving distance of the self-mobile cleaning device on the navigation path. The target object is an obstacle on the navigation path of the self-mobile cleaning device. The self-mobile cleaning device can collect the second size information of the target object. Since the self-mobile cleaning device needs to bypass the obstacle during the navigation driving process, the self-mobile cleaning device can determine the third driving distance based on the second size information.

[0046] Specifically, when multiple first size information corresponding to multiple sub-areas is determined, the first driving distance of the self-moving cleaning device on the straight path can be determined, and the second driving distance of the self-moving cleaning device on the turning path can be determined. The navigation path is determined based on the obstacles on the radar point cloud map, so the third driving distance of the navigation path can be determined based on the second size information of the target object on the radar point cloud map. The straight driving speed, turning driving speed and navigation driving speed of the self-moving cleaning device are all preset values, so the straight driving duration can be determined based on the first driving distance and the straight driving speed, the turning duration can be determined based on the second driving distance and the turning driving speed, and the navigation duration can be determined based on the third driving distance and the navigation driving speed.

[0047] It should be noted that there may be multiple straight paths, multiple turning paths and multiple navigation paths in the planned driving path. The sum of the driving distances of the multiple straight paths is determined as the first driving distance, the sum of the driving distances of the multiple turning paths is determined as the second driving distance, and the sum of the driving distances of the multiple navigation paths is determined as the third driving distance.

[0048] In the technical solution of the present application, by respectively determining the first driving distance of the straight-line phase, the second driving distance of the turning phase, and the third driving distance of the navigation phase of the self-mobile cleaning equipment, the corresponding straight-line time, turning time, and navigation time are accurately calculated according to the preset straight-line driving speed, turning driving speed, and navigation driving speed, thereby ensuring the accuracy of the corresponding time obtained.

[0049] In any of the above technical solutions, the estimated driving time of each planned driving path is determined according to the straight driving time, turning time and navigation time corresponding to each planned driving path, including: the sum of the straight driving time, turning time and navigation time corresponding to each planned driving path is determined as the estimated driving time.

[0050] This technical solution proposes to calculate the sum of the straight driving time, navigation time and turning time corresponding to each planned driving route, and use the calculation result as the estimated driving time, thereby ensuring the accuracy of the calculated estimated driving time.

[0051] In the technical solution of the present application, by summing up the straight-line time, navigation time and turning time corresponding to the straight-line path, navigation path and turning path obtained by dividing the planned driving path, a complete estimated driving time corresponding to the planned driving path can be obtained, thereby ensuring the accuracy of the estimated driving time.

[0052] In any of the above technical solutions, after updating at least one of the at least two estimated driving times based on the historical driving time of the historical driving route, it includes: sending the path information of each planned driving route and the updated estimated driving time to the terminal, so that the terminal can display the path information and the estimated driving time.

[0053] In this technical solution, the self-mobile cleaning device is communicatively connected to the terminal. After the self-mobile cleaning device calculates the estimated driving time for each planned driving route and updates the estimated driving time, the self-mobile cleaning device can send the updated estimated driving time and path information corresponding to each planned driving route to the terminal for the user to view.

[0054] The path information includes the shape of the planned driving path and the positioning information of the planned driving path in the point cloud map.

[0055] Exemplarily, the path information is sent to the terminal in the form of an image for display, that is, the self-mobile cleaning device generates a map with a planned driving path based on the point cloud map and the path information, and sends the map with the planned driving path to the terminal for display, so that the user can observe the planned driving path more intuitively.

[0056] In the technical solution of the present application, after the self-mobile cleaning device completes the update of the estimated driving time corresponding to multiple planned driving routes, the self-mobile cleaning device can send the updated estimated driving time and route information to the terminal connected to the self-mobile cleaning device, so that the user can understand the conditions of different planned driving routes more intuitively.

[0057] In any of the above technical solutions, after the path information and the updated estimated driving time of each planned driving route are sent to the terminal, it also includes: when receiving the path selection information returned from the terminal, updating the target path according to the path selection information.

[0058] This technical solution provides that a user can transmit path selection information back to a self-moving cleaning device through a terminal, and the self-moving cleaning device can reselect a target path based on the path selection information.

[0059] In the technical solution of the present application, the self-mobile cleaning device sends the path information of multiple planned driving paths and the corresponding path driving duration to the terminal for the user to view. The user can reselect the target path from the multiple planned driving paths according to actual needs to ensure that the planned driving path of the self-mobile cleaning device during the cleaning process meets the user's preferences.

[0060] Exemplarily, after the self-mobile cleaning device selects a target path from multiple planned driving paths based on the updated estimated driving duration, while the self-mobile cleaning device is driving along the target path, the self-mobile cleaning device receives path selection information from the terminal, and immediately updates the target path to the planned driving path selected by the user, and re-cleans the target area.

[0061] According to a second aspect of the present application, a path planning device is proposed, which is applied to a self-moving cleaning device. The path planning device includes:

[0062] A determination module, configured to determine at least two estimated driving times corresponding to the at least two planned driving routes when at least two planned driving routes are obtained;

[0063] An updating module, configured to update at least one of the at least two estimated driving durations according to a historical driving duration of the historical driving route;

[0064] The screening module is used to screen a target path of at least two planned driving paths according to the at least two updated estimated driving times.

[0065] The technical solution of the present application proposes a path planning device, which is used to obtain the estimated driving times corresponding to the multiple planned driving paths when the self-mobile cleaning device plans multiple planned driving paths. At least one of the multiple estimated driving times is updated by the historical driving time corresponding to the historical driving path, ensuring that the updated multiple estimated driving times are more in line with the actual driving conditions of the self-mobile cleaning device, thereby improving the accuracy of the updated estimated driving times. The target paths among the multiple planned driving paths are screened by the updated multiple estimated driving times, and the accuracy of the screened target paths is further guaranteed under the premise of achieving automatic screening of target paths with high efficiency.

[0066] In this technical solution, the planned driving path is the planned driving path obtained by the self-mobile cleaning device according to the semantic map. The self-mobile cleaning device can plan multiple planned driving paths according to the semantic map. The self-mobile cleaning device has different driving times for cleaning the house along different planned driving paths. The historical driving path is the path that the self-mobile cleaning device has traveled during the historical cleaning. The self-mobile cleaning device records the corresponding driving time during the historical cleaning process and stores it in association with the historical driving record. It finds the planned driving path that matches the historical driving path among the multiple planned driving paths, and updates the estimated driving time corresponding to the planned driving path according to the historical driving time.

[0067] In the technical solution of the present application, when the self-mobile cleaning device plans multiple planned driving routes, the self-mobile cleaning device can estimate the estimated driving time of each planned driving route according to the operating parameters of the self-mobile cleaning device, and then update the multiple estimated driving times according to the historical driving times corresponding to the historical driving routes, to ensure that the updated estimated driving time is closer to the time required for the actual driving of the self-mobile cleaning device, further improve the accuracy of the target path selected by the self-mobile cleaning device according to the updated estimated driving time, and better meet the actual needs of users.

[0068] According to the third aspect of the present application, a path planning device is proposed, comprising: a memory, in which a program or instruction is stored; a processor, which executes the program or instruction stored in the memory to implement the steps of the path planning method in any technical solution in the first aspect, thereby having all the beneficial technical effects of the path planning method in any technical solution in the first aspect above, and no further details will be given here.

[0069] According to the fourth aspect of the present application, a computer program product is proposed. When the computer program product is executed by a processor, it implements the steps of the path planning method in any technical solution in the first aspect, and thus has all the beneficial technical effects of the path planning method in any technical solution in the first aspect above, which will not be elaborated herein.

[0070] According to the fifth aspect of the present application, a readable storage medium is provided, on which a program or instruction is stored, and when the program or instruction is executed by a processor, the steps of the path planning method in any technical solution in the first aspect are implemented. Therefore, all the beneficial technical effects of the path planning method in any technical solution in the first aspect are achieved, and no further elaboration is made here.

[0071] According to the sixth aspect of the present application, a self-moving cleaning device is proposed, comprising: a path planning device as defined in the above second aspect or third aspect, and / or a computer program product as defined in the above fourth aspect, and / or a readable storage medium as defined in the above fifth aspect, and thus has all the beneficial technical effects of the path planning device in the above second aspect or third aspect, and / or the computer program product as defined in the above fourth aspect, and / or the readable storage medium as defined in the above fifth aspect, and no further details will be given here.

[0072] Additional aspects and advantages of the present application will become apparent in the following description or will be learned through practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0073] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the description of the embodiments in conjunction with the following drawings, in which:

[0074] Figure 1 One of the schematic flow charts of the path planning method provided in some embodiments of the present application is shown;

[0075] Figure 2 A second schematic flow chart of a path planning method provided in some embodiments of the present application is shown;

[0076] Figure 3 A third schematic flow chart of a path planning method provided in some embodiments of the present application is shown;

[0077] Figure 4 A fourth schematic flow chart of a path planning method provided in some embodiments of the present application is shown;

[0078] Figure 5 A schematic diagram showing a first planned trajectory provided in some embodiments of the present application is shown;

[0079] Figure 6 A structural block diagram of a path planning device provided in some embodiments of the present application is shown;

[0080] Figure 7 A structural block diagram of a path planning device provided in some embodiments of the present application is shown;

[0081] Figure 8 A structural block diagram of a self-moving cleaning device provided in some embodiments of the present application is shown. DETAILED DESCRIPTION

[0082] In order to more clearly understand the above-mentioned objectives, features and advantages of the present application, the present application is further described in detail below in conjunction with the accompanying drawings and specific implementation methods. It should be noted that, in the absence of conflict, the present embodiment and the features in the embodiment can be combined with each other.

[0083] In the following description, many specific details are set forth to facilitate a full understanding of the present application. However, the present application may also be implemented in other ways different from those described herein. Therefore, the scope of protection of the present application is not limited to the specific embodiments disclosed below.

[0084] Refer to the following Figures 1 to 8 The present invention describes a path planning method, an apparatus, a computer program product, a readable storage medium, and a self-moving cleaning device according to some embodiments of the present application.

[0085] According to one embodiment of the present application, Figure 1 As shown, a path planning method is proposed, which is performed by a self-moving cleaning device, and the path planning method includes:

[0086] Step 102, when at least two planned driving routes are obtained, determining an estimated driving time corresponding to each of the at least two planned driving routes;

[0087] Step 104, updating at least one of the at least two estimated driving durations according to the historical driving duration of the historical driving route;

[0088] Step 106 , selecting a target path of at least two planned driving paths according to the updated at least two estimated driving times.

[0089] In an embodiment of the present application, a path planning method is proposed, which is used to obtain the estimated driving durations corresponding to the multiple planned driving paths when the self-mobile cleaning device plans multiple planned driving paths. At least one of the multiple estimated driving durations is updated by the historical driving duration corresponding to the historical driving path, ensuring that the updated multiple estimated driving durations are more consistent with the actual driving conditions of the self-mobile cleaning device, thereby improving the accuracy of the updated estimated driving durations. The target paths among the multiple planned driving paths are screened by the updated multiple estimated driving durations, and the accuracy of the screened target paths is further guaranteed under the premise of achieving automatic screening of target paths with higher efficiency.

[0090] In this embodiment, the planned driving path is the planned driving path obtained by the self-mobile cleaning device according to the semantic map. The self-mobile cleaning device can plan multiple planned driving paths according to the semantic map. The self-mobile cleaning device has different driving times for cleaning the house along different planned driving paths. The historical driving path is the path that the self-mobile cleaning device has traveled during the historical cleaning. The self-mobile cleaning device records the corresponding driving time during the historical cleaning process and stores it in association with the historical driving record. It finds the planned driving path that matches the historical driving path among the multiple planned driving paths, and updates the estimated driving time corresponding to the planned driving path according to the historical driving time.

[0091] There are many ways to update the estimated driving time based on the historical driving time, as follows:

[0092] Exemplarily, an average value of the historical driving duration and the estimated driving duration is calculated, and the average value is determined as the updated estimated driving duration.

[0093] Exemplarily, the estimated driving duration is deleted, and the historical driving duration is determined as the updated estimated driving duration.

[0094] In this embodiment, the number of historical driving paths is at least one. When the number of historical driving paths is multiple, different historical driving paths may match planned driving paths obtained from different plans, and different historical driving paths may also match planned driving paths obtained from the same plan.

[0095] In this embodiment, after determining the updated estimated driving time, the self-propelled cleaning device can filter the target path according to the updated estimated driving time. The specific filtering rules can be set according to the actual needs of the user.

[0096] For example, when considering saving the driving time of the self-moving cleaning device, a planned driving path with the shortest estimated driving time among multiple planned driving paths may be selected as the target path.

[0097] In this embodiment, since the driving speed of the self-moving cleaning device and the distance of the planned driving path are known, the self-moving cleaning device can accurately estimate the driving time according to the driving speed and distance. Specifically, when the self-moving cleaning device travels along different planned driving paths, the shape of the driving track is different, and different shapes of driving tracks correspond to different driving speeds.

[0098] Exemplarily, the planned driving path obtained by planning includes a "bow"-shaped path. The "bow"-shaped path includes a straight path, a turning path and a navigation path. The straight path is the path of the self-mobile cleaning device in the "bow"-shaped path that travels in a straight line. The "bow"-shaped path includes multiple straight paths. Between two adjacent straight paths, the self-mobile cleaning device needs to turn around, and the path that the U-turn travels is the turning path. When the self-mobile cleaning device performs a "bow"-shaped cleaning of the house, there may be areas where obstacles exist on the way, so the self-mobile cleaning device will bypass the obstacles and continue to perform the "bow"-shaped cleaning. The path that the self-mobile cleaning device travels between the two "bow"-shaped cleanings is the navigation path. The straight path, the turning path and the navigation path correspond to the straight driving speed, the turning driving speed and the navigation driving speed, respectively. By estimating the time required for the straight path, the turning path and the navigation path, and summing the time obtained respectively, the estimated driving time corresponding to the "bow"-shaped path can be obtained.

[0099] Exemplarily, the planned driving path obtained by planning includes a "U"-shaped path. The "bow"-shaped path includes a straight path, a turning path and a navigation path. The straight path is the path of the self-mobile cleaning device in the "U"-shaped path that travels in a straight line. The "U"-shaped path includes multiple straight paths. Between two adjacent straight paths, the self-mobile cleaning device needs to turn and travel, and the path that turns and travels is the turning path. When the self-mobile cleaning device performs a "U"-shaped cleaning of the house, there may be an area where obstacles exist on the way, so the self-mobile cleaning device will bypass the obstacles and continue to perform the "U"-shaped cleaning. The path that the self-mobile cleaning device travels between the two "U"-shaped cleanings is the navigation path. The straight path, the turning path and the navigation path correspond to the straight driving speed, the turning driving speed and the navigation driving speed, respectively. By estimating the time required for the straight path, the turning path and the navigation path, and summing the time lengths obtained respectively, the estimated driving time corresponding to the "U"-shaped path can be obtained.

[0100] In an embodiment of the present application, when the self-mobile cleaning device has planned multiple planned driving routes, the self-mobile cleaning device can estimate the estimated driving duration of each planned driving route based on the operating parameters of the self-mobile cleaning device, and then update the multiple estimated driving durations based on the historical driving durations corresponding to the historical driving routes, thereby ensuring that the updated estimated driving duration is closer to the duration required for the actual driving of the self-mobile cleaning device, further improving the accuracy of the target path selected by the self-mobile cleaning device based on the updated estimated driving duration, and better meeting the actual needs of users.

[0101] like Figure 2 As shown, in the above embodiment, updating at least one of the at least two estimated driving durations according to the historical driving duration of the historical driving path includes:

[0102] Step 202, based on the historical driving path, screening at least two matching paths in the planned driving paths, the matching path matching the historical driving path;

[0103] Step 204 , weighted calculation is performed on the estimated driving time corresponding to the matching path according to the historical driving time, so as to update the estimated driving time corresponding to the matching path.

[0104] In this embodiment, a solution is proposed for updating the estimated driving duration corresponding to the matching paths among multiple planned driving paths through the historical driving paths.

[0105] In the embodiment of the present application, all historical driving paths in the historical driving records are extracted, and matching paths in multiple planned driving paths are searched according to each historical driving path. Among them, multiple matching paths can be found according to a certain historical driving path, and a certain historical driving path may not find a corresponding matching path.

[0106] Exemplarily, by comparing the shapes of each historical driving path with a plurality of planned driving paths, the planned driving paths with matching shapes are used as matching paths.

[0107] Exemplarily, by comparing the distances of each historical driving path with a plurality of planned driving paths, a planned driving path with a distance difference less than a preset threshold is taken as a matching path.

[0108] In an embodiment of the present application, after a matching path corresponding to a historical driving path is screened, the estimated driving time of the matching path and the historical driving time of the historical driving path are weighted and calculated, and the weighted calculated time is used as the updated estimated driving time.

[0109] In the embodiment of the present application, the estimated driving time of the matching path and the historical driving time of the corresponding historical driving path are weighted to obtain the updated estimated driving time. The estimated driving time of the matching path corresponding to each historical driving path is weighted to calculate the updated estimated driving time of multiple planned paths.

[0110] like Figure 3 As shown, in any of the above embodiments, the estimated driving time corresponding to the matching path is weightedly calculated according to the historical driving time, including:

[0111] Step 302, obtaining the confidence of the historical driving path, where the confidence is associated with obstacles along the historical driving path;

[0112] Step 304, determining a weight coefficient of the historical driving path according to the confidence level;

[0113] Step 306 , based on the weight coefficient and the historical driving duration, weighted calculation is performed on the estimated driving duration corresponding to the matching path.

[0114] In this embodiment, it is proposed to determine the weight coefficient in the weighted calculation process according to the confidence of the historical driving path, and to perform weighted calculation on the estimated driving duration according to the weight coefficient and the corresponding historical driving duration.

[0115] In an embodiment of the present application, after obtaining the historical driving path, the self-mobile cleaning device determines the weight coefficient corresponding to the historical driving path through the confidence of the historical driving path, and the updated estimated driving time can be calculated through the weight coefficient, the historical driving time and the estimated driving time.

[0116] For example, the updated estimated driving time is calculated as follows:

[0117] T = (1-K1) × T1 + K1 × T2;

[0118] Among them, T is the estimated driving time after update, K1 is the weight coefficient, T1 is the estimated driving time before update, and T2 is the historical driving time.

[0119] It should be noted that the confidence level is a parameter determined during the driving process of the historical driving route, and the confidence level can reflect the credibility of the historical driving time corresponding to the historical driving route.

[0120] Exemplarily, the confidence of the historical driving path is associated with the number of obstacles on the historical driving path. For example, the greater the number of obstacles, the lower the confidence. When the self-moving cleaning device is driving along the historical driving path, the self-moving cleaning device can set the confidence corresponding to the historical driving path according to the number of obstacles encountered, and after the driving is completed, the confidence is associated with the historical driving path and the historical driving duration and stored in the historical driving record, so that the self-moving cleaning device can read the confidence later.

[0121] In an embodiment of the present application, the self-moving cleaning device can determine the weight coefficient corresponding to the historical driving path based on the corresponding confidence level of the historical driving path, and perform weighted calculation on the estimated driving time based on the weight coefficient and the historical driving time, thereby ensuring the accuracy of the updated estimated driving time.

[0122] In any of the above embodiments, the number of historical driving paths corresponding to the matching path is at least two; based on the weight coefficient and the historical driving duration, weighted calculation is performed on the estimated driving duration corresponding to the matching path, including:

[0123] The estimated driving duration is weightedly calculated according to at least two historical driving durations corresponding to at least two historical driving routes and at least two weight coefficients.

[0124] This embodiment proposes a process of performing weighted calculation using corresponding multiple historical driving durations and corresponding weight coefficients when the matching path corresponds to multiple different historical driving paths.

[0125] In the embodiment of the present application, when the historical driving record includes multiple historical driving paths with the same driving trajectory, these historical driving paths with the same driving trajectory may correspond to the same matching path. In this case, it is necessary to obtain multiple weight coefficients from the multiple historical driving records, and perform weighted calculation on the estimated driving duration of the matching path based on the multiple weight coefficients.

[0126] For example, when multiple historical driving paths matching the matching path are obtained, the weight coefficients of the multiple historical driving paths are compared, and the historical driving path with the largest weight coefficient is determined as the target driving path, and the estimated driving time of the matching path is weightedly calculated by the historical driving time corresponding to the target driving path and the weight coefficient. Among them, the historical driving path with the largest weight coefficient is the historical driving path with the highest confidence among the multiple historical driving paths.

[0127] Exemplarily, when multiple historical driving paths that match the matching path are obtained, weight coefficients of the multiple historical driving paths are determined respectively, and the estimated driving duration of the matching path is weightedly calculated using the weight coefficients of the multiple historical driving paths and the multiple historical driving durations.

[0128] Take the case where there are two historical driving routes as an example. The two historical driving routes are the first historical driving route and the second historical driving route. The estimated driving duration is weightedly calculated in the following manner:

[0129] T=(1-K1-K2)×T1+K1×T2+K2×T3;

[0130] Among them, T is the estimated driving time after update, K1 is the weight coefficient of the first historical driving path, K2 is the weight coefficient of the second historical driving path, T1 is the estimated driving time before update, T2 is the historical driving time of the first historical driving path, and T3 is the historical driving time of the second historical driving path.

[0131] In an embodiment of the present application, when it is determined that a matching path corresponds to multiple historical driving paths, the estimated driving duration of the matching path can be updated with reference to the historical driving durations of the multiple historical driving paths, thereby further improving the matching of the updated estimated driving duration with the actual driving duration required for the self-mobile cleaning equipment, and ensuring the accuracy of the target path obtained by screening.

[0132] like Figure 4As shown, in any of the above embodiments, when at least two planned driving paths are obtained, determining at least two estimated driving times corresponding to the at least two planned driving paths includes:

[0133] Step 402, dividing each planned driving path into a straight path, a turning path and a navigation path;

[0134] Step 404, determining a straight travel time corresponding to the straight travel path, a turning time corresponding to the turning path, and a navigation time corresponding to the navigation path;

[0135] Step 406, determining the estimated driving time of each planned driving path according to the straight driving time, turning time and navigation time corresponding to each planned driving path.

[0136] In this embodiment, it is proposed to divide the planned driving path of the self-propelled cleaning equipment into a straight path, a turning path and a navigation path, and calculate the corresponding straight-line duration, turning duration and navigation duration for the straight path, the turning path and the navigation path, respectively, so as to obtain a relatively accurate estimated driving time.

[0137] Exemplarily, when the driving path is a "bow"-shaped path, the turning driving path is a path rotated 180 degrees, and when the driving path is a "U"-shaped path, the turning driving path is a driving path rotated 90 degrees.

[0138] In the embodiment of the present application, when the self-moving cleaning device divides the planned driving path, the planned driving path is divided into a straight path, a turning path, and a navigation path according to the different driving states of the self-moving cleaning device. Specifically, the planned driving path is a "bow"-shaped path, and when the self-moving cleaning device is driving along the "bow"-shaped path, there are a straight process, a turning process, and a navigation process, and the path traveled in each process is the straight path, the turning path, and the navigation path.

[0139] It should be noted that the straight path is the path along which the self-moving cleaning device travels in a straight line in the "bow"-shaped path. The "bow"-shaped path includes multiple straight paths. Between two adjacent straight paths, the self-moving cleaning device needs to turn and travel, and the path along which it turns and travels is the turning path. When the self-moving cleaning device performs a "bow"-shaped cleaning of the house, it may pass through an area where there are obstacles, so the self-moving cleaning device will bypass the obstacles and continue to perform the "bow"-shaped cleaning. The path along which the self-moving cleaning device travels between two "bow"-shaped cleaning sections is the navigation path.

[0140] In this embodiment, the self-moving cleaning device can calculate the straight-line time, turning time and navigation time corresponding to the divided straight-line path, turning path and navigation path. After obtaining the corresponding straight-line time, turning time and navigation time, the self-moving cleaning device can calculate the estimated driving time based on this.

[0141] In an embodiment of the present application, the self-moving cleaning device can calculate the path driving time corresponding to each planned driving path based on the straight driving time, turning time, and navigation time corresponding to each planned driving path, thereby improving the accuracy of the estimated driving time.

[0142] In any of the above embodiments, each planned driving path is divided into a straight path, a turning path and a navigation path, including: based on each planned driving path, the target area is segmented to obtain at least two sub-areas; a cleaning path and a navigation path for cleaning at least two sub-areas in each planned driving path are obtained, and the cleaning path includes a straight path and a turning path.

[0143] In this embodiment, a process of dividing the planned driving path of the self-mobile cleaning device is proposed. Specifically, the target area to be cleaned by the self-mobile cleaning device is divided, and the planned driving path between the two target areas is determined as the navigation path. The path within the target area is determined to include a straight path and a turning path.

[0144] Specifically, in the process of dividing the planned driving path, it is necessary to consider the path shape, driving direction, etc. of the entire planned driving path, and divide the target area to be cleaned into multiple sub-areas accordingly, ensuring that each sub-area includes a straight path and a turning path, and includes a navigation path between multiple sub-areas. It should be noted that when the same target area is divided based on different planned driving paths, the number and position of the divided sub-areas may also be different due to the different driving directions of the planned driving paths.

[0145] Exemplarily, the planned driving path includes a "bow"-shaped path. When dividing the target area, it is ensured that each sub-area includes a "bow"-shaped path, that is, a straight path and a U-turn path in the "bow"-shaped path, and between two adjacent sub-areas in the driving direction includes a navigation path that moves from one "bow"-shaped path to another "bow"-shaped path.

[0146] like Figure 5As shown, there is an obstacle 502 in the target area, and the target area is divided into a first sub-area 504, a second sub-area 506, and a third sub-area 508. The first sub-area 504, the second sub-area 506, and the third sub-area 508 all include a "bow"-shaped path 510, and the "bow"-shaped path includes a straight path 5102 and a turning path 5104. Since the planned driving path passes through the first sub-area 504, the second sub-area 506, and the third sub-area 508 in sequence, the navigation path 5106 is included between the first sub-area 504 and the second sub-area 506, and the navigation path 5106 is also included between the second sub-area 506 and the third sub-area 508.

[0147] Exemplarily, the self-mobile cleaning device determines the target area to be cleaned based on the radar point cloud map, and obtains the length information and width information of the target area, and uses the length information and width information to segment the target area using the "ox-plowing segmentation" method. The segmentation direction is determined based on the driving direction of different planned driving paths, thereby dividing the target area into multiple sub-areas, and determining the positioning information, length information and width information of each sub-area.

[0148] In an embodiment of the present application, the self-moving cleaning device can divide the target area into multiple sub-areas according to different planned driving paths, and determine the path located inside the sub-area as a planned driving path including a straight path and a turning path, and determine the planned driving path between multiple sub-areas as a navigation path, thereby ensuring the accuracy of dividing the planned driving path.

[0149] In any of the above embodiments, determining the straight-line time corresponding to the straight path, the turning time corresponding to the turning path, and the navigation time corresponding to the navigation path includes: determining a first driving distance of the straight path and a second driving distance of the turning path according to first size information of at least two sub-areas; determining a third driving distance of the navigation path according to second size information of the target object in the target area; determining the straight-line time according to the first driving distance; determining the turning time according to the second driving distance; and determining the navigation time according to the third driving distance.

[0150] In this embodiment, a solution is proposed for determining the driving durations corresponding to different sub-paths in the planned driving path according to the first size information corresponding to the two sub-regions obtained by division.

[0151] In this embodiment, the first driving distance is the driving distance of the self-mobile cleaning device on the straight path, the second driving distance is the driving distance of the self-mobile cleaning device on the turning path, and the third driving distance is the driving distance of the self-mobile cleaning device on the navigation path. The target object is an obstacle on the navigation path of the self-mobile cleaning device. The self-mobile cleaning device can collect the second size information of the target object. Since the self-mobile cleaning device needs to bypass the obstacle during the navigation driving process, the self-mobile cleaning device can determine the third driving distance based on the second size information.

[0152] Specifically, when multiple first size information corresponding to multiple sub-areas is determined, the first driving distance of the self-moving cleaning device on the straight path can be determined, and the second driving distance of the self-moving cleaning device on the turning path can be determined. The navigation path is determined based on the obstacles on the radar point cloud map, so the third driving distance of the navigation path can be determined based on the second size information of the target object on the radar point cloud map. The straight driving speed, turning driving speed and navigation driving speed of the self-moving cleaning device are all preset values, so the straight driving duration can be determined based on the first driving distance and the straight driving speed, the turning duration can be determined based on the second driving distance and the turning driving speed, and the navigation duration can be determined based on the third driving distance and the navigation driving speed.

[0153] It should be noted that there may be multiple straight paths, multiple turning paths and multiple navigation paths in the planned driving path. The sum of the driving distances of the multiple straight paths is determined as the first driving distance, the sum of the driving distances of the multiple turning paths is determined as the second driving distance, and the sum of the driving distances of the multiple navigation paths is determined as the third driving distance.

[0154] In the embodiment of the present application, by respectively determining the first driving distance of the straight-line phase, the second driving distance of the turning phase, and the third driving distance of the navigation phase of the self-mobile cleaning device, the corresponding straight-line time, turning time, and navigation time are accurately calculated according to the preset straight-line driving speed, turning driving speed, and navigation driving speed, thereby ensuring the accuracy of the corresponding time.

[0155] In any of the above embodiments, the estimated driving time of each planned driving path is determined according to the straight driving time, turning time and navigation time corresponding to each planned driving path, including: the sum of the straight driving time, turning time and navigation time corresponding to each planned driving path is determined as the estimated driving time.

[0156] In this embodiment, it is proposed to calculate the sum of the straight driving time, navigation time and turning time corresponding to each planned driving path, and use the calculation result as the estimated driving time, thereby ensuring the accuracy of the calculated estimated driving time.

[0157] In an embodiment of the present application, by summing up the straight-line time, navigation time and turning time corresponding to the straight-line path, navigation path and turning path obtained by dividing the planned driving path, a complete estimated driving time corresponding to the planned driving path can be obtained, thereby ensuring the accuracy of the estimated driving time.

[0158] In any of the above embodiments, after updating at least one of the at least two estimated driving times based on the historical driving time of the historical driving route, it includes: sending the path information of each planned driving route and the updated estimated driving time to the terminal, so that the terminal can display the path information and the estimated driving time.

[0159] In this embodiment, the self-mobile cleaning device is communicatively connected to the terminal. After the self-mobile cleaning device calculates the estimated driving time for each planned driving route and updates the estimated driving time, the self-mobile cleaning device can send the updated estimated driving time and path information corresponding to each planned driving route to the terminal for the user to view.

[0160] The path information includes the shape of the planned driving path and the positioning information of the planned driving path in the point cloud map.

[0161] Exemplarily, the path information is sent to the terminal in the form of an image for display, that is, the self-mobile cleaning device generates a map with a planned driving path based on the point cloud map and the path information, and sends the map with the planned driving path to the terminal for display, so that the user can observe the planned driving path more intuitively.

[0162] In an embodiment of the present application, after the self-mobile cleaning device completes the update of the estimated driving times corresponding to multiple planned driving routes, the self-mobile cleaning device can send the updated estimated driving times and route information to a terminal connected to the self-mobile cleaning device, so that the user can understand the situations of different planned driving routes more intuitively.

[0163] In any of the above embodiments, after the path information and the updated estimated driving time of each planned driving path are sent to the terminal, it also includes: when receiving the path selection information returned from the terminal, updating the target path according to the path selection information.

[0164] In this embodiment, a user can transmit path selection information back to the self-moving cleaning device through a terminal, and the self-moving cleaning device can reselect a target path based on the path selection information.

[0165] In an embodiment of the present application, the self-mobile cleaning device sends the path information of multiple planned driving paths and the corresponding path driving duration to the terminal for the user to view. The user can reselect the target path from the multiple planned driving paths according to actual needs to ensure that the planned driving path of the self-mobile cleaning device during the cleaning process meets the user's preferences.

[0166] Exemplarily, after the self-mobile cleaning device selects a target path from multiple planned driving paths based on the updated estimated driving duration, while the self-mobile cleaning device is driving along the target path, the self-mobile cleaning device receives path selection information from the terminal, and immediately updates the target path to the planned driving path selected by the user, and re-cleans the target area.

[0167] In one embodiment according to the present application, Figure 6 As shown, a path planning device 600 is proposed, which is applied to a self-moving cleaning device. The path planning device 600 includes:

[0168] A determination module 602 is used to determine an estimated driving time corresponding to each of the at least two planned driving paths when at least two planned driving paths are obtained;

[0169] An updating module 604, configured to update at least one of the at least two estimated driving durations according to the historical driving duration of the historical driving route;

[0170] The screening module 606 is used to screen the target path of the at least two planned driving paths according to the updated at least two estimated driving times.

[0171] In an embodiment of the present application, a path planning device is proposed, which is used to obtain the estimated driving durations corresponding to the multiple planned driving paths when the self-mobile cleaning device plans multiple planned driving paths. At least one of the multiple estimated driving durations is updated by the historical driving duration corresponding to the historical driving path, ensuring that the updated multiple estimated driving durations are more consistent with the actual driving conditions of the self-mobile cleaning device, thereby improving the accuracy of the updated estimated driving durations. The target paths among the multiple planned driving paths are screened by the updated multiple estimated driving durations, and the accuracy of the screened target paths is further guaranteed under the premise of achieving automatic screening of target paths with high efficiency.

[0172] In this embodiment, the planned driving path is the planned driving path obtained by the self-mobile cleaning device according to the semantic map. The self-mobile cleaning device can plan multiple planned driving paths according to the semantic map. The self-mobile cleaning device has different driving times for cleaning the house along different planned driving paths. The historical driving path is the path that the self-mobile cleaning device has traveled during the historical cleaning. The self-mobile cleaning device records the corresponding driving time during the historical cleaning process and stores it in association with the historical driving record. It finds the planned driving path that matches the historical driving path among the multiple planned driving paths, and updates the estimated driving time corresponding to the planned driving path according to the historical driving time.

[0173] In an embodiment of the present application, when the self-mobile cleaning device has planned multiple planned driving routes, the self-mobile cleaning device can estimate the estimated driving duration of each planned driving route based on the operating parameters of the self-mobile cleaning device, and then update the multiple estimated driving durations based on the historical driving durations corresponding to the historical driving routes, thereby ensuring that the updated estimated driving duration is closer to the duration required for the actual driving of the self-mobile cleaning device, further improving the accuracy of the target path selected by the self-mobile cleaning device based on the updated estimated driving duration, and better meeting the actual needs of users.

[0174] In the above embodiment, the screening module 606 is used to screen the matching path in at least two planned driving paths according to the historical driving path, and the matching path matches the historical driving path;

[0175] The path planning device 600 includes:

[0176] The calculation module is used to perform weighted calculation on the estimated driving time corresponding to the matching path according to the historical driving time, so as to update the estimated driving time corresponding to the matching path.

[0177] In this embodiment, a solution is proposed for updating the estimated driving duration corresponding to the matching paths among multiple planned driving paths through the historical driving paths.

[0178] In the embodiment of the present application, the estimated driving time of the matching path and the historical driving time of the corresponding historical driving path are weighted to obtain the updated estimated driving time. The estimated driving time of the matching path corresponding to each historical driving path is weighted to calculate the updated estimated driving time of multiple planned paths.

[0179] In any of the above embodiments, the path planning device 600 includes:

[0180] An acquisition module, used to acquire the confidence of the historical driving path, where the confidence is associated with obstacles along the historical driving path;

[0181] A determination module 602, for determining a weight coefficient of a historical driving path according to the confidence level;

[0182] The calculation module is used to perform weighted calculation on the estimated driving time corresponding to the matching path based on the weight coefficient and the historical driving time.

[0183] In this embodiment, it is proposed to determine the weight coefficient in the weighted calculation process according to the confidence of the historical driving path, and to perform weighted calculation on the estimated driving duration according to the weight coefficient and the corresponding historical driving duration.

[0184] In an embodiment of the present application, the self-moving cleaning device can determine the weight coefficient corresponding to the historical driving path based on the corresponding confidence level of the historical driving path, and perform weighted calculation on the estimated driving time based on the weight coefficient and the historical driving time, thereby ensuring the accuracy of the updated estimated driving time.

[0185] In any of the above embodiments, the number of historical travel paths corresponding to the matching path is at least two;

[0186] The calculation module is used to perform weighted calculation on the estimated driving duration according to at least two historical driving durations corresponding to at least two historical driving routes and at least two weight coefficients.

[0187] This embodiment proposes a process of performing weighted calculation using corresponding multiple historical driving durations and corresponding weight coefficients when the matching path corresponds to multiple different historical driving paths.

[0188] In an embodiment of the present application, when it is determined that a matching path corresponds to multiple historical driving paths, the estimated driving duration of the matching path can be updated with reference to the historical driving durations of the multiple historical driving paths, thereby further improving the matching of the updated estimated driving duration with the actual driving duration required for the self-mobile cleaning equipment, and ensuring the accuracy of the target path obtained by screening.

[0189] In any of the above embodiments, the path planning device 600 includes:

[0190] A division module, used for dividing each planned driving path into a straight path, a turning path and a navigation path;

[0191] A determination module 602 is used to determine a straight travel time corresponding to a straight travel path, a turning time corresponding to a turning path, and a navigation time corresponding to a navigation path;

[0192] The determination module 602 is used to determine the estimated driving time of each planned driving route according to the straight driving time, turning time and navigation time corresponding to each planned driving route.

[0193] In this embodiment, it is proposed to divide the planned driving path of the self-propelled cleaning equipment into a straight path, a turning path and a navigation path, and calculate the corresponding straight-line duration, turning duration and navigation duration for the straight path, the turning path and the navigation path, respectively, so as to obtain a relatively accurate estimated driving time.

[0194] In an embodiment of the present application, the self-moving cleaning device can calculate the path driving time corresponding to each planned driving path based on the straight driving time, turning time, and navigation time corresponding to each planned driving path, thereby improving the accuracy of the estimated driving time.

[0195] In any of the above embodiments, the division module is used to divide the target area based on each planned driving path to obtain at least two sub-areas;

[0196] The acquisition module is used to acquire a cleaning path and a navigation path for cleaning at least two sub-areas in each planned driving path, wherein the cleaning path includes a straight path and a turning path.

[0197] In this embodiment, a process of dividing the planned driving path of the self-mobile cleaning device is proposed. Specifically, the target area to be cleaned by the self-mobile cleaning device is divided, and the planned driving path between the two target areas is determined as the navigation path. The path within the target area is determined to include a straight path and a turning path.

[0198] In an embodiment of the present application, the self-moving cleaning device can divide the target area into multiple sub-areas according to different planned driving paths, and determine the path located inside the sub-area as a planned driving path including a straight path and a turning path, and determine the planned driving path between multiple sub-areas as a navigation path, thereby ensuring the accuracy of dividing the planned driving path.

[0199] In any of the above embodiments, the determination module 602 is used to determine a first driving distance of the straight path and a second driving distance of the turning path according to first size information of at least two sub-areas;

[0200] A determination module 602, configured to determine a third driving distance of the navigation path according to second size information of the target object in the target area;

[0201] A determination module 602 is used to determine a straight travel time according to the first travel distance;

[0202] A determination module 602, configured to determine a turning time according to a second driving distance;

[0203] The determination module 602 is used to determine the navigation duration according to the third driving distance.

[0204] In this embodiment, a solution is proposed for determining the driving durations corresponding to different sub-paths in the planned driving path according to the first size information corresponding to the two sub-regions obtained by division.

[0205] In the embodiment of the present application, by respectively determining the first driving distance of the straight-line phase, the second driving distance of the turning phase, and the third driving distance of the navigation phase of the self-mobile cleaning device, the corresponding straight-line time, turning time, and navigation time are accurately calculated according to the preset straight-line driving speed, turning driving speed, and navigation driving speed, thereby ensuring the accuracy of the corresponding time.

[0206] In any of the above embodiments, the determination module 602 is used to determine the sum of the straight driving time, the turning time and the navigation time corresponding to each planned driving path as the estimated driving time.

[0207] In this embodiment, it is proposed to calculate the sum of the straight driving time, navigation time and turning time corresponding to each planned driving path, and use the calculation result as the estimated driving time, thereby ensuring the accuracy of the calculated estimated driving time.

[0208] In an embodiment of the present application, by summing up the straight-line time, navigation time and turning time corresponding to the straight-line path, navigation path and turning path obtained by dividing the planned driving path, a complete estimated driving time corresponding to the planned driving path can be obtained, thereby ensuring the accuracy of the estimated driving time.

[0209] In any of the above embodiments, the path planning device 600 includes:

[0210] The sending module is used to send the path information and updated estimated driving time of each planned driving path to the terminal so that the terminal can display the path information and estimated driving time.

[0211] In this embodiment, the self-mobile cleaning device is communicatively connected to the terminal. After the self-mobile cleaning device calculates the estimated driving time for each planned driving route and updates the estimated driving time, the self-mobile cleaning device can send the updated estimated driving time and path information corresponding to each planned driving route to the terminal for the user to view.

[0212] In an embodiment of the present application, after the self-mobile cleaning device completes the update of the estimated driving times corresponding to multiple planned driving routes, the self-mobile cleaning device can send the updated estimated driving times and route information to a terminal connected to the self-mobile cleaning device, so that the user can understand the situations of different planned driving routes more intuitively.

[0213] In any of the above embodiments, the updating module 604 is configured to update the target path according to the path selection information when receiving the path selection information returned from the terminal.

[0214] In this embodiment, a user can transmit path selection information back to the self-moving cleaning device through a terminal, and the self-moving cleaning device can reselect a target path based on the path selection information.

[0215] In an embodiment of the present application, the self-mobile cleaning device sends the path information of multiple planned driving paths and the corresponding path driving duration to the terminal for the user to view. The user can reselect the target path from the multiple planned driving paths according to actual needs to ensure that the planned driving path of the self-mobile cleaning device during the cleaning process meets the user's preferences.

[0216] In one embodiment according to the present application, Figure 7 As shown, a path planning device 700 is proposed, including: a processor 702 and a memory 704, in which programs or instructions are stored; the processor 702 executes the program or instructions stored in the memory 704 to implement the steps of the path planning method in any of the above embodiments, and thus has all the beneficial technical effects of the path planning method in any of the above embodiments, which will not be elaborated herein.

[0217] In one embodiment of the present application, a computer program product is proposed. When the computer program product is executed by a processor, it implements the steps of the path planning method in any of the above embodiments, and thus has all the beneficial technical effects of the path planning method in any of the above embodiments, which will not be elaborated herein.

[0218] In one embodiment of the present application, a readable storage medium is provided, on which a program or instruction is stored, and when the program or instruction is executed by a processor, the steps of the path planning method in any of the above embodiments are implemented. Therefore, all the beneficial technical effects of the path planning method in any of the above embodiments are achieved, and no further details are given here.

[0219] In one embodiment according to the present application, Figure 8 As shown, a self-moving cleaning device 800 is proposed, including: a path planning device 700 as in any of the above embodiments, and / or a computer program product 802 as in any of the above embodiments, and / or a readable storage medium 804 as in any of the above embodiments, and thus has all the beneficial technical effects of the path planning device 700 as in any of the above embodiments, and / or the computer program product 802 as in any of the above embodiments, and / or the readable storage medium 804 as in any of the above embodiments, and no further details will be given here.

[0220] It should be clarified that in the claims, specification and drawings of the present application, the term "multiple" refers to two or more than two. Unless otherwise clearly defined, the orientation or position relationship indicated by the terms "upper" and "lower" is based on the orientation or position relationship shown in the drawings, which is only for the purpose of more conveniently describing the present application and making the description process easier, rather than indicating or implying that the device or element referred to must have the specific orientation described, be constructed and operated in a specific orientation, so these descriptions cannot be understood as limitations on the present application; the terms "connect", "install", "fix" and the like should be understood in a broad sense. For example, "connection" can be a fixed connection between multiple objects, or a detachable connection between multiple objects, or an integral connection; it can be a direct connection between multiple objects, or an indirect connection between multiple objects through an intermediate medium. For ordinary technicians in this field, the specific meanings of the above terms in this application can be understood based on the specific circumstances of the above data.

[0221] In the claims, specification and drawings of the present application, the description of the terms "one embodiment", "some embodiments", "specific embodiments" and the like means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in the embodiment or example of the present application. In the claims, specification and drawings of the present application, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0222] The above are only preferred embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A path planning method, characterized in that: Executed by a self-propelled cleaning device, the path planning method includes: When at least two planned driving paths are obtained, determining an estimated driving time corresponding to each of the at least two planned driving paths; updating at least one of the at least two estimated driving durations according to the historical driving duration of the historical driving route; According to the updated at least two estimated driving durations, a target path of the at least two planned driving paths is selected.

2. The path planning method according to claim 1, characterized in that: The updating of at least one of the at least two estimated driving durations according to the historical driving duration of the historical driving route comprises: According to the historical driving path, screening a matching path among the at least two planned driving paths, wherein the matching path matches the historical driving path; The estimated driving duration corresponding to the matching path is weightedly calculated according to the historical driving duration to update the estimated driving duration corresponding to the matching path.

3. The path planning method according to claim 2, characterized in that: The step of performing weighted calculation on the estimated driving time corresponding to the matching path according to the historical driving time includes: Obtaining a confidence level of the historical driving path, wherein the confidence level is associated with obstacles along the historical driving path; Determining a weight coefficient of the historical driving path according to the confidence level; Based on the weight coefficient and the historical driving duration, a weighted calculation is performed on the estimated driving duration corresponding to the matching path.

4. The path planning method according to claim 3, characterized in that: The number of the historical driving paths corresponding to the matching path is at least two; The weighted calculation of the estimated driving duration corresponding to the matching path based on the weight coefficient and the historical driving duration includes: The estimated driving duration is weightedly calculated according to the at least two historical driving durations corresponding to the at least two historical driving routes and the at least two weight coefficients.

5. The path planning method according to any one of claims 1 to 4, characterized in that: The step of determining the estimated driving duration corresponding to each of the at least two planned driving paths when at least two planned driving paths are obtained includes: Dividing each of the planned driving paths into a straight path, a turning path and a navigation path; Determine a straight-ahead time corresponding to the straight-ahead path, a turning time corresponding to the turning path, and a navigation time corresponding to the navigation path; The estimated driving time of each planned driving path is determined according to the straight driving time, turning time and navigation time corresponding to each planned driving path.

6. The path planning method according to claim 5, characterized in that: The step of dividing each of the planned driving paths into a straight path, a turning path and a navigation path includes: Based on each of the planned driving paths, the target area is segmented to obtain at least two sub-areas; A cleaning path for cleaning the at least two sub-areas and the navigation path in each of the planned driving paths are obtained, wherein the cleaning path includes the straight path and the turning path.

7. The path planning method according to claim 6, characterized in that: The determining of the straight travel duration corresponding to the straight travel path, the turning duration corresponding to the turning path, and the navigation duration corresponding to the navigation path includes: Determining a first driving distance of the straight path and a second driving distance of the turning path according to the first size information of the at least two sub-areas; determining a third driving distance of the navigation path according to second size information of the target object in the target area; Determining the straight travel time according to the first travel distance; determining the turning time according to the second driving distance; The navigation duration is determined according to the third driving distance.

8. The path planning method according to claim 5, characterized in that: The step of determining the estimated driving time of each planned driving path according to the straight driving time, the turning time, and the navigation time corresponding to each planned driving path includes: The sum of the straight driving time, the turning time and the navigation time corresponding to each planned driving path is determined as the estimated driving time.

9. The path planning method according to any one of claims 1 to 4, characterized in that: After updating at least one of the at least two estimated driving durations according to the historical driving duration of the historical driving route, the method includes: The path information of each planned driving path and the updated estimated driving duration are sent to the terminal so that the terminal can display the path information and the estimated driving duration.

10. The path planning method according to claim 9, characterized in that: After sending the path information of each planned driving path and the updated estimated driving duration to the terminal, the method further includes: When the path selection information returned by the terminal is received, the target path is updated according to the path selection information.

11. A path planning device, characterized in that: Applied to a self-moving cleaning device, the path planning device comprises: A determination module, configured to determine an estimated driving time corresponding to each of the at least two planned driving paths when at least two planned driving paths are acquired; An updating module, configured to update at least one of the at least two estimated driving durations according to a historical driving duration of a historical driving route; The screening module is used to screen a target path of the at least two planned driving paths according to the updated at least two estimated driving times.

12. A path planning device, characterized in that: include: A memory on which programs or instructions are stored; A processor, configured to implement the steps of the path planning method as described in any one of claims 1 to 10 when executing the program or instruction.

13. A computer program product, characterized in that When the computer program product is executed by a processor, the steps of the path planning method according to any one of claims 1 to 10 are implemented.

14. A readable storage medium having a program or instruction stored thereon, characterized in that: When the program or instruction is executed by a processor, the steps of the path planning method according to any one of claims 1 to 10 are implemented.

15. A self-propelled cleaning device, characterized in that: include: The path planning device as claimed in claim 11 or 12; and / or A computer program product as claimed in claim 13; and / or The readable storage medium of claim 14.