Cleaning robot and shortest path planning method based on cleaning robot

Abstract

The invention discloses a cleaning robot and a shortest path planning method based on the cleaning robot. The shortest path planning method comprises the steps of controlling the cleaning robot to clean a region according to a shape of a Chinese character 'gong' to form multiple cleaning lines; recording midpoint association information of at least part of the cleaning lines so as to form a node skeleton tree with midpoints being represented by nodes, wherein the midpoint association information comprises location information of the node corresponding to each midpoint, location information ofa father node and number information of child nodes of the father node; and compressing the node skeleton tree in the process of traversing upward from the current node in the node skeleton tree or inthe process of traversing upward from the current node and a target node in the node skeleton tree so as to determine the shortest planned path from the current node to the target node. The shortestpath planning method has the advantages that the algorithm is low in time complexity, the occupied storage space is small, and the consumed operation time is less.

Description

technical field [0001] The invention relates to the technical field of cleaning robots, in particular to a cleaning robot and a cleaning robot-based shortest path planning method. Background technique [0002] With the improvement of people's living standards and the acceleration of the pace of life, more and more middle-class people want to be freed from the heavy work of indoor cleaning, and choose to buy cleaning robots to help them solve their daily cleaning problems. The cleaning efficiency and cleaning coverage of cleaning robots are one of the core focuses of consumers, and the cleaning coverage largely determines the quality of the cleaning effect. [0003] Cleaning robots currently on the market are roughly divided into random cleaning types and path planning types. Since the random cleaning robot does not have an internal map, the quality of the cleaning path depends on the quality of the random planning algorithm. Most of the random cleaning robots have low clean...

AI Technical Summary

Problems solved by technology

[0005] The technical problem to be solved by the present invention lies in the problems of high algorithm time complexity, large storage space consumption, and excessive time consumption when planning the shortest path for the cleaning robot, and provides a cleaning robot and the shortest path planning based on the cleaning robot method

Images