Route dynamic allocation method and equipment for unmanned sweeper and medium

Abstract

The invention provides a route dynamic allocation method of an unmanned sweeper. The method comprises the steps: acquiring a plurality of sweeping routes of a to-be-swept area; acquiring vehicle position information of a plurality of sweepers; according to a preset distance priority rule and the vehicle position information, distributing the sweeping route to a corresponding sweeper, and obtainingvehicle state information and route completion information of the sweeper; according to the route completion information, screening out the motor sweeper completing the sweeping task as a completed motor sweeper; screening out the overload sweeper according to a preset screening rule and the route completion information; and according to the route completion information, dividing the uncompletedcleaning routes corresponding to the overload sweeper into temporary operation routes with the same number as the completed sweepers again, and according to a preset distance priority rule, distributing all the temporary operation routes to the corresponding completed sweepers. According to the route dynamic allocation method of the unmanned sweeper, the situation that operation is delayed or cannot be completed is avoided.

Description

technical field [0001] The invention relates to the field of sweeping vehicles, in particular to a method, equipment and medium for dynamic route allocation of unmanned sweeping vehicles. 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 operating routes determines the efficiency of the overall work efficiency. At present, the allocation of operation routes is specified. When the sweeper fails or other uncertain factors, the operation will be delayed or cannot be completed. Contents of the invention [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 veh...

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