The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jan. 05, 2021

Filed:

Dec. 12, 2018
Applicant:

Shenzhen Silver Star Intelligent Technology Co., Ltd., Guangdong, CN;

Inventors:

Xuyi Deng, Guangdong, CN;

Yuxi Liu, Guangdong, CN;

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G05D 1/02 (2020.01); G06F 16/901 (2019.01); B25J 9/16 (2006.01); G01C 21/20 (2006.01); A47L 9/28 (2006.01); A47L 11/40 (2006.01);
U.S. Cl.
CPC ...
G05D 1/0217 (2013.01); A47L 9/2852 (2013.01); A47L 11/4011 (2013.01); B25J 9/1664 (2013.01); G01C 21/20 (2013.01); G05D 1/0219 (2013.01); G05D 1/0274 (2013.01); G06F 16/9027 (2019.01); A47L 2201/04 (2013.01); G05D 2201/0203 (2013.01); G05D 2201/0215 (2013.01);
Abstract

A cleaning robot and a shortest path planning method based on a cleaning robot are disclosed, a plurality of cleaning lines are formed by controlling the cleaning robot to perform cleaning in an area according to a zigzag-shaped path; association information of midpoints of at least a part of the cleaning lines is recorded to form a node skeleton tree in which midpoints are represented by nodes, the association information of each midpoint includes: position information of a node corresponding to the midpoint, position information of a parent node, and information of the number of child nodes of the parent node; in the process of traversing upwardly from a current node or traversing upwardly from both a current node and a target node in the node skeleton tree, the node skeleton tree is compressed, so as to determine the shortest planned path from the current node to the target node.


Find Patent Forward Citations

Loading…