Large garbage cleaning method and system
By introducing intelligent task scheduling and grid path management into the cleaning robot management system, the difficulty of cleaning robots when facing large garbage is solved, efficient and continuous cleaning operations are achieved, and resource utilization is improved.
Patent Information
- Application Number
- CN202411240234.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-05
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-09-05
AI Technical Summary
The existing cleaning robot management system cannot effectively deal with large garbage when facing large amounts of garbage, resulting in interruption of cleaning operations, reducing efficiency and wasting resources.
By realizing intelligent task scheduling in the scheduling cloud platform, the cleaning robot can automatically request and configure appropriate robots to deal with large garbage, and use grid-based path management and optimization algorithms to dynamically adjust the cleaning path and resource allocation to ensure efficient and continuous cleaning operations .
It improves cleaning efficiency and resource utilization, avoids interruptions caused by insufficient capabilities of a single robot, and ensures the continuity and efficiency of cleaning operations.
Smart Images

Figure CN118760196B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to data processing technology, and in particular to a large garbage cleaning method and system. Background Art
[0002] In existing cleaning robot management systems, cleaning tasks are usually simply assigned to individual robots in a cleaning robot cluster, and each robot performs cleaning operations according to preset paths or instructions.
[0003] However, this traditional cleaning method has obvious limitations when facing large garbage. When the cleaning robot encounters large garbage that exceeds its cleaning capacity, it is often unable to handle it effectively, resulting in interruption of the cleaning operation, reduced cleaning efficiency, and possible waste of precious cleaning resources. Summary of the invention
[0004] The present application provides a large garbage cleaning method and system, which is used to automatically request allocation from the scheduling cloud platform when a cleaning robot encounters large garbage that exceeds its processing capacity, so as to dispatch an appropriate robot to handle it, thereby improving cleaning efficiency and reducing resource waste.
[0005] In a first aspect, the present application provides a large garbage cleaning method, which is applied to a cleaning robot management system, wherein the cleaning robot management system includes a cleaning robot cluster and a scheduling cloud platform, and each cleaning robot in the cleaning robot cluster; the method includes:
[0006] The scheduling cloud platform obtains a cleaning instruction for cleaning the area to be cleaned, and generates a cleaning instruction sequence according to the cleaning instruction. The scheduling cloud platform sends the cleaning instructions in the cleaning instruction sequence to each cleaning robot in the cleaning robot cluster, and the cleaning instructions in the cleaning instruction sequence include a cleaning path;
[0007] The first cleaning robot in the cleaning robot cluster cleans the first cleaning path in response to the first cleaning instruction in the cleaning instruction sequence;
[0008] On the first cleaning path, the first cleaning robot detects the presence of target garbage at the target position, and then uploads a first allocation request to the scheduling cloud platform, wherein the first allocation request includes the target position and size information of the target garbage, and the size of the target garbage in at least one direction is greater than a preset first size threshold, and the preset first size threshold is the upper limit size of the cleaning of the first cleaning robot;
[0009] The scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request, and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, the first updated cleaning instruction includes a first updated cleaning path, the first updated cleaning path includes the target position and at least part of the second cleaning path, the size of the target garbage in all directions is less than or equal to a preset second size threshold, and the preset second size threshold is the upper limit cleaning size of the second cleaning robot.
[0010] In the above scheme, the scheduling cloud platform generates a cleaning instruction sequence according to the cleaning instructions and distributes it to the cleaning robot cluster, realizing the intelligent scheduling of cleaning tasks. When the cleaning robot encounters target garbage larger than its upper cleaning limit, that is, when it encounters large garbage that exceeds the processing capacity of the cleaning robot, it can automatically request allocation from the scheduling cloud platform, so as to dispatch the appropriate robot to handle it, thereby improving the cleaning efficiency and reducing resource waste, thereby ensuring the continuity of the cleaning operation and avoiding cleaning interruptions caused by insufficient capacity of a single robot. It can be seen that the scheduling cloud platform can reallocate cleaning tasks according to garbage size information, ensuring that the most suitable cleaning robot handles garbage of a specific size, and improving resource utilization efficiency.
[0011] Optionally, the target position is at least a partial area in a target cleaning grid, the cleaning path includes a cleaning grid sequence consisting of at least one cleaning grid, and the target cleaning grid is one of the cleaning grids in a first cleaning grid sequence corresponding to the first cleaning path; correspondingly, the scheduling cloud platform generates a first update cleaning instruction in response to the first deployment request, including:
[0012] The scheduling cloud platform adds the target cleaning grid to the second cleaning grid sequence corresponding to the second cleaning path in response to the first deployment request to generate a second updated cleaning grid sequence;
[0013] The scheduling cloud platform generates the first update and sweep path according to the second update and sweep grid sequence.
[0014] In the above scheme, by dividing the cleaning area into grids and dynamically adjusting the cleaning path according to the grids that need to be cleaned, the flexibility and accuracy of the cleaning operation are improved, ensuring that large garbage can be handled in a timely manner, while avoiding repeated cleaning of areas that have already been cleaned. By adding the target cleaning grid to the cleaning grid sequence of the second cleaning robot, accurate scheduling of the cleaning task is achieved, ensuring the accuracy and efficiency of the cleaning path. In addition, the cleaning path is organized in the form of a cleaning grid sequence, making the allocation and execution of cleaning tasks more organized and easy to manage.
[0015] Optionally, the scheduling cloud platform generates the first update and sweep path according to the second update and sweep grid sequence, including:
[0016] The scheduling cloud platform obtains the first current cleaning grid of the second cleaning robot, and determines a second grid sequence to be cleaned according to the first current cleaning grid and the second cleaning grid sequence, wherein the second grid sequence to be cleaned includes a cleaning grid that is arranged after the first current cleaning grid in the second cleaning grid sequence and the first current cleaning grid;
[0017] The scheduling cloud platform generates the second update cleaning grid sequence according to the second to-be-cleaned grid sequence, so as to generate the first update cleaning path according to the second update cleaning grid sequence.
[0018] In the above scheme, the cleaning path is replanned according to the current position of the cleaning robot and the subsequent cleaning grid sequence, that is, the second grid sequence to be cleaned is determined, and an updated cleaning path is generated accordingly. This ensures that the cleaning robot can go to the new cleaning area along the optimal path after completing the current cleaning task, which helps to reduce the ineffective movement of the cleaning robot, reduce unnecessary movement and waiting time, and thus improve the overall cleaning efficiency.
[0019] Optionally, the scheduling cloud platform generates the second updated cleaning grid sequence according to the second to-be-cleaned grid sequence, including:
[0020] The scheduling cloud platform cleans the grid according to the first current and the second sequence of grids to be cleaned determines the first sequence of grids to be cleaned;
[0021] The scheduling cloud platform cleans the grid according to the target and determining a minimum scheduling distance for the first sequence of grids to be cleaned;
[0022] The scheduling cloud platform selects the first to-be-cleaned grid sequence according to the minimum scheduling distance The corresponding first feature sweeping grid and the second feature sweeping grid are determined, and the target sweeping grid is added between the first feature sweeping grid and the second feature sweeping grid to generate the second updated sweeping grid sequence.
[0023] In the above scheme, by calculating the minimum dispatch distance and determining the insertion position of the target cleaning grid accordingly, the extra moving distance of the cleaning robot during the deployment process is reduced, the dispatch cost is reduced, and the cleaning efficiency and energy utilization are improved. In addition, by dynamically adjusting the cleaning path, the intelligent dispatch of cleaning tasks is realized, which improves the overall cleaning efficiency of the system.
[0024] Optionally, before the scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, it also includes:
[0025] The scheduling cloud platform determines a candidate cleaning robot cluster from the cleaning robot cluster according to the size information of the target garbage, wherein the cleaning upper limit size of the candidate cleaning robots in the candidate cleaning robot cluster is greater than or equal to the size of the target garbage in all directions;
[0026] The scheduling cloud platform obtains the current remaining power and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster;
[0027] The scheduling cloud platform determines the priority feature value according to the current estimated remaining operating time and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster;
[0028] The scheduling cloud platform determines the second cleaning robot according to the priority characteristic values corresponding to each candidate cleaning robot in the candidate cleaning robot cluster, and the second cleaning robot is the candidate cleaning robot with the largest priority characteristic value in the candidate cleaning robot cluster.
[0029] In the above scheme, suitable candidate cleaning robots are screened out from the cleaning robot cluster according to the size information of the target garbage, and then the priority characteristic value is calculated by considering the remaining power of the robot and the estimated remaining time to complete the cleaning, so as to select the optimal cleaning robot to perform the deployment task, avoiding task delays caused by insufficient power or mismatch of cleaning capabilities, improving the efficiency and safety of resource utilization, and achieving more effective task allocation.
[0030] Optionally, after uploading the first deployment request to the scheduling cloud platform, the method further includes:
[0031] The scheduling cloud platform deletes the target cleaning grid from the first cleaning grid sequence corresponding to the first cleaning path in response to the first allocation request to generate a first updated cleaning grid sequence;
[0032] The scheduling cloud platform generates a second updated cleaning path based on the first updated cleaning grid sequence, and sends the second updated cleaning path to the first cleaning robot.
[0033] In the above scheme, after the deployment task is completed, the target cleaning grid is deleted from the cleaning grid sequence of the first cleaning robot, thereby avoiding repeated execution of the cleaning task. In addition, an updated cleaning path is generated for the first cleaning robot to ensure that it can continue to perform the remaining cleaning tasks, thereby maintaining the continuity of the cleaning operation.
[0034] Optionally, after the scheduling cloud platform generates the second update and sweep path according to the first update and sweep grid sequence, the method further includes:
[0035] The scheduling cloud platform obtains a first current estimated remaining time to complete cleaning of the first cleaning robot on the second updated cleaning path, and a second current estimated remaining time to complete cleaning of the second cleaning robot on the first updated cleaning path;
[0036] If the difference between the second currently estimated remaining time to complete cleaning and the first currently estimated remaining time to complete cleaning is greater than a preset time difference threshold, at least one cleaning grid in the first updated cleaning path is added to the second updated cleaning path.
[0037] In the above scheme, by comparing the estimated remaining time for the two cleaning robots to complete their respective cleaning paths and adjusting the distribution of cleaning grids when necessary, the cleaning load is balanced, avoiding the situation where a cleaning robot is overloaded and affecting the overall cleaning progress. By dynamically adjusting the cleaning paths, it is ensured that all cleaning robots can complete the cleaning tasks at a similar progress, thereby improving the overall cleaning efficiency.
[0038] In a second aspect, the present application provides a cleaning robot management system, including: a cleaning robot cluster and a scheduling cloud platform, each cleaning robot in the cleaning robot cluster;
[0039] The scheduling cloud platform obtains a cleaning instruction for cleaning the area to be cleaned, and generates a cleaning instruction sequence according to the cleaning instruction. The scheduling cloud platform sends the cleaning instructions in the cleaning instruction sequence to each cleaning robot in the cleaning robot cluster, and the cleaning instructions in the cleaning instruction sequence include a cleaning path;
[0040] The first cleaning robot in the cleaning robot cluster cleans the first cleaning path in response to the first cleaning instruction in the cleaning instruction sequence;
[0041] On the first cleaning path, the first cleaning robot detects the presence of target garbage at the target position, and then uploads a first allocation request to the scheduling cloud platform, wherein the first allocation request includes the target position and size information of the target garbage, and the size of the target garbage in at least one direction is greater than a preset first size threshold, and the preset first size threshold is the upper limit size of the cleaning of the first cleaning robot;
[0042] The scheduling cloud platform generates an updated cleaning instruction in response to the first deployment request, and sends the updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, the updated cleaning instruction includes an updated cleaning path, the updated cleaning path includes the target position and at least part of the second cleaning path, the size of the target garbage in all directions is less than or equal to a preset second size threshold, and the preset second size threshold is the upper limit cleaning size of the second cleaning robot.
[0043] Optionally, the target position is at least a partial area in a target cleaning grid, the cleaning path includes a cleaning grid sequence consisting of at least one cleaning grid, and the target cleaning grid is one of the cleaning grids in a first cleaning grid sequence corresponding to the first cleaning path; correspondingly, the scheduling cloud platform generates a first update cleaning instruction in response to the first deployment request, including:
[0044] The scheduling cloud platform adds the target cleaning grid to the second cleaning grid sequence corresponding to the second cleaning path in response to the first deployment request to generate a second updated cleaning grid sequence;
[0045] The scheduling cloud platform generates the first update and sweep path according to the second update and sweep grid sequence.
[0046] Optionally, the scheduling cloud platform generates the first update and sweep path according to the second update and sweep grid sequence, including:
[0047] The scheduling cloud platform obtains the first current cleaning grid of the second cleaning robot, and determines a second grid sequence to be cleaned according to the first current cleaning grid and the second cleaning grid sequence, wherein the second grid sequence to be cleaned includes a cleaning grid that is arranged after the first current cleaning grid in the second cleaning grid sequence and the first current cleaning grid;
[0048] The scheduling cloud platform generates the second update cleaning grid sequence according to the second to-be-cleaned grid sequence, so as to generate the first update cleaning path according to the second update cleaning grid sequence.
[0049] Optionally, the scheduling cloud platform generates the second updated cleaning grid sequence according to the second to-be-cleaned grid sequence, including:
[0050] The scheduling cloud platform cleans the grid according to the first current and the second sequence of grids to be cleaned determines the first sequence of grids to be cleaned;
[0051] The scheduling cloud platform cleans the grid according to the target and determining a minimum scheduling distance for the first sequence of grids to be cleaned;
[0052] The scheduling cloud platform selects the first to-be-cleaned grid sequence according to the minimum scheduling distance The corresponding first feature sweeping grid and the second feature sweeping grid are determined, and the target sweeping grid is added between the first feature sweeping grid and the second feature sweeping grid to generate the second updated sweeping grid sequence.
[0053] Optionally, before the scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, it also includes:
[0054] The scheduling cloud platform determines a candidate cleaning robot cluster from the cleaning robot cluster according to the size information of the target garbage, wherein the cleaning upper limit size of the candidate cleaning robots in the candidate cleaning robot cluster is greater than or equal to the size of the target garbage in all directions;
[0055] The scheduling cloud platform obtains the current remaining power and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster;
[0056] The scheduling cloud platform determines the priority feature value according to the current estimated remaining operating time and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster;
[0057] The scheduling cloud platform determines the second cleaning robot according to the priority characteristic values corresponding to each candidate cleaning robot in the candidate cleaning robot cluster, and the second cleaning robot is the candidate cleaning robot with the largest priority characteristic value in the candidate cleaning robot cluster.
[0058] Optionally, after uploading the first deployment request to the scheduling cloud platform, the method further includes:
[0059] The scheduling cloud platform deletes the target cleaning grid from the first cleaning grid sequence corresponding to the first cleaning path in response to the first allocation request to generate a first updated cleaning grid sequence;
[0060] The scheduling cloud platform generates a second updated cleaning path based on the first updated cleaning grid sequence, and sends the second updated cleaning path to the first cleaning robot.
[0061] Optionally, after the scheduling cloud platform generates the second update and sweep path according to the first update and sweep grid sequence, the method further includes:
[0062] The scheduling cloud platform obtains a first current estimated remaining time to complete cleaning of the first cleaning robot on the second updated cleaning path, and a second current estimated remaining time to complete cleaning of the second cleaning robot on the first updated cleaning path;
[0063] If the difference between the second currently estimated remaining time to complete cleaning and the first currently estimated remaining time to complete cleaning is greater than a preset time difference threshold, at least one cleaning grid in the first updated cleaning path is added to the second updated cleaning path.
[0064] In a third aspect, the present application provides an electronic device, including:
[0065] processor; and,
[0066] A memory, configured to store executable instructions of the processor;
[0067] The processor is configured to perform any possible method described in the first aspect by executing the executable instructions.
[0068] In a fourth aspect, the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement any possible method described in the first aspect.
[0069] The large garbage cleaning method and system provided by the present application generates a cleaning instruction sequence according to the cleaning instructions through the scheduling cloud platform, and distributes it to the cleaning robot cluster, thereby realizing the intelligent scheduling of cleaning tasks. When the cleaning robot encounters target garbage larger than its upper cleaning limit size, that is, when it encounters large garbage that exceeds the processing capacity of the cleaning robot, it can automatically request allocation from the scheduling cloud platform, thereby scheduling an appropriate robot to handle it, thereby improving the cleaning efficiency and reducing resource waste, thereby ensuring the continuity of the cleaning operation and avoiding cleaning interruptions caused by insufficient capacity of a single robot. It can be seen that the scheduling cloud platform can reallocate cleaning tasks according to garbage size information, ensuring that the most suitable cleaning robot handles garbage of a specific size, and improving resource utilization efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0070] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.
[0071] Figure 1 This is a flow chart of a large garbage cleaning method according to an exemplary embodiment of the present application;
[0072] Figure 2 This is a flow chart of a large garbage cleaning method according to another exemplary embodiment of the present application;
[0073] Figure 3 is a structural schematic diagram of a cleaning robot management system according to an exemplary embodiment of the present application;
[0074] Figure 4 It is a schematic diagram of the structure of an electronic device according to an exemplary embodiment of the present application.
[0075] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION
[0076] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.
[0077] In order to solve the above problems, in the embodiments provided in this application, an efficient, flexible and intelligent large-scale garbage cleaning method and system are provided, which are particularly suitable for cleaning scenarios that require the processing of garbage of various sizes and require efficient operation. This application constructs a cleaning robot management system, which includes a cleaning robot cluster and a scheduling cloud platform, to achieve accurate scheduling and dynamic optimization of cleaning tasks, thereby significantly improving cleaning efficiency and resource utilization efficiency. The following is a detailed description of the main concepts of the solution provided in the embodiments of this application:
[0078] Intelligent task scheduling: The embodiment of the present application realizes intelligent scheduling of cleaning tasks through a scheduling cloud platform. The scheduling cloud platform can automatically generate a cleaning instruction sequence based on the cleaning instructions, and accurately distribute these instructions to each cleaning robot in the cleaning robot cluster. This intelligent scheduling method not only improves the automation level of cleaning operations, but also ensures the orderly progress of cleaning tasks.
[0079] Dynamic task allocation: During the cleaning process, when the cleaning robot encounters target garbage that is larger than its upper cleaning limit, the task allocation mechanism can be automatically triggered. The cleaning robot will upload a deployment request to the scheduling cloud platform, including the target location and the size of the target garbage. After receiving the request, the scheduling cloud platform will reallocate the cleaning tasks based on the garbage size information and dispatch robots with corresponding cleaning capabilities to handle it. This dynamic task allocation mechanism ensures the continuity and efficiency of the cleaning operation and avoids cleaning interruptions caused by insufficient capabilities of a single robot.
[0080] Grid-based cleaning path management: In order to further improve cleaning efficiency and accuracy, a grid-based cleaning path management method is adopted. The cleaning area is divided into multiple grids, and the cleaning path is organized in the form of a cleaning grid sequence. The scheduling cloud platform can dynamically adjust the cleaning grid sequence according to the needs of the cleaning task and the status of the cleaning robot to generate the optimal cleaning path. This grid management method not only improves the flexibility of cleaning operations, but also makes the allocation and execution of cleaning tasks more organized and easy to manage.
[0081] Intelligent path optimization: When dynamically allocating cleaning tasks, the solution provided by the embodiment of the present application also realizes intelligent path optimization. The scheduling cloud platform will calculate the minimum scheduling distance based on the current position of the cleaning robot and the subsequent cleaning grid sequence, and determine the insertion position of the target cleaning grid accordingly. This intelligent path optimization algorithm reduces the additional moving distance of the cleaning robot during the deployment process, reduces the scheduling cost, and improves the cleaning efficiency and energy utilization.
[0082] Efficient resource allocation: In order to achieve efficient resource allocation, the solution provided in the embodiment of the present application also takes into account the remaining power of the cleaning robot and the estimated remaining time to complete the cleaning when scheduling the cleaning task. The scheduling cloud platform will calculate the priority characteristic value based on this information, and then select the optimal cleaning robot to perform the deployment task. This resource allocation method ensures that the cleaning task can be completed efficiently and safely, and avoids task delays caused by insufficient power or mismatched cleaning capabilities.
[0083] In summary, the solution provided in the embodiment of the present application provides a systematic large-scale garbage cleaning solution. This solution realizes efficient, flexible and intelligent management of cleaning tasks through the organic combination of multiple technical means such as cleaning robot management system, intelligent task scheduling, dynamic task allocation, grid cleaning path management, intelligent path optimization and efficient resource allocation. This systematic solution not only improves cleaning efficiency and resource utilization efficiency, but also significantly reduces cleaning costs, and has broad market application prospects.
[0084] Figure 1FIG. 1 is a flow chart of a large garbage cleaning method according to an exemplary embodiment of the present application. Figure 1 As shown, the method provided in this embodiment includes:
[0085] S101. The scheduling cloud platform obtains cleaning instructions for cleaning the area to be cleaned, and generates a cleaning instruction sequence according to the cleaning instructions.
[0086] The method provided in this embodiment can be applied to a cleaning robot management system. The cleaning robot management system includes a cleaning robot cluster and a scheduling cloud platform, and each cleaning robot in the cleaning robot cluster.
[0087] In this step, the scheduling cloud platform obtains cleaning instructions for cleaning the area to be cleaned, and generates a cleaning instruction sequence based on the cleaning instructions. The scheduling cloud platform sends the cleaning instructions in the cleaning instruction sequence to each cleaning robot in the cleaning robot cluster. The cleaning instructions in the cleaning instruction sequence include cleaning paths.
[0088] Specifically, the scheduling cloud platform in the cleaning robot management system first receives cleaning instructions from users or preset systems. The cleaning instructions contain specific information about the area to be cleaned, such as area range, cleaning priority, etc. The scheduling cloud platform automatically generates a cleaning instruction sequence based on these cleaning instructions using built-in algorithms and rules. The cleaning instruction sequence is a series of orderly cleaning instructions, each of which contains detailed information such as the cleaning path and cleaning order of the cleaning robot.
[0089] First, the entire area to be cleaned is divided into multiple sub-areas or cleaning grids. These grids can be divided based on area, shape or other specific attributes. Then, a cleaning priority is set for each grid. The priority can be determined based on a variety of factors, such as the density of garbage within the grid, the importance of the grid (such as proximity to entrances, main passages, etc.), whether the grid is frequently visited, etc.
[0090] For the above-mentioned path planning algorithm, Dijkstra algorithm, A search algorithm, genetic algorithm, artificial potential field method, grid method and minimum spanning tree algorithm can be used to generate the shortest path from the starting point to the end point, which can be used to plan the optimal cleaning path for each cleaning robot. In addition, when planning the path, the algorithm needs to consider the obstacles that may be encountered to ensure that the planned path is feasible and can avoid obstacles.
[0091] Specifically, the above-mentioned Dijkstra algorithm is an algorithm for finding the shortest path between nodes in a graph. It starts from a single source point and gradually expands to other nodes until the shortest path of all nodes is found. In the path planning of a cleaning robot, the Dijkstra algorithm can be used to calculate the shortest path from the starting point to each cleaning point in a known environment map. For the A search algorithm, it is an algorithm for finding a path with the lowest cost from the starting node to the target node in a path with multiple nodes on a graph plane. It combines the advantages of the best first search and the Dijkstra algorithm, and uses heuristic search to improve search efficiency. In the path planning of a cleaning robot, the A* algorithm can consider the layout of the room and the distribution of obstacles, and dynamically plan the optimal cleaning path. For the genetic algorithm, it is a search algorithm that simulates natural selection and genetics mechanisms. It gradually iterates to find the optimal solution through operations such as encoding, selection, crossover and mutation of candidate solutions. In the path planning of a cleaning robot, the genetic algorithm can be used to deal with complex optimization problems, such as multi-objective path planning, and find the global optimal solution through iterative evolution. For the artificial potential field method, an artificial potential field is constructed. The target point generates gravity on the robot, and the obstacle generates repulsion on the robot. The combined force of gravity and repulsion guides the robot to move to the target point and avoid obstacles. For the grid method, the cleaning area is divided into a series of grids of equal size, and the robot plans the path according to the state of the grid (passable or impassable). For the minimum spanning tree algorithm, a spanning tree with the smallest sum of edge weights is found in a weighted connected graph. In path planning, it can be used to optimize the cleaning path and reduce repeated cleaning. It can be combined with a graph database to dynamically update environmental information, adjust the cleaning path in real time, and improve cleaning efficiency.
[0092] It is worth noting that, for the path planning algorithm of the cleaning robot in this embodiment, any existing algorithm can be adopted, and the specific form of the type of the algorithm is not limited.
[0093] The scheduling cloud platform sends the generated cleaning instruction sequence to each cleaning robot in the cleaning robot cluster through wireless communication networks (such as Wi-Fi, 4G / 5G, etc.). After each cleaning robot receives its own cleaning instruction, it will parse the instruction content and prepare to perform the cleaning task.
[0094] To further illustrate, assume that the cleaning area is divided into a 10x10 grid, and each grid has a priority value (calculated based on historical data or real-time sensor data). The scheduling cloud platform automatically generates a cleaning instruction sequence using the following steps:
[0095] Initialization: Assign a starting grid and an empty task list to each cleaning robot.
[0096] Priority Sort: Sort all grids by priority from high to low.
[0097] Task Assignment:
[0098] Iterate over the sorted grid list.
[0099] For each grid, check if there is a cleaning robot that can go to that grid (taking into account the current position and remaining battery of the cleaning robot).
[0100] Select a cleaning robot that is nearest and has fewer tasks to go to the grid, and add the grid to the task list of the cleaning robot.
[0101] Update the cleaning robot's location and remaining battery power.
[0102] Path planning:
[0103] For each cleaning robot, the Dijkstra algorithm or A search algorithm is used to plan the shortest path from the current position to the next task grid.
[0104] The planned path is sent as a cleaning instruction to the corresponding cleaning robot.
[0105] Dynamic Adjustment:
[0106] The cleaning robot reports its status and encountered events in real time during the cleaning process.
[0107] The scheduling cloud platform dynamically adjusts the cleaning path or reallocates tasks based on reported events.
[0108] S102. The first cleaning robot in the cleaning robot cluster cleans the first cleaning path in response to the first cleaning instruction in the cleaning instruction sequence.
[0109] In this step, the first cleaning robot in the cleaning robot cluster (which can be any robot assigned a cleaning task) starts cleaning along the designated cleaning path according to the received first cleaning instruction. During the cleaning process, the robot will use built-in sensors and cameras to monitor the status of the cleaning area, including the type, size and distribution of garbage.
[0110] S103. On the first cleaning path, when the first cleaning robot detects the presence of target garbage at the target location, it uploads a first allocation request to the scheduling cloud platform.
[0111] On the first cleaning path, the first cleaning robot detects the presence of target garbage at the target position, and uploads a first allocation request to the scheduling cloud platform. The first allocation request includes the target position and the size information of the target garbage. The size of the target garbage in at least one direction is larger than a preset first size threshold. The preset first size threshold is the upper limit size of the cleaning of the first cleaning robot.
[0112] Specifically, during the cleaning process, if the first cleaning robot detects the presence of target garbage at the target location on its cleaning path, and the size of the target garbage in at least one direction is greater than the preset first size threshold (i.e., exceeds the upper limit size of the cleaning of the first cleaning robot), the robot will immediately stop cleaning at the location and upload the first dispatch request to the scheduling cloud platform. The dispatch request contains key data such as the specific coordinates of the target location, the size information of the target garbage, and the current status of the robot.
[0113] The first cleaning robot can be equipped with a variety of sensors, such as LiDAR, ultrasonic sensors, infrared sensors or visual sensors (such as cameras). These sensors continuously scan and monitor the surrounding environment, including garbage on the ground, during the cleaning process. When the robot detects possible target garbage, it adjusts the sensor's scanning mode or focuses on the target to obtain more detailed size information.
[0114] In one possible implementation, if equipped with a visual sensor (such as a high-definition camera), the cleaning robot may capture images of the target garbage and analyze these images through built-in image processing algorithms. The image processing algorithm may include functions such as edge detection, shape recognition, and size measurement to determine the size of the target garbage in the image. Based on the camera's viewing angle, focal length, and position information, the robot can convert the size in the image into the physical size in the actual environment.
[0115] In addition, in some cases, the robot can also assist in measuring the size of the target trash by physically touching or approaching it. For example, the robot can use a robotic arm or a retractable sensor probe to gently touch the edge or surface of the target trash to obtain its approximate size range. However, this method requires the robot to have precise motion control and obstacle avoidance capabilities to avoid damaging the target trash or the robot itself.
[0116] To improve the accuracy and reliability of size information, the robot may fuse data from multiple sensors. For example, it may combine distance measurement data from a lidar and image data from a vision sensor to produce a more accurate estimate of the size of the target garbage through algorithmic processing.
[0117] After obtaining the size information of the target garbage, the first cleaning robot will package this information and the target location information into a dispatch request and upload it to the dispatch cloud platform via wireless communication. The dispatch cloud platform will perform subsequent task dispatch and issue instructions based on this information.
[0118] S104. The scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request, and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster.
[0119] In this step, the scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request, and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, the first updated cleaning instruction includes a first updated cleaning path, the first updated cleaning path includes a target position and at least a portion of the second cleaning path, the size of the target garbage in all directions is less than or equal to a preset second size threshold, and the preset second size threshold is the upper limit cleaning size of the second cleaning robot.
[0120] Specifically, after receiving the first deployment request, the scheduling cloud platform will immediately parse and process the data in the request. First, the cloud platform will screen out candidate cleaning robot clusters that can handle the garbage from the cleaning robot cluster based on the size information of the target garbage. Then, the cloud platform will further consider factors such as the current remaining power of the candidate robot and the estimated remaining time to complete the cleaning, and use a preset algorithm to calculate the priority characteristic value of each candidate robot. Finally, the cloud platform will select the candidate cleaning robot with the highest priority characteristic value as the second cleaning robot and generate a first updated cleaning instruction for it. The updated cleaning instruction contains a new cleaning path (that is, including the target location and at least part of the current cleaning path of the second cleaning robot) and other necessary cleaning information.
[0121] The scheduling cloud platform sends the first updated cleaning instruction to the selected second cleaning robot through the wireless communication network. After receiving the updated cleaning instruction, the second cleaning robot will immediately adjust its cleaning path and cleaning plan and go to the target location to handle large garbage. At the same time, the first cleaning robot will also receive a notification from the scheduling cloud platform to understand the deployment results and continue to perform the remaining cleaning tasks.
[0122] In this embodiment, the scheduling cloud platform generates a cleaning instruction sequence according to the cleaning instructions and distributes it to the cleaning robot cluster, realizing intelligent scheduling of cleaning tasks. When the cleaning robot encounters target garbage larger than its upper cleaning limit size, that is, when it encounters large garbage that exceeds the processing capacity of the cleaning robot, it can automatically request allocation from the scheduling cloud platform, so as to dispatch an appropriate robot to handle it, thereby improving the cleaning efficiency and reducing resource waste, thereby ensuring the continuity of the cleaning operation and avoiding cleaning interruptions caused by insufficient capacity of a single robot. It can be seen that the scheduling cloud platform can reallocate cleaning tasks according to garbage size information, ensuring that the most suitable cleaning robot handles garbage of a specific size, and improving resource utilization efficiency.
[0123] Figure 2 FIG. 1 is a flow chart of a large garbage cleaning method according to another exemplary embodiment of the present application. Figure 2 As shown, the large garbage cleaning method provided in this embodiment includes:
[0124] S201. The scheduling cloud platform obtains cleaning instructions for cleaning the area to be cleaned, and generates a cleaning instruction sequence according to the cleaning instructions.
[0125] In this step, the scheduling cloud platform obtains cleaning instructions for cleaning the area to be cleaned, and generates a cleaning instruction sequence based on the cleaning instructions. The scheduling cloud platform sends the cleaning instructions in the cleaning instruction sequence to each cleaning robot in the cleaning robot cluster. The cleaning instructions in the cleaning instruction sequence include cleaning paths.
[0126] Specifically, the scheduling cloud platform in the cleaning robot management system first receives cleaning instructions from users or preset systems. The cleaning instructions contain specific information about the area to be cleaned, such as area range, cleaning priority, etc. The scheduling cloud platform automatically generates a cleaning instruction sequence based on these cleaning instructions using built-in algorithms and rules. The cleaning instruction sequence is a series of orderly cleaning instructions, each of which contains detailed information such as the cleaning path and cleaning order of the cleaning robot.
[0127] S202. The first cleaning robot in the cleaning robot cluster cleans the first cleaning path in response to the first cleaning instruction in the cleaning instruction sequence.
[0128] In this step, the first cleaning robot in the cleaning robot cluster (which can be any robot assigned a cleaning task) starts cleaning along the designated cleaning path according to the received first cleaning instruction. During the cleaning process, the robot will use built-in sensors and cameras to monitor the status of the cleaning area, including the type, size and distribution of garbage.
[0129] S203. On the first cleaning path, when the first cleaning robot detects the presence of target garbage at the target location, it uploads a first allocation request to the scheduling cloud platform.
[0130] On the first cleaning path, the first cleaning robot detects the presence of target garbage at the target position, and uploads a first allocation request to the scheduling cloud platform. The first allocation request includes the target position and the size information of the target garbage. The size of the target garbage in at least one direction is larger than a preset first size threshold. The preset first size threshold is the upper limit size of the cleaning of the first cleaning robot.
[0131] Specifically, during the cleaning process, if the first cleaning robot detects the presence of target garbage at the target location on its cleaning path, and the size of the target garbage in at least one direction is greater than the preset first size threshold (i.e., exceeds the upper limit size of the cleaning of the first cleaning robot), the robot will immediately stop cleaning at the location and upload the first dispatch request to the scheduling cloud platform. The dispatch request contains key data such as the specific coordinates of the target location, the size information of the target garbage, and the current status of the robot.
[0132] S204. The scheduling cloud platform determines a candidate cleaning robot cluster from the cleaning robot clusters according to the size information of the target garbage.
[0133] In this step, the scheduling cloud platform determines the candidate cleaning robot cluster from the cleaning robot cluster based on the size information of the target garbage. , the cleaning upper limit size of the candidate cleaning robots in the candidate cleaning robot cluster is greater than or equal to the size of the target garbage in all directions.
[0134] S205. The scheduling cloud platform obtains the current remaining power of each candidate cleaning robot in the candidate cleaning robot cluster and the current estimated remaining time to complete cleaning.
[0135] In this step, the scheduling cloud platform obtains the current remaining power of each candidate cleaning robot in the candidate cleaning robot cluster and the current estimated remaining time to complete cleaning.
[0136] S206. The scheduling cloud platform determines the priority characteristic value according to the current estimated remaining operating time and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster.
[0137] In this step, the scheduling cloud platform uses formula 2 and determines the priority feature value based on the current estimated remaining operating time of each candidate cleaning robot in the candidate cleaning robot cluster and the current estimated remaining time to complete the cleaning. , Formula 2 is:
[0138]
[0139] in, Candidate cleaning robot cluster Middle The priority feature value corresponding to the candidate cleaning robots, is the preset first weight factor, To preset the second weight factor, It is the preset operation safety factor.
[0140] It is worth noting that Formula 2 generates a comprehensive priority characteristic value for each candidate cleaning robot by comprehensively considering the current remaining power of the candidate cleaning robot (reflecting its endurance) and the current estimated remaining time to complete the cleaning (reflecting its current work progress and efficiency). This comprehensive evaluation method ensures that the selected cleaning robot is not only competent for the current cleaning task, but also able to maintain a high work efficiency for a period of time in the future. In addition, using the priority characteristic value calculated by Formula 2, the scheduling cloud platform can quickly determine the cleaning robot that is most suitable for performing the deployment task from the candidate cleaning robot cluster (that is, the cleaning robot with the largest priority characteristic value). This optimized task allocation method ensures the continuity and efficiency of the cleaning task, and avoids resource waste and cleaning interruption caused by improper task allocation. In addition, by dynamically adjusting the allocation of cleaning tasks, the scheduling cloud platform can ensure that all cleaning robots are in an efficient working state. This not only reduces the idle time of the cleaning robot, but also improves the completion speed and quality of the cleaning task, thereby improving the overall resource utilization efficiency. Moreover, the weight factors (preset first weight factor and preset second weight factor) in Formula 2 allow system administrators to adjust the weights of evaluation indicators according to actual needs, thereby enhancing the flexibility and configurability of the system. For example, in the case of power shortage, the weight of power can be appropriately increased to ensure that the cleaning robot will not be interrupted due to insufficient power when performing tasks. In addition, a preset operation safety factor is introduced in Formula 2 as a safety factor for evaluating the priority of the cleaning robot. This helps prevent potential risks caused by the cleaning robot's low power or expected completion time being too long, such as the robot's inability to return to the charging station, task delays, etc., thereby improving the overall safety and reliability of the system. Through the automated priority evaluation and selection process, Formula 2 reduces the need for manual decision-making and reduces the possibility of human error. This makes the operation of the cleaning robot management system more stable and reliable, while also reducing the system's maintenance costs and management difficulties.
[0141] S207. The scheduling cloud platform determines the second cleaning robot according to the priority characteristic values corresponding to each candidate cleaning robot in the candidate cleaning robot cluster.
[0142] In this step, the scheduling cloud platform allocates the candidate cleaning robot clusters The priority characteristic values corresponding to each candidate cleaning robot in the second cleaning robot are used to determine the second cleaning robot, and the second cleaning robot is a candidate cleaning robot cluster. The candidate cleaning robot with the largest medium priority eigenvalue.
[0143] S208. The scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request, and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster.
[0144] In this step, the scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request, and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, the first updated cleaning instruction includes a first updated cleaning path, the first updated cleaning path includes a target position and at least a portion of the second cleaning path, the size of the target garbage in all directions is less than or equal to a preset second size threshold, and the preset second size threshold is the upper limit cleaning size of the second cleaning robot.
[0145] Specifically, after receiving the first deployment request, the scheduling cloud platform will immediately parse and process the data in the request. First, the cloud platform will screen out candidate cleaning robot clusters that can handle the garbage from the cleaning robot cluster based on the size information of the target garbage. Then, the cloud platform will further consider factors such as the current remaining power of the candidate robot and the estimated remaining time to complete the cleaning, and use a preset algorithm to calculate the priority characteristic value of each candidate robot. Finally, the cloud platform will select the candidate cleaning robot with the highest priority characteristic value as the second cleaning robot and generate a first updated cleaning instruction for it. The updated cleaning instruction contains a new cleaning path (that is, including the target location and at least part of the current cleaning path of the second cleaning robot) and other necessary cleaning information.
[0146] In a possible implementation, the target location is at least a partial area in the target cleaning grid, the cleaning path includes a cleaning grid sequence composed of at least one cleaning grid, and the target cleaning grid is one of the cleaning grids in the first cleaning grid sequence corresponding to the first cleaning path. In response to the first deployment request, the scheduling cloud platform adds the target cleaning grid to the second cleaning grid sequence corresponding to the second cleaning path to generate a second updated cleaning grid sequence, and the scheduling cloud platform generates a first updated cleaning path according to the second updated cleaning grid sequence.
[0147] Furthermore, the scheduling cloud platform obtains the first current cleaning grid of the second cleaning robot, and determines the second grid sequence to be cleaned according to the first current cleaning grid and the second cleaning grid sequence, wherein the second grid sequence to be cleaned includes the cleaning grids arranged after the first current cleaning grid in the second cleaning grid sequence and the first current cleaning grid. The scheduling cloud platform generates a second updated cleaning grid sequence according to the second grid sequence to be cleaned, so as to generate a first updated cleaning path according to the second updated cleaning grid sequence.
[0148] Furthermore, the scheduling cloud platform is based on the first current cleaning grid And the second grid sequence to be cleaned Determine the first grid sequence to be cleaned ;
[0149] The scheduling cloud platform uses formula 1 and cleans the grid according to the target And the first grid sequence to be cleaned Determine the minimum dispatch distance , Formula 1 is:
[0150]
[0151] in, The first grid sequence to be cleaned Middle Grids to be cleaned Sweep the grid with the target The navigation distance between Clear the grid for the target The first grid sequence to be cleaned Middle Grids to be cleaned The navigation distance between
[0152] The scheduling cloud platform is based on the minimum scheduling distance From the first grid sequence to be cleaned The corresponding first feature sweeping grid and the second feature sweeping grid are determined, and the target sweeping grid is added between the first feature sweeping grid and the second feature sweeping grid to generate a second updated sweeping grid sequence.
[0153] It is worth noting that the above formula 1 calculates the navigation distance between the target cleaning grid and each to-be-cleaned grid in the first to-be-cleaned grid sequence, and comprehensively considers all possible path combinations, thereby accurately finding the minimum scheduling distance required to insert the target cleaning grid into the optimal position in the second cleaning path. This calculation not only ensures the rationality of the path, but also greatly reduces unnecessary movement of the cleaning robot during the deployment process, thereby improving the cleaning efficiency.
[0154] Determining the minimum scheduling distance is crucial to optimizing the cleaning path. By inserting the target cleaning grid between the first characteristic cleaning grid and the second characteristic cleaning grid, the scheduling cloud platform can generate a more efficient cleaning path. This not only shortens the cleaning time, but also ensures the continuity and integrity of the cleaning operation, avoiding cleaning interruptions or repeated cleaning problems caused by unreasonable paths.
[0155] Furthermore, using Formula 1 for path optimization can maximize the cleaning capabilities of the cleaning robot. By reducing ineffective movement and waiting time, the cleaning robot can complete more cleaning tasks in a shorter time, thereby improving resource utilization efficiency. This is particularly important for large-scale cleaning operations and helps reduce overall operating costs.
[0156] In addition, the application of formula 1 makes the cleaning path planning more flexible and adaptable. During the cleaning process, once large garbage or other emergencies require adjustment of the cleaning path, the scheduling cloud platform can quickly recalculate the minimum scheduling distance and generate a new cleaning path. This dynamic adjustment capability ensures the smooth progress of the cleaning operation and improves the robustness and reliability of the system.
[0157] On the basis of the above embodiment, after uploading the first deployment request to the scheduling cloud platform, the scheduling cloud platform can also respond to the first deployment request and delete the target cleaning grid from the first cleaning grid sequence corresponding to the first cleaning path to generate a first updated cleaning grid sequence. The scheduling cloud platform generates a second updated cleaning path according to the first updated cleaning grid sequence, and sends the second updated cleaning path to the first cleaning robot.
[0158] In addition, after the scheduling cloud platform generates the second updated cleaning path according to the first updated cleaning grid sequence, the scheduling cloud platform can obtain the first current estimated remaining time to complete cleaning of the first cleaning robot on the second updated cleaning path, and the second current estimated remaining time to complete cleaning of the second cleaning robot on the first updated cleaning path. If the difference between the second current estimated remaining time to complete cleaning and the first current estimated remaining time to complete cleaning is greater than the preset time difference threshold, at least one cleaning grid in the first updated cleaning path is added to the second updated cleaning path.
[0159] Figure 3 1 is a schematic diagram of a cleaning robot management system according to an exemplary embodiment of the present application. Figure 3 As shown, the cleaning robot management system 300 provided in this embodiment includes: a cleaning robot cluster 310 and a scheduling cloud platform 320, each cleaning robot in the cleaning robot cluster 310;
[0160] The scheduling cloud platform 320 obtains a cleaning instruction for cleaning the area to be cleaned, and generates a cleaning instruction sequence according to the cleaning instruction. The scheduling cloud platform 320 sends the cleaning instructions in the cleaning instruction sequence to each cleaning robot in the cleaning robot cluster 310. The cleaning instructions in the cleaning instruction sequence include a cleaning path.
[0161] The first cleaning robot in the cleaning robot cluster 310 cleans the first cleaning path in response to the first cleaning instruction in the cleaning instruction sequence;
[0162] On the first cleaning path, the first cleaning robot detects the presence of target garbage at the target position, and then uploads a first allocation request to the scheduling cloud platform 320, wherein the first allocation request includes the target position and size information of the target garbage, and the size of the target garbage in at least one direction is greater than a preset first size threshold, and the preset first size threshold is the upper limit size of the cleaning of the first cleaning robot;
[0163] The scheduling cloud platform 320 generates an updated cleaning instruction in response to the first deployment request, and sends the updated cleaning instruction to the second cleaning robot in the cleaning robot cluster 310, wherein the updated cleaning instruction includes an updated cleaning path, and the updated cleaning path includes the target position and at least a portion of the second cleaning path, and the size of the target garbage in all directions is less than or equal to a preset second size threshold, and the preset second size threshold is the upper limit cleaning size of the second cleaning robot.
[0164] Optionally, the target location is at least a partial area in a target cleaning grid, the cleaning path includes a cleaning grid sequence consisting of at least one cleaning grid, and the target cleaning grid is one of the cleaning grids in a first cleaning grid sequence corresponding to the first cleaning path; correspondingly, the scheduling cloud platform 320 generates a first update cleaning instruction in response to the first deployment request, including:
[0165] The scheduling cloud platform 320 adds the target cleaning grid to the second cleaning grid sequence corresponding to the second cleaning path in response to the first deployment request to generate a second updated cleaning grid sequence;
[0166] The scheduling cloud platform 320 generates the first update cleaning path according to the second update cleaning grid sequence.
[0167] Optionally, the scheduling cloud platform 320 generates the first update and sweep path according to the second update and sweep grid sequence, including:
[0168] The scheduling cloud platform 320 obtains the first current cleaning grid of the second cleaning robot, and determines a second grid sequence to be cleaned according to the first current cleaning grid and the second cleaning grid sequence, wherein the second grid sequence to be cleaned includes the cleaning grids in the second cleaning grid sequence that are arranged after the first current cleaning grid and the first current cleaning grid;
[0169] The scheduling cloud platform 320 generates the second update cleaning grid sequence according to the second to-be-cleaned grid sequence, so as to generate the first update cleaning path according to the second update cleaning grid sequence.
[0170] Optionally, the scheduling cloud platform 320 generates the second updated cleaning grid sequence according to the second to-be-cleaned grid sequence, including:
[0171] The scheduling cloud platform 320 is based on the first current cleaning grid and the second sequence of grids to be cleaned determines the first sequence of grids to be cleaned;
[0172] The scheduling cloud platform 320 cleans the grid according to the target and determining a minimum scheduling distance for the first sequence of grids to be cleaned;
[0173] The scheduling cloud platform 320 selects the first sequence of grids to be cleaned according to the minimum scheduling distance. The corresponding first feature sweeping grid and the second feature sweeping grid are determined, and the target sweeping grid is added between the first feature sweeping grid and the second feature sweeping grid to generate the second updated sweeping grid sequence.
[0174] Optionally, before the scheduling cloud platform 320 generates a first updated cleaning instruction in response to the first deployment request and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster 310, it also includes:
[0175] The scheduling cloud platform 320 determines a candidate cleaning robot cluster 310 from the cleaning robot cluster 310 according to the size information of the target garbage, wherein the cleaning upper limit size of the candidate cleaning robots in the candidate cleaning robot cluster 310 is greater than or equal to the size of the target garbage in all directions;
[0176] The scheduling cloud platform 320 obtains the current remaining power and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster 310;
[0177] The scheduling cloud platform 320 determines the priority feature value according to the current estimated remaining operating time and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster 310;
[0178] The scheduling cloud platform 320 determines the second cleaning robot according to the priority characteristic values corresponding to each candidate cleaning robot in the candidate cleaning robot cluster 310 , and the second cleaning robot is the candidate cleaning robot with the largest priority characteristic value in the candidate cleaning robot cluster 310 .
[0179] Optionally, after uploading the first deployment request to the scheduling cloud platform 320, the method further includes:
[0180] The scheduling cloud platform 320 deletes the target cleaning grid from the first cleaning grid sequence corresponding to the first cleaning path in response to the first deployment request to generate a first updated cleaning grid sequence;
[0181] The scheduling cloud platform 320 generates a second updated cleaning path according to the first updated cleaning grid sequence, and sends the second updated cleaning path to the first cleaning robot.
[0182] Optionally, after the scheduling cloud platform 320 generates the second update and sweep path according to the first update and sweep grid sequence, the method further includes:
[0183] The scheduling cloud platform 320 obtains a first current estimated remaining time to complete cleaning of the first cleaning robot on the second updated cleaning path, and a second current estimated remaining time to complete cleaning of the second cleaning robot on the first updated cleaning path;
[0184] If the difference between the second currently estimated remaining time to complete cleaning and the first currently estimated remaining time to complete cleaning is greater than a preset time difference threshold, at least one cleaning grid in the first updated cleaning path is added to the second updated cleaning path.
[0185] Figure 4 is a schematic diagram of the structure of an electronic device according to an exemplary embodiment of the present application. Figure 4 As shown, an electronic device 400 provided in this embodiment includes: a processor 401 and a memory 402; wherein:
[0186] The memory 402 is used to store computer programs, and the memory may also be a flash memory.
[0187] The processor 401 is used to execute the execution instructions stored in the memory to implement each step in the above method. For details, please refer to the relevant description in the above method embodiment.
[0188] Optionally, the memory 402 may be independent or integrated with the processor 401 .
[0189] When the memory 402 is a device independent of the processor 401, the electronic device 400 may further include:
[0190] The bus 403 is used to connect the memory 402 and the processor 401 .
[0191] This embodiment further provides a readable storage medium, in which a computer program is stored. When at least one processor of an electronic device executes the computer program, the electronic device executes the methods provided in the above-mentioned various implementation modes.
[0192] This embodiment also provides a program product, which includes a computer program stored in a readable storage medium. At least one processor of the electronic device can read the computer program from the readable storage medium, and at least one processor executes the computer program so that the electronic device implements the methods provided in the above various embodiments.
[0193] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any modification, use or adaptation of the present application, which follows the general principles of the present application and includes common knowledge or customary techniques in the art that are not disclosed in the present application. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the claims.
[0194] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.
Claims
1. A large garbage cleaning method, characterized in that: Applied to a cleaning robot management system, the cleaning robot management system includes a cleaning robot cluster and a scheduling cloud platform, and each cleaning robot in the cleaning robot cluster; the method includes: The scheduling cloud platform obtains a cleaning instruction for cleaning the area to be cleaned, and generates a cleaning instruction sequence according to the cleaning instruction. The scheduling cloud platform sends the cleaning instructions in the cleaning instruction sequence to each cleaning robot in the cleaning robot cluster, and the cleaning instructions in the cleaning instruction sequence include a cleaning path; The first cleaning robot in the cleaning robot cluster cleans the first cleaning path in response to the first cleaning instruction in the cleaning instruction sequence; On the first cleaning path, the first cleaning robot detects the presence of target garbage at the target position, and then uploads a first allocation request to the scheduling cloud platform, wherein the first allocation request includes the target position and size information of the target garbage, and the size of the target garbage in at least one direction is greater than a preset first size threshold, and the preset first size threshold is the upper limit size of the cleaning of the first cleaning robot; The scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request, and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, wherein the first updated cleaning instruction includes a first updated cleaning path, the first updated cleaning path includes the target position and at least a portion of the second cleaning path, the size of the target garbage in all directions is less than or equal to a preset second size threshold, and the preset second size threshold is the upper limit size of cleaning of the second cleaning robot; The target position is at least a partial area in the target cleaning grid, the cleaning path includes a cleaning grid sequence composed of at least one cleaning grid, and the target cleaning grid is one of the cleaning grids in the first cleaning grid sequence corresponding to the first cleaning path; correspondingly, the scheduling cloud platform generates a first update cleaning instruction in response to the first deployment request, including: The scheduling cloud platform adds the target cleaning grid to the second cleaning grid sequence corresponding to the second cleaning path in response to the first deployment request to generate a second updated cleaning grid sequence; The scheduling cloud platform generates the first update and sweep path according to the second update and sweep grid sequence.
2. The large garbage cleaning method according to claim 1, characterized in that: The scheduling cloud platform generates the first update and sweep path according to the second update and sweep grid sequence, including: The scheduling cloud platform obtains the first current cleaning grid of the second cleaning robot, and determines a second grid sequence to be cleaned according to the first current cleaning grid and the second cleaning grid sequence, wherein the second grid sequence to be cleaned includes a cleaning grid that is arranged after the first current cleaning grid in the second cleaning grid sequence and the first current cleaning grid; The scheduling cloud platform generates the second update cleaning grid sequence according to the second to-be-cleaned grid sequence, so as to generate the first update cleaning path according to the second update cleaning grid sequence.
3. The large garbage cleaning method according to claim 2, characterized in that: The scheduling cloud platform generates the second updated cleaning grid sequence according to the second to-be-cleaned grid sequence, including: The scheduling cloud platform cleans the grid according to the first current and the second sequence of grids to be cleaned determines the first sequence of grids to be cleaned; The scheduling cloud platform cleans the grid according to the target and determining a minimum scheduling distance for the first sequence of grids to be cleaned; The scheduling cloud platform selects the first to-be-cleaned grid sequence according to the minimum scheduling distance The corresponding first feature sweeping grid and the second feature sweeping grid are determined, and the target sweeping grid is added between the first feature sweeping grid and the second feature sweeping grid to generate the second updated sweeping grid sequence.
4. The large garbage cleaning method according to claim 3, characterized in that: Before the scheduling cloud platform generates a first updated cleaning instruction in response to the first deployment request and sends the first updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, the method further includes: The scheduling cloud platform determines a candidate cleaning robot cluster from the cleaning robot cluster according to the size information of the target garbage, wherein the cleaning upper limit size of the candidate cleaning robots in the candidate cleaning robot cluster is greater than or equal to the size of the target garbage in all directions; The scheduling cloud platform obtains the current remaining power and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster; The scheduling cloud platform determines the priority feature value according to the current estimated remaining operating time and the current estimated remaining time to complete cleaning of each candidate cleaning robot in the candidate cleaning robot cluster; The scheduling cloud platform determines the second cleaning robot according to the priority characteristic values corresponding to each candidate cleaning robot in the candidate cleaning robot cluster, and the second cleaning robot is the candidate cleaning robot with the largest priority characteristic value in the candidate cleaning robot cluster.
5. The large garbage cleaning method according to any one of claims 1 to 4, characterized in that: After uploading the first deployment request to the scheduling cloud platform, the method further includes: The scheduling cloud platform deletes the target cleaning grid from the first cleaning grid sequence corresponding to the first cleaning path in response to the first allocation request to generate a first updated cleaning grid sequence; The scheduling cloud platform generates a second updated cleaning path based on the first updated cleaning grid sequence, and sends the second updated cleaning path to the first cleaning robot.
6. The large garbage cleaning method according to claim 5, characterized in that: After the scheduling cloud platform generates the second update and sweep path according to the first update and sweep grid sequence, the method further includes: The scheduling cloud platform obtains a first current estimated remaining time to complete cleaning of the first cleaning robot on the second updated cleaning path, and a second current estimated remaining time to complete cleaning of the second cleaning robot on the first updated cleaning path; If the difference between the second currently estimated remaining time to complete cleaning and the first currently estimated remaining time to complete cleaning is greater than a preset time difference threshold, at least one cleaning grid in the first updated cleaning path is added to the second updated cleaning path.
7. A cleaning robot management system, characterized in that: include: A cleaning robot cluster and a scheduling cloud platform, each cleaning robot in the cleaning robot cluster; The scheduling cloud platform obtains a cleaning instruction for cleaning the area to be cleaned, and generates a cleaning instruction sequence according to the cleaning instruction. The scheduling cloud platform sends the cleaning instructions in the cleaning instruction sequence to each cleaning robot in the cleaning robot cluster, and the cleaning instructions in the cleaning instruction sequence include a cleaning path; The first cleaning robot in the cleaning robot cluster cleans the first cleaning path in response to the first cleaning instruction in the cleaning instruction sequence; On the first cleaning path, the first cleaning robot detects the presence of target garbage at the target position, and then uploads a first allocation request to the scheduling cloud platform, wherein the first allocation request includes the target position and size information of the target garbage, and the size of the target garbage in at least one direction is greater than a preset first size threshold, and the preset first size threshold is the upper limit size of the cleaning of the first cleaning robot; The scheduling cloud platform generates an updated cleaning instruction in response to the first deployment request, and sends the updated cleaning instruction to the second cleaning robot in the cleaning robot cluster, wherein the updated cleaning instruction includes an updated cleaning path, wherein the updated cleaning path includes the target position and at least a portion of the second cleaning path, and the size of the target garbage in all directions is less than or equal to a preset second size threshold, and the preset second size threshold is the upper limit size of the cleaning of the second cleaning robot; The target position is at least a partial area in the target cleaning grid, the cleaning path includes a cleaning grid sequence composed of at least one cleaning grid, and the target cleaning grid is one of the cleaning grids in the first cleaning grid sequence corresponding to the first cleaning path; correspondingly, the scheduling cloud platform generates a first update cleaning instruction in response to the first deployment request, including: The scheduling cloud platform adds the target cleaning grid to the second cleaning grid sequence corresponding to the second cleaning path in response to the first deployment request to generate a second updated cleaning grid sequence; The scheduling cloud platform generates the first update and sweep path according to the second update and sweep grid sequence.
8. An electronic device, characterized in that: include: processor; as well as, A memory, configured to store executable instructions of the processor; The processor is configured to perform the method of any one of claims 1 to 6 by executing the executable instructions.
9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 6 when executed by a processor.
