Route dynamic allocation method, equipment and medium for unmanned sweeper

Abstract

A method for dynamically assigning routes of unmanned sweepers provided by the present invention includes obtaining several sweeping routes of an area to be cleaned; obtaining vehicle position information of several sweepers; Distribute to the corresponding sweeper, and obtain the vehicle status information and route completion information of the sweeper; filter out the sweeper that has completed the cleaning task as the completed sweeper according to the route completion information, and filter out the sweeper according to the preset filtering rules and route completion information. Overloaded sweepers, according to the route completion information, re-divide the unfinished cleaning routes corresponding to the overloaded sweepers into temporary operation routes with the same number of completed sweepers, and assign all temporary operation routes to the corresponding ones according to the preset distance priority rule. Completed on the sweeper. The dynamic route allocation method of the driverless sweeper of the present invention avoids the situation that the operation is delayed or cannot be completed.

Description

technical field [0001] The invention relates to the field of sweepers, in particular to a method, equipment and medium for dynamic route allocation of unmanned sweepers. Background technique [0002] As unmanned sweepers replace traditional sweepers, the high performance of unmanned sweepers turns traditional low-efficiency cleaning into high-efficiency cleaning, and the distribution of sweeper operation routes determines the overall work efficiency. At present, the assignment of the operation route is specific. When the sweeper fails or other uncertain factors, the operation will be delayed or cannot be completed. SUMMARY OF THE INVENTION [0003] In order to overcome the deficiencies of the prior art, one of the objectives of the present invention is to provide a dynamic route allocation method for an unmanned sweeper, which can solve the problem that the current assignment of the operation route is specific, and when the sweeper fails or other Uncertainties cause probl...

AI Technical Summary

Problems solved by technology

[0003] In order to overcome the deficiencies in the prior art, one of the objectives of the present invention is to provide a dynamic route allocation method for unmanned sweeping vehicles, which can solve the problem that the current assignment of working routes is specific, and when the sweeping vehicle breaks down or other When there are uncertain factors, it will cause the problem that the job will be delayed or cannot be completed

[0004] The second object of the present invention is to provide an electronic device, which can solve the problem that the current allocation of operation routes is specific, and when the cleaning vehicle breaks down or other uncertain factors, the operation will be delayed or cannot be completed. question

[0005] The third object of the present invention is to provide a computer-readable storage medium, which can solve the problem that the current allocation of operation routes is specific, and when the cleaning vehicle breaks down or other uncertain factors, the operation will be delayed or cannot be completed. the problem of the situation

Images