Base station position recommendation method
By obtaining the feature points of the environmental map in the cleaning robot system and simulating the cleaning completion location, the base station location recommendation is optimized, and the problem of waste time and secondary pollution of the cleaning robot shuttle back and forth is solved, improving cleaning efficiency and work efficiency.
Patent Information
- Application Number
- CN202410969262.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-19
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-07-19
AI Technical Summary
After cleaning, the cleaning robot is inappropriate in base station location, which wastes time when shuttles back and forth and may cause secondary pollution to the ground.
By obtaining feature points in the environment map, the expected cleaning completion position of the cleaning robot is simulated, and the distance between each feature point is calculated, and the target feature points that meet the preset conditions are determined as the recommended location of the base station to optimize the cleaning robot's return path.
Reduces the length of the path that the cleaning robot moves after cleaning tasks, improves work efficiency, and avoids secondary pollution to the ground and cleaned areas.
Smart Images

Figure CN119073844A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the technical field of smart devices, and in particular to a method for recommending base station locations. Background Art
[0002] A cleaning robot is an intelligent device that can assist users in cleaning their home environment. When working, the cleaning robot needs to interact with multiple base stations. For example, when there is a first base station with water supply and drainage + self-cleaning functions, and a second base station with charging + dust collection + drying functions in the home, the robot needs to return to the first base station for water supply and drainage and self-cleaning after completing cleaning the ground, and then go from the first base station to the second base station for charging, dust collection and drying.
[0003] However, if the base station is not properly placed at home, the robot may shuttle back and forth in the user's home after cleaning to go to different base stations to perform various functions such as replenishing water, draining sewage, and charging. This will not only waste a lot of time, but also may cause secondary pollution to the floor and the mop that has been cleaned. Summary of the invention
[0004] In order to solve the above technical problems, the present disclosure provides a base station location recommendation method.
[0005] The present disclosure provides a base station location recommendation method, which is applied to a cleaning robot system, wherein the cleaning robot system includes a cleaning robot, a first base station and a second base station. After cleaning is completed, the cleaning robot first goes to the second base station and then to the first base station for maintenance, and is characterized in that it includes:
[0006] Acquire at least one first feature point and at least one second feature point in the environment map, wherein the first feature point corresponds to the installation requirement of the first base station, and the second feature point corresponds to the installation requirement of the second base station;
[0007] Simulating an estimated cleaning completion position of the cleaning robot according to the first feature point, the second feature point, and an interaction rule between the cleaning robot and a base station;
[0008] Calculating a first distance between each of the estimated cleaning completion positions and each of the second feature points, and a second distance between each of the second feature points and each of the first feature points;
[0009] According to the first distance and the second distance, a target feature point satisfying a preset condition is respectively determined in the at least one first feature point and the at least one second feature point as a recommended position of the corresponding base station.
[0010] In some embodiments, simulating the estimated cleaning completion position of the cleaning robot according to the first feature point, the second feature point, and the interaction rule between the cleaning robot and the base station includes:
[0011] Determining whether the interaction rule is a target rule according to the interaction sequence between the cleaning robot and the first base station and the second base station during the cleaning task;
[0012] If yes, then each of the second feature points is used as a starting point for global path planning, and each estimated cleaning completion position corresponding to the cleaning robot after completing the cleaning task is simulated;
[0013] If not, each of the first feature points is used as a starting point for global path planning, and each estimated cleaning completion position corresponding to the cleaning robot after completing the cleaning task is simulated.
[0014] In some embodiments, determining whether the interaction rule is a target rule includes:
[0015] If the interaction rule includes that the cleaning robot first goes to the second base station when starting the cleaning task, then determining that the interaction rule is a target rule;
[0016] If the interaction rule includes that the cleaning robot does not go to the second base station first when starting the cleaning task, it is determined that the interaction rule is not a target rule.
[0017] In some embodiments, the simulation obtains each estimated cleaning completion position corresponding to the cleaning robot completing the cleaning task, including:
[0018] Determining a cleaning order of the cleaning robot for the multiple areas to be cleaned according to a global cleaning path planning strategy;
[0019] According to the cleaning sequence, determining a last cleaning area among the multiple areas to be cleaned;
[0020] Simulating a cleaning path of the cleaning robot in the last cleaning area;
[0021] The final position of the cleaning robot on the cleaning path in the final cleaning area is used as the estimated cleaning completion position corresponding to the cleaning robot completing the cleaning task.
[0022] In some embodiments, the determining, according to the first distance and the second distance, a target feature point satisfying a preset condition from among the plurality of the first feature points and the second feature points as a recommended position of the corresponding base station, includes:
[0023] For any first feature point, summing the first distance and the second distance corresponding to any first feature point and each of the second feature points;
[0024] The minimum value after the summation is taken as the first minimum distance value corresponding to any one of the first feature points;
[0025] Determine a minimum value among the first minimum distance values corresponding to each of the first feature points;
[0026] The first feature point corresponding to the minimum value is used as the first target feature point, and the second feature point corresponding to the minimum value is used as the second target feature point.
[0027] In some embodiments, determining, according to the first distance and the second distance, a target feature point satisfying a preset condition from among the plurality of first feature points and the second feature points as a recommended position of the corresponding base station includes:
[0028] For any first feature point, summing the first distance and the second distance corresponding to any first feature point and each of the second feature points;
[0029] The minimum value after the summation is taken as the first minimum distance value corresponding to any one of the first feature points;
[0030] Determine a second distance to the target corresponding to a first minimum distance value of any first feature point;
[0031] For each first feature point, weighting the target second distance and the first minimum distance to obtain a corresponding third distance value;
[0032] The target feature point is determined according to the third distance value with the smallest value.
[0033] In some embodiments, the first base station is used to charge the cleaning robot, and the first characteristic point is a power socket; the second base station is used to collect sewage discharged by the cleaning robot and / or provide clean water to the cleaning robot, and the second characteristic point is at least one of a faucet and a sewer pipe.
[0034] In some embodiments, the acquiring at least one first feature point and at least one second feature point in the environment map includes:
[0035] Acquire the environment map by an image acquisition device;
[0036] The power socket of the environmental map is marked as the first feature point, and the faucet and / or the sewer pipe is marked as the second feature point.
[0037] In some embodiments, the acquiring at least one first feature point and at least one second feature point in the environment map includes:
[0038] Capturing an environment map through an image acquisition device, and acquiring a first mark and a second mark drawn by a user in the environment map;
[0039] At least one of the first feature points and at least one of the second feature points in an environment map are determined according to the first mark and the second mark.
[0040] In some embodiments, acquiring at least one first feature point and at least one second feature point in the environment map comprises:
[0041] Obtain obstacle information in the environment map;
[0042] Determining room attributes of each room in the environment map according to the obstacle information;
[0043] At least one of the first feature points and at least one of the second feature points are determined based on the room attribute.
[0044] Compared with the prior art, the technical solution provided by the embodiments of the present disclosure has the following advantages:
[0045] According to the base station location recommendation method of the embodiment of the present disclosure, suitable installation locations in the environmental map can be identified as feature points based on the installation requirements of each base station. By simulating the cleaning completion position when each feature point is used as the starting point and the interaction logic between the cleaning robot and the base station, the return path distance of the cleaning robot after cleaning is calculated, thereby selecting the optimal feature point of the return path as the recommended position of the corresponding base station, ensuring that the cleaning robot has a relatively short repeated path when performing a cleaning task and after a cleaning task, thereby improving work efficiency and avoiding secondary pollution to the ground and the mop that has been cleaned.
[0046] When simulating the expected cleaning completion position of the cleaning robot, the interaction rules between the cleaning robot and the base station are considered, and different base stations are used as the starting point of global path planning to improve the accuracy of the simulated cleaning completion position, so that the base station position can be recommended more reasonably.
[0047] When determining the recommended position of the base station, by taking the distance between the expected cleaning completion position and the second feature point, the distance between the first feature point and the second feature point, and the shortest feature point as the recommended position of the corresponding base station, the moving path of the cleaning robot can be made shortest when returning to the station after completing the cleaning task, thereby improving the work efficiency of the cleaning robot.
[0048] When determining the recommended position of the base station, the distance between the first feature point and the second feature point, the distance between the expected cleaning completion position and the second feature point, and the sum of the distances between the first feature point and the second feature point are comprehensively considered. This can make the moving path of the cleaning robot relatively short when returning to the station after completing the cleaning task, while reducing the moving path of the cleaning robot from the second base station to the first base station after cleaning is completed, thereby reducing secondary pollution. BRIEF DESCRIPTION OF THE DRAWINGS
[0049] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale.
[0050] Figure 1 A flowchart of a base station location recommendation method provided by an embodiment of the present disclosure;
[0051] Figure 2 A schematic diagram of a global cleaning path planning strategy provided by an embodiment of the present disclosure;
[0052] Figure 3a A schematic diagram of another global cleaning path planning strategy provided by an embodiment of the present disclosure;
[0053] Figure 3b A schematic diagram of another global cleaning path planning strategy provided by an embodiment of the present disclosure;
[0054] Figure 4 A schematic diagram of the structure of a base station location recommendation device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION
[0055] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.
[0056] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.
[0057] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.
[0058] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.
[0059] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".
[0060] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.
[0061] In order to solve the above problems, the present disclosure provides a method for recommending base station locations. Figures 1 to 3a 3b describes in detail the base station location recommendation method provided in the embodiments of the present disclosure.
[0062] Figure 1 A flow chart of a base station location recommendation method provided in an embodiment of the present disclosure is shown.
[0063] In an embodiment of the present disclosure, the base station location recommendation method can be applied to a cleaning robot system, which includes a cleaning robot, a first base station and a second base station. After cleaning, the cleaning robot first goes to the second base station and then to the first base station for maintenance. The base station location recommendation method can be executed by an electronic device. The electronic device can be a device including a cleaning robot, a workstation, various devices, etc.
[0064] like Figure 1 As shown, the base station location recommendation method may include the following steps.
[0065] S110. Acquire at least one first feature point and at least one second feature point in the environment map, where the first feature point corresponds to the installation requirement of the first base station, and the second feature point corresponds to the installation requirement of the second base station.
[0066] In an embodiment of the present disclosure, the electronic device may acquire at least one first feature point and at least one second feature point in an environment map.
[0067] Optionally, the environment map may be a map corresponding to the working environment of the cleaning robot.
[0068] Optionally, the first characteristic point corresponds to the installation requirements of the first base station, and the first base station can be used to charge the cleaning robot. For example, the first base station can be a main base station with drying, dust collection, and charging functions, and the first characteristic point can be a power socket.
[0069] Optionally, the second characteristic point corresponds to the installation requirements of the second base station. The second base station can be used to collect sewage discharged by the cleaning robot and / or provide clean water for the cleaning robot. For example, the second base station can be a secondary base station with water supply and drainage and self-cleaning functions, and the second characteristic point can be at least one of a faucet and a sewer pipe.
[0070] Specifically, the electronic device can obtain at least one first feature point and at least one second feature point in the environmental map during the mapping process, for example, obtaining a first feature point (power socket) corresponding to a first base station used to install charging the cleaning robot, and obtaining a second feature point (faucet and sewer pipe) corresponding to a second base station used to collect sewage discharged by the cleaning robot and / or provide clean water to the cleaning robot.
[0071] S120. Simulate the estimated cleaning completion position of the cleaning robot according to the first feature point, the second feature point, and the interaction rules between the cleaning robot and the base station.
[0072] In the disclosed embodiment, the electronic device can determine the interaction rules between the cleaning robot and the first base station and the second base station. According to the interaction rules, each first feature point or each second feature point is used as a starting point to simulate and obtain each expected cleaning completion position corresponding to the cleaning robot after completing the cleaning task.
[0073] Optionally, the interaction rule may be a logic rule for characterizing the interaction between the cleaning robot and the first base station and the second base station.
[0074] Specifically, the electronic device can determine the interaction rules between the cleaning robot and the first base station and the second base station, such as determining the order in which the cleaning robot interacts with the first base station and the second base station, performing operations, etc.
[0075] Optionally, the cleaning task may be a task of cleaning various rooms assigned to the cleaning robot.
[0076] Optionally, the estimated cleaning completion position may be a terminal position predicted by the cleaning robot after performing global path planning on each room assigned to be cleaned.
[0077] Specifically, the electronic device can simulate, based on the interaction rules, each of the first feature points as a starting point, or each of the second feature points as a starting point, to obtain each of the expected cleaning completion positions corresponding to the cleaning robot after completing the cleaning task.
[0078] S130, calculating the first distance between each of the estimated cleaning completion positions and each of the second feature points, and calculating the second distance between each of the second feature points and each of the first feature points.
[0079] In the embodiment of the present disclosure, after obtaining each estimated cleaning completion position, the electronic device can calculate the first distance between each estimated cleaning completion position and each second feature point, and calculate the second distance between each second feature point and each first feature point.
[0080] Optionally, the first distance may be the shortest path length between the estimated cleaning completion position and the second feature point.
[0081] Optionally, the second distance may be the shortest path length between the second feature point and the first feature point.
[0082] Specifically, after obtaining each estimated cleaning completion position, the electronic device can calculate the first distance between each estimated cleaning completion position and each second feature point, and calculate the second distance between each second feature point and each first feature point through the global path planning A* algorithm.
[0083] Among them, the evaluation function expression of the global path planning A* algorithm is:
[0084] f(n)=g(n)+h(n).
[0085] in,
[0086]
[0087] In the above formula, x and y represent the horizontal and vertical coordinates respectively, f(n) is the cost evaluation function of the current position n (estimated cleaning completion position), g(n) is the actual cost of the cleaning robot from the initial position (first feature point) to the current position n, and h(n) is the estimated cost of the robot from the current position n to the target position g (second feature point).
[0088] S140. According to the first distance and the second distance, determine a target feature point that meets a preset condition in the at least one first feature point and the at least one second feature point as a recommended position of the corresponding base station.
[0089] In an embodiment of the present disclosure, the electronic device may determine, based on the first distance and the second distance, a target feature point that meets preset conditions among the at least one first feature point and the at least one second feature point, respectively, as a recommended position of the corresponding base station.
[0090] Optionally, the preset condition may be a pre-set condition that needs to be met.
[0091] Optionally, the target feature point may be a recommended installation location of a corresponding base station.
[0092] Specifically, after obtaining the first distance and the second distance, the electronic device can respectively determine a target feature point that meets the preset conditions in at least one first feature point and at least one second feature point as the recommended position of the corresponding base station. For example, the target feature point can be determined in at least one first feature point as the recommended position of the first base station, and the target feature point can be determined in at least one second feature point as the recommended position of the second base station.
[0093] Thus, in the disclosed embodiment, at least one first feature point and at least one second feature point in the environment map can be obtained, the first feature point corresponds to the installation requirement of the first base station, and the second feature point corresponds to the installation requirement of the second base station, then the interaction rules between the cleaning robot and the first base station and the second base station are determined, and then according to the interaction rules, each of the first feature points or each of the second feature points is used as a starting point to simulate and obtain each of the expected cleaning completion positions corresponding to the cleaning robot after completing the cleaning task, and calculate the first distance between each of the expected cleaning completion positions and each of the second feature points, and calculate the second distance between each of the second feature points and each of the first feature points, and finally, according to the first distance and the second distance, the target feature point that meets the preset conditions is determined in the at least one first feature point and the at least one second feature point as the recommended position of the corresponding base station, thereby determining the target feature point with the preset conditions in the at least one first feature point and the at least one second feature point, so that the target feature point is used as the recommended position of the corresponding base station, ensuring that the cleaning robot moves the shortest repetitive path when performing the cleaning task and after the cleaning task, improving work efficiency, and avoiding secondary pollution to the ground and the cleaned mop.
[0094] Optionally, a global path is planned on the map using a global path planning A* algorithm, specifically:
[0095] Step 1: Set the open list and close list to store the information of nodes that have not been visited and the information of nodes that have been visited respectively;
[0096] Step 2, when the search starts, the close list is empty. After visiting the start node, the node is deleted from the open list, the start node is added to the close list, and the global path planning A* algorithm is used to search repeatedly to find the target point;
[0097] Step 3, before reaching the target point, continue searching the adjacent nodes of the start node, and determine whether the searched new node is in the open list. If not, add the new node to the open list, use the cost evaluation function to calculate the cost value f of the new node, set the new node as the parent node of the current search node and add it to the close list; if it is in the open list, execute step 1.4;
[0098] Step 4: Use the cost evaluation function to calculate the cost value f of the new node, and compare it with the cost value f of the same node calculated last time, select the node with the smallest cost value f as the parent node of the next search point, and add the node with the smallest cost value f to the close list, and then continue to update the node information in the open list;
[0099] Step 5, loop step 3.1 to step 3.4 until the target position is reached. When the target point is traversed and added to the close list, the loop ends; if the open list is empty at this time, it means there is no path.
[0100] Optionally, S110 may specifically include: acquiring the environment map through an image acquisition device; marking the power socket in the environment map as the first feature point, and marking the faucet and / or the sewer pipe as the second feature point.
[0101] In the embodiment of the present disclosure, the electronic device may collect the environment map through an image collection device.
[0102] Furthermore, the electronic device may mark the power socket of the environment map as the first feature point, and mark the faucet and / or the sewer pipe as the second feature point.
[0103] Specifically, during the mapping process, the electronic device can collect images of the cleaning robot's surrounding environment through the cleaning robot's image acquisition device (such as a camera) to obtain an environmental map, and search for images that match the reference images of power sockets, faucets, and sewer pipes in the collected images, thereby marking the power socket as the first feature point in the environmental map, and marking the faucet and / or the sewer pipe as the second feature point.
[0104] Optionally, S110 may also specifically include: acquiring an environment map through an image acquisition device, and obtaining a first mark and a second mark drawn by a user in the environment map; and determining at least one first feature point and at least one second feature point in the environment map according to the first mark and the second mark.
[0105] In an embodiment of the present disclosure, the electronic device may capture an environment map through an image capture device, and obtain a first mark and a second mark drawn by a user in the environment map.
[0106] Optionally, the first mark may be a mark made by a user on a power socket in the environment map.
[0107] Optionally, the second mark may be a mark for the user on the environment map for the faucet and the sewer pipe.
[0108] Specifically, during the mapping process, the electronic device can capture images of the cleaning robot's surrounding environment through the cleaning robot's image acquisition device (such as a camera), obtain an environmental map and display it to the user in an application software (application, APP). The user can manually mark the locations of power sockets, faucets and sewer pipes on the environmental map to obtain a first mark and a second mark.
[0109] Further, the electronic device may determine at least one of the first feature points and at least one of the second feature points in the environment map according to the first mark and the second mark.
[0110] Specifically, after obtaining the first mark and the second mark of the user, the electronic device can determine at least one of the first feature points corresponding to the first mark and at least one of the second feature points corresponding to the second mark in the environment map.
[0111] Optionally, S110 may further specifically include: acquiring obstacle information in the environment map; determining room attributes of each room in the environment map according to the obstacle information; and determining at least one first feature point and at least one second feature point based on the room attributes.
[0112] In an embodiment of the present disclosure, the electronic device may obtain obstacle information in an environment map.
[0113] Optionally, the obstacle information may be the object type of the obstacle, for example, the obstacle information may be the object type of the obstacle, such as a bed, a coffee table, a sofa, etc.
[0114] Specifically, the electronic device can obtain obstacle information in the environment map by performing image recognition through a camera.
[0115] Furthermore, the electronic device may determine room attributes of each room in the environment map according to the obstacle information.
[0116] Optionally, the room attribute can be used to characterize the type of the room. For example, the room attribute can be a living room, a kitchen, a bathroom, a study, a bedroom, etc.
[0117] Specifically, the electronic device can determine the room attributes of each room in the environment map based on the obstacle information. For example, when the electronic device detects that the obstacle information is a bed, it can determine that the room attribute of the room is a bedroom; when the electronic device detects that the obstacle information is a coffee table or a sofa, it can determine that the room attribute of the room is a living room, etc.
[0118] Further, the electronic device may determine at least one of the first feature points and at least one of the second feature points based on the room attributes.
[0119] For example, the first base station needs to be set near the power socket, and the power socket (especially the unknown socket that is relatively low) is usually set in the living room, kitchen, bathroom, balcony, study, etc. (the first base station (charging, drying and dust collection base station) has a large drying and dust collection noise, and the user is less likely to place it in the bedroom, so the bedroom is excluded). Therefore, according to the room attributes, the center point of the living room, kitchen, bathroom, balcony, and study or the midpoint of the door can be used as the first feature point.
[0120] For another example, the second base station needs to be set up near the faucet and sewer pipe, but usually faucets and sewer pipes may only exist in the kitchen, bathroom, and balcony. Therefore, according to the room attributes, the center point of the room or the midpoint of the door of the kitchen, bathroom, and balcony can be used as the second feature point.
[0121] Therefore, the feature points can be determined in a variety of ways, which facilitates the subsequent accurate determination of the base station installation location.
[0122] Optionally, S120 may specifically include: determining whether the interaction rule is a target rule according to an interaction sequence between the cleaning robot and the first base station and the second base station in a cleaning task;
[0123] If yes, then each of the second feature points is used as a starting point for global path planning, and each estimated cleaning completion position corresponding to the cleaning robot after completing the cleaning task is simulated;
[0124] If not, each of the first feature points is used as a starting point for global path planning, and each estimated cleaning completion position corresponding to the cleaning robot after completing the cleaning task is simulated.
[0125] In some disclosed embodiments, if the cleaning robot goes to the second base station when starting the cleaning task, the electronic device may determine that the interaction rule is a target rule.
[0126] Specifically, if the cleaning robot goes to the second base station when starting the cleaning task, for example, in order to prevent the water in the clean water tank of the cleaning robot from producing bacteria when the user does not use it for a long time, the cleaning robot can be set to store empty tanks, that is, the cleaning robot empties the clean water in the clean water tank after the cleaning task is completed and returns to the first base station for standby. When starting the cleaning task, the cleaning robot goes down from the first base station and needs to go to the second base station to refill with clean water before starting cleaning. The complete working path is to go down from the first base station, go to the second base station to refill with clean water, and then clean. After cleaning, go to the second base station to refill with clean water and discharge the sewage in the sewage box, clean the mop through the second base station, and empty the sewage again after cleaning (without refilling), and finally go to the first base station for charging, dust collection, and drying. Therefore, when the cleaning robot needs to go to the second base station when starting the cleaning task, the electronic device can determine that the interaction rule is the target rule.
[0127] In some other disclosed embodiments, if the cleaning robot does not go to the second base station when starting the cleaning task, the electronic device may determine that the interaction rule is not a target rule.
[0128] Specifically, if the cleaning robot does not go to the second base station when it starts the cleaning task, for example, in order to improve the cleaning efficiency of the cleaning robot, the cleaning robot can be set to carry water storage, that is, the cleaning robot fills up the clean water in the clean water tank after the cleaning task is completed and then returns to the first base station to standby. When starting the cleaning task, the cleaning robot immediately starts cleaning from the first base station. The complete working path is to start cleaning from the first base station, and then go to the second base station to fill up the clean water and discharge the sewage in the sewage box after cleaning, clean the mop through the second base station, and empty the sewage and fill up the clean water again after cleaning, and finally go to the first base station for charging, dust collection, and drying. Therefore, when the cleaning robot starts the cleaning task, it can start cleaning directly from the first base station without going to the second base station to replenish first, and the electronic device can determine that the interaction rule is not a target rule.
[0129] In some embodiments of the present disclosure, if the interaction rule between the cleaning robot and the base station is a target rule, each of the second feature points is used as the starting point of global path planning to simulate the expected cleaning completion positions corresponding to the cleaning robot after completing the cleaning task.
[0130] Specifically, if the interaction rule is a target rule, that is, the electronic device can determine that when starting a cleaning task, the cleaning robot needs to go to the second base station first, then the electronic device can use each of the second feature points (faucets, sewer pipes) as the starting point to simulate the expected cleaning completion positions corresponding to the cleaning robot after completing the cleaning task.
[0131] In some other embodiments of the present disclosure, if the interaction rule between the cleaning robot and the base station is not a target rule, each of the first feature points is used as a starting point for global path planning to simulate the expected cleaning completion positions corresponding to the cleaning robot after completing the cleaning task.
[0132] Specifically, if the interaction rule is not a target rule, that is, the electronic device can determine that the cleaning robot does not need to go to the second base station first when starting the cleaning task, then the electronic device can use each of the first feature points (power sockets) as the starting point to simulate the expected cleaning completion positions corresponding to the cleaning robot after completing the cleaning task.
[0133] Optionally, S120 may also specifically include: according to the interaction rules, taking each of the first feature points or each of the second feature points as the starting point, and determining the cleaning order of the cleaning robot for the multiple areas to be cleaned according to the global cleaning path planning strategy; according to the cleaning order, determining the last cleaning area among the multiple areas to be cleaned; simulating the cleaning path of the cleaning robot in the last cleaning area; and using the final position of the cleaning path of the cleaning robot in the last cleaning area as each of the expected cleaning completion positions.
[0134] In the disclosed embodiment, the electronic device may determine the cleaning order of the cleaning robot for the multiple areas to be cleaned according to the interaction rules, with each of the first feature points or each of the second feature points as a starting point and according to a global cleaning path planning strategy.
[0135] Optionally, the global cleaning path planning strategy may be a strategy for planning a cleaning path when the cleaning robot performs a cleaning task. For example, the global cleaning path planning strategy may include at least one of a global optimal path cleaning strategy, a cleaning strategy from far to near, and a cleaning strategy from near to far.
[0136] Among them, when the global cleaning path planning strategy is the global optimal path cleaning strategy, in order to pursue the highest cleaning efficiency, the electronic device will take the partition where the first feature point or the second feature point is located as the starting partition, and plan with the shortest distance between the partitions as the main reference factor, and solve the global shortest path from the starting partition to traverse other partitions and then return to the starting partition through solutions such as greedy algorithms.
[0137] Among them, when the global cleaning path planning strategy is a cleaning strategy from far to near or a cleaning strategy from near to far, in order to avoid secondary contamination of the cleaned area, the electronic device will use the spatial position relationship between the rooms, such as the distance between the first feature point or the second feature point and the target point of each other room (usually the midpoint of the room door of each room) as the main reference factor.
[0138] Specifically, when the cleaning robot performs a cleaning task, it needs to plan the corresponding cleaning path in advance. The electronic device can simulate the cleaning robot according to the interaction rule when the first interaction rule is used and determines the cleaning order of the cleaning robot for multiple areas to be cleaned when the cleaning task is performed with each of the second feature points as the starting point, or simulate the cleaning robot according to the second interaction rule when the cleaning task is performed with each of the first feature points as the starting point and determines the cleaning order of the cleaning robot for multiple areas to be cleaned.
[0139] Figure 2 A schematic diagram of a global cleaning path planning strategy provided by an embodiment of the present disclosure is shown.
[0140] like Figure 2 As shown, the distances from the cleaning starting point to the target points of room 1, room 2, room 3, and room 4 are d1, d2, d3, and d4 respectively, and satisfy d1>d2>d3>d4. When the global cleaning path planning strategy adopted by the cleaning robot is a far and near cleaning strategy, the robot cleans the partitions in the order of room 1, room 2, room 3, and room 4; when the global cleaning path planning strategy adopted by the robot is a near and far cleaning strategy, the robot cleans the partitions in the order of room 4, room 3, room 2, and room 1.
[0141] Furthermore, the electronic device may determine the last cleaning area among the multiple areas to be cleaned according to the cleaning sequence.
[0142] For example, continue to refer to Figure 2 When the cleaning order is room 1, room 2, room 3, room 4, it is determined that the last cleaned area among the multiple areas to be cleaned is room 4; when the cleaning order is room 4, room 3, room 2, room 1, it is determined that the last cleaned area among the multiple areas to be cleaned is room 1.
[0143] Furthermore, the electronic device may simulate a cleaning path of the cleaning robot in the last cleaning area, and use the final position of the cleaning path of the cleaning robot in the last cleaning area as each of the estimated cleaning completion positions.
[0144] Figure 3a , 3b A schematic diagram of another global cleaning path planning strategy provided by an embodiment of the present disclosure is shown.
[0145] As shown in the figure, after determining the last cleaning area (room 1), the electronic device can simulate the trajectory of the machine along the wall by fitting the room contour line and obstacle contour line of the room into a polygon, such as Figure 3a As shown, the midpoint of the room door is taken as the starting point, and the coverage direction and cost function of the room are determined according to the edge translation strategy. The cleaning path planning of the room is determined according to the coverage direction and cost function, and the final position of the cleaning robot in the room (cleaning completion position) is obtained, that is, the expected cleaning completion position, as shown in Figure 3b shown.
[0146] Optionally, S140 may specifically include: for any first feature point, summing the first distance and the second distance corresponding to any first feature point and each second feature point; taking the minimum value after the summation as the first minimum distance value corresponding to any first feature point; determining the minimum value among the first minimum distance values corresponding to each of the first feature points; taking the first feature point corresponding to the minimum value as the first target feature point, and taking the second feature point corresponding to the minimum value as the second target feature point.
[0147] In the embodiment of the present disclosure, the electronic device may, for any first feature point, sum the first distance and the second distance corresponding to any first feature point and each of the second feature points.
[0148] Specifically, after obtaining the first distance and the second distance, the electronic device can, for any first feature point, sum the first distance and the second distance corresponding to the first feature point and each second feature point, that is, calculate the sum of the first distance L1 and the second distance L2.
[0149] Furthermore, the electronic device may use the minimum value after the summation as the first minimum distance value corresponding to any of the first feature points, that is, use the minimum value after the summation (L1+L2)min as the first minimum distance value corresponding to any of the first feature points.
[0150] Furthermore, the electronic device may determine the minimum value among the first minimum distance values corresponding to the first feature points, that is, compare the first minimum distance values (L1+L2)min corresponding to the first feature points to determine the minimum value among the first minimum distance values.
[0151] Finally, the electronic device uses the first feature point corresponding to the minimum value as the first target feature point, and uses the second feature point corresponding to the minimum value as the second target feature point.
[0152] Therefore, by using the first target feature point and the second target feature point as the recommended positions of the corresponding base stations, the total walking length of the cleaning robot can be minimized, thereby improving the cleaning efficiency.
[0153] Optionally, S140 may also specifically include: for any first feature point, summing the first distance and the second distance corresponding to any first feature point and each second feature point; taking the minimum value after the summation as the first minimum distance value corresponding to any first feature point; determining the target second distance corresponding to the first minimum distance value of any first feature point; for each first feature point, weighting the target second distance and the first minimum distance to obtain a corresponding third distance value; and determining the target feature point according to the third distance value with the smallest numerical value.
[0154] In the embodiment of the present disclosure, the electronic device may, for any first feature point, sum the first distance and the second distance corresponding to any first feature point and each of the second feature points.
[0155] Specifically, after obtaining the first distance and the second distance, the electronic device can, for any first feature point, sum the first distance and the second distance corresponding to the first feature point and each second feature point, that is, calculate the sum of the first distance L1 and the second distance L2.
[0156] Furthermore, the electronic device may use the minimum value after the summation as the first minimum distance value corresponding to any of the first feature points, that is, use the minimum value after the summation (L1+L2)min as the first minimum distance value corresponding to any of the first feature points.
[0157] Next, the electronic device can determine the target second distance corresponding to the first minimum distance value of any first feature point, and for each first feature point, weight the target second distance and the first minimum distance to obtain the corresponding third distance value, and determine the target feature point based on the third distance value with the smallest value.
[0158] In some other implementations of this embodiment, after the cleaning robot obtains the environmental map, the user can view it through a mobile terminal such as a mobile phone or a tablet computer. After determining the recommended location of the base station, it can also be marked in the environmental map for the user to view. It can be understood by those skilled in the art that according to the technical solution disclosed in this application, when the interaction rules between the cleaning robot and the base station change (for example, the user can set whether the cleaning robot needs to go to the second base station for water replenishment before starting cleaning), the recommended location of the base station marked in the environmental map will also change.
[0159] Figure 4 A schematic structural diagram of a base station location recommendation device provided in an embodiment of the present disclosure is shown.
[0160] In some embodiments of the present disclosure, Figure 4 The base station location recommendation device shown may include a cleaning robot, a first base station and a second base station.
[0161] like Figure 4 As shown, the base station location recommendation device may include a processor 401 and a memory 402 storing computer program instructions.
[0162] Specifically, the processor 401 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or may be configured to implement one or more integrated circuits of the embodiments of the present application.
[0163] The memory 402 may include a large capacity memory for information or instructions. By way of example and not limitation, the memory 402 may include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a tape, or a universal serial bus (USB) drive or a combination of two or more of these. Where appropriate, the memory 402 may include a removable or non-removable (or fixed) medium. Where appropriate, the memory 402 may be inside or outside the integrated gateway device. In a particular embodiment, the memory 402 is a non-volatile solid-state memory. In a particular embodiment, the memory 402 includes a read-only memory (ROM). Where appropriate, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (Electrically Erasable Programmable ROM, EEPROM), an electrically rewritable ROM (EAROM) or a flash memory, or a combination of two or more of these.
[0164] The processor 401 reads and executes the computer program instructions stored in the memory 402 to perform the steps of the base station location recommendation method provided in the embodiment of the present disclosure.
[0165] In one example, the base station location recommendation device may further include a transceiver 403 and a bus 404. Figure 4 As shown, the processor 401, the memory 402 and the transceiver 403 are connected via a bus 404 and communicate with each other.
[0166] The bus 404 includes hardware, software, or both. For example, but not limitation, the bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Extended Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hyper Transport (HT) interconnect, an Industrial Standard Architecture (ISA) bus, an InfiniBand interconnect, a Low Pin Count (LPC) bus, a Memory bus, a MicroChannel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local Bus (VLB) bus, or other suitable buses or a combination of two or more of these. Where appropriate, the bus 404 may include one or more buses. Although embodiments of the present application describe and illustrate a particular bus, the present application contemplates any suitable bus or interconnect.
[0167] The embodiments of the present disclosure further provide a computer-readable storage medium, which may store a computer program. When the computer program is executed by a processor, the processor implements the base station location recommendation method provided by the embodiments of the present disclosure.
[0168] The above-mentioned storage medium may, for example, include a memory 402 of computer program instructions, and the above-mentioned instructions may be executed by the processor 401 of the base station location recommendation device to complete the base station location recommendation method provided by the embodiment of the present disclosure. Optionally, the storage medium may be a non-temporary computer-readable storage medium, for example, the non-temporary computer-readable storage medium may be a ROM, a random access memory (Random Access Memory, RAM), a compact disc read-only memory (Compact Disc ROM, CD-ROM), a magnetic tape, a floppy disk, and an optical data storage device, etc.
[0169] It should be noted that, in this article, relational terms such as "first" and "second" are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the term "comprising" is intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.
[0170] The above description is only a specific embodiment of the present disclosure, so that those skilled in the art can understand or implement the present disclosure. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present disclosure. Therefore, the present disclosure will not be limited to the embodiments described herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. A base station location recommendation method is applied to a cleaning robot system, wherein the cleaning robot system comprises a cleaning robot, a first base station and a second base station. After cleaning is completed, the cleaning robot first goes to the second base station and then to the first base station for maintenance, wherein: include: Acquire at least one first feature point and at least one second feature point in the environment map, wherein the first feature point corresponds to the installation requirement of the first base station, and the second feature point corresponds to the installation requirement of the second base station; Simulating an estimated cleaning completion position of the cleaning robot according to the first feature point, the second feature point, and an interaction rule between the cleaning robot and a base station; Calculating a first distance between each of the estimated cleaning completion positions and each of the second feature points, and a second distance between each of the second feature points and each of the first feature points; According to the first distance and the second distance, a target feature point satisfying a preset condition is respectively determined in the at least one first feature point and the at least one second feature point as a recommended position of the corresponding base station.
2. The method according to claim 1, characterized in that The simulating the estimated cleaning completion position of the cleaning robot according to the first feature point, the second feature point and the interaction rule between the cleaning robot and the base station includes: Determining whether the interaction rule is a target rule according to the interaction sequence between the cleaning robot and the first base station and the second base station during the cleaning task; If yes, then each of the second feature points is used as a starting point for global path planning, and each estimated cleaning completion position corresponding to the cleaning robot after completing the cleaning task is simulated; If not, each of the first feature points is used as a starting point for global path planning, and each estimated cleaning completion position corresponding to the cleaning robot after completing the cleaning task is simulated.
3. The method according to claim 2, characterized in that The determining whether the interaction rule is a target rule includes: If the interaction rule includes that the cleaning robot first goes to the second base station when starting the cleaning task, then determining that the interaction rule is a target rule; If the interaction rule includes that the cleaning robot does not go to the second base station first when starting the cleaning task, it is determined that the interaction rule is not a target rule.
4. The method according to claim 2, characterized in that: The simulation obtains each estimated cleaning completion position corresponding to the cleaning robot after completing the cleaning task, including: Determining a cleaning order of the cleaning robot for the multiple areas to be cleaned according to a global cleaning path planning strategy; According to the cleaning sequence, determining a last cleaning area among the multiple areas to be cleaned; Simulating a cleaning path of the cleaning robot in the last cleaning area; The final position of the cleaning robot on the cleaning path in the final cleaning area is used as the estimated cleaning completion position corresponding to the cleaning robot completing the cleaning task.
5. The method according to claim 1, characterized in that The determining, according to the first distance and the second distance, a target feature point satisfying a preset condition from among the plurality of the first feature points and the second feature points as a recommended position of the corresponding base station, includes: For any first feature point, summing the first distance and the second distance corresponding to any first feature point and each of the second feature points; The minimum value after the summation is taken as the first minimum distance value corresponding to any one of the first feature points; Determine a minimum value among the first minimum distance values corresponding to each of the first feature points; The first feature point corresponding to the minimum value is used as the first target feature point, and the second feature point corresponding to the minimum value is used as the second target feature point.
6. The method according to claim 1, characterized in that The determining, according to the first distance and the second distance, a target feature point satisfying a preset condition from among the plurality of the first feature points and the second feature points as a recommended position of the corresponding base station includes: For any first feature point, summing the first distance and the second distance corresponding to any first feature point and each of the second feature points; The minimum value after the summation is taken as the first minimum distance value corresponding to any one of the first feature points; Determine a second distance to the target corresponding to a first minimum distance value of any first feature point; For each first feature point, weighting the target second distance and the first minimum distance to obtain a corresponding third distance value; The target feature point is determined according to the third distance value with the smallest value.
7. The method according to claim 1, characterized in that The first base station is used to charge the cleaning robot, and the first characteristic point is a power socket; the second base station is used to collect sewage discharged by the cleaning robot and / or provide clean water for the cleaning robot, and the second characteristic point is at least one of a faucet and a sewer pipe.
8. The method according to claim 7, characterized in that The obtaining of at least one first feature point and at least one second feature point in the environment map comprises: Acquire the environment map by an image acquisition device; The power socket of the environmental map is marked as the first feature point, and the faucet and / or the sewer pipe is marked as the second feature point.
9. The method according to claim 7, characterized in that: The obtaining of at least one first feature point and at least one second feature point in the environment map comprises: Capturing an environment map through an image acquisition device, and acquiring a first mark and a second mark drawn by a user in the environment map; At least one of the first feature points and at least one of the second feature points in an environment map are determined according to the first mark and the second mark.
10. The method according to claim 1, characterized in that The acquiring of at least one first feature point and at least one second feature point in the environment map comprises: Obtain obstacle information in the environment map; Determining room attributes of each room in the environment map according to the obstacle information; At least one of the first feature points and at least one of the second feature points are determined based on the room attribute.
Citation Information
Patent Citations
Distributed base station
CN114027751A
Cleaning robot base station placement position recommendation method and electronic equipment
CN114745727A
Cleaning robot working method and device, cleaning robot and storage medium
CN116649851A
Robot automatic charging method and device, robot equipment and storage medium
CN117170365A
Installation position recommendation method and related equipment
CN118311624A
