ROBOT CLEANER AND METHOD FOR CONTROLLING THE SAME
First Claim
Patent Images
1. A robot cleaner comprising:
- a driving unit to drive at least one wheel to move the robot cleaner;
a control unit to divide an area to be cleaned into a plurality of sub-areas so as to calculate a full path based on connection points between the sub-areas or based on a travel path within each sub-area and the connection points, and control the driving unit; and
a storage unit to store the travel path within each sub-area, the connection points between the sub-areas, and the full path.
1 Assignment
0 Petitions
Accused Products
Abstract
Disclosed are a robot cleaner and a method for controlling the same. The robot cleaner and method of the present invention involve dividing the whole area to be cleaned into sub-areas, and easily calculating a full path using travel paths in the sub-areas and connection points between sub-areas, and in the event the whole area to be cleaned is extended or an area which has not been cleaned is found, do not involve regenerating the whole map for cleaning, but rather easily updating the full path using the pre-stored travel path in the sub-areas and the connection points between sub-areas.
17 Citations
15 Claims
-
1. A robot cleaner comprising:
-
a driving unit to drive at least one wheel to move the robot cleaner; a control unit to divide an area to be cleaned into a plurality of sub-areas so as to calculate a full path based on connection points between the sub-areas or based on a travel path within each sub-area and the connection points, and control the driving unit; and a storage unit to store the travel path within each sub-area, the connection points between the sub-areas, and the full path. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method for controlling a robot cleaner comprising:
-
searching for an area to be cleaned; dividing the area to be cleaned into a plurality of sub-areas; generating travel paths within the sub-areas, respectively; generating connection points between the sub-areas; storing sub-area information including the travel paths within the sub-areas and the connection points between the sub-areas; and calculating a full path based on the connection points, or based on the travel paths within the sub-areas and the connection points. - View Dependent Claims (11, 12, 13, 14, 15)
-
Specification