Methods and systems of distributing task areas for cleaning devices, and cleaning devices

Patent metadata

Field	Value
Publication number	US-10816989-B2
Application number	US-201816180237-A
Country	US
Kind code	B2
Filing date	Nov 5, 2018
Priority date	Jun 27, 2018
Publication date	Oct 27, 2020
Grant date	Oct 27, 2020

Abstract

A method of distributing task areas, adapted to a cleaning device, is provided, including: receiving a task map; obtaining a shape that corresponds to the task map; dividing the task map into a plurality of sub-regions according to a plurality of recesses in the shape; merging the two adjacent sub-regions that have a common long side or short side, and obtaining a plurality of merge results that correspond to each of the merge actions; calculating a plurality of cleaning times for each of the merge results for the cleaning device; selecting the merge result that has the shortest cleaning times as a first distribution result; and enabling the cleaning device to perform a cleaning task according to the first distribution result.

First claim

What is claimed is:

1. A method of distributing task areas, adapted to a cleaning device, comprising:
receiving a task map;
obtaining a shape that corresponds to the task map;
dividing the task map into a plurality of sub-regions according to a plurality of recesses in the shape;
merging the two adjacent sub-regions that have a common long side or short side, and obtaining a plurality of merge results that correspond to each of the merge actions;
calculating a plurality of cleaning times for each of the merge results for the cleaning device;
selecting the merge result that has the shortest cleaning times as a first distribution result;
enabling the cleaning device to perform a cleaning task according to the first distribution result.

2. The method as claimed in claim 1 , further comprising:
calculating the cleaning time according to a first formula or a second formula according to the number of cleaning units on the short side of the sub-region;
wherein when the number of cleaning units on the short side is an odd number, the cleaning time is calculated using the first formula, and the first formula is expressed as:
T total =2 XT +( XY− 1) L +√{square root over (1+( Y− 2) 2 )}* L

wherein when the number of cleaning units on the short side is an even number, the cleaning time is calculated using the second formula, and the second formula is expressed as:
T total =2 XT+XYL

wherein T total is the cleaning time, X is the number of cleaning units on the short sides, Y is the number of cleaning units on the long side, T is the time required for the cleaning device to turn, and L is the time required for the cleaning device to clean one cleaning unit.

3. A system of distributing task areas, adapted to a cleaning device, comprising:
a control terminal, comprising:
a first storage unit, storing a task map;
a first processing unit for:
obtaining a shape that corresponds to the task map;
dividing the task map into a plurality of sub-regions according to a plurality of recesses in the shape;
merging the two adjacent sub-regions that have a common long side or short side, and obtaining a plurality of merge results that correspond to each of the merge actions;
calculating a plurality of cleaning times for each of the merge results for the cleaning device;
selecting the merge result that has the shortest cleaning times as a first distribution result; and
at least one cleaning device, comprising:
a second storage unit, storing the first distribution result received from the control terminal;
a second processing unit, performing a cleaning task according to the first distribution result.

4. The system as claimed in claim 3 , wherein:
the first processing unit further calculates the cleaning time according to a first formula or a second formula according to the number of cleaning units on the short side of the sub-region;
when the number of cleaning units on the short side is an odd number, the cleaning time is calculated using the first formula, and the first formula is expressed as:
T total =2 XT +( XY− 1) L +√{square root over (1+( Y− 2) 2 )}* L

wherein when the number of cleaning units on the short side is an even number, the cleaning time is calculated using the second formula, and the second formula is expressed as:
T total =2 XT+XYL

wherein T total is the cleaning time, X is the number of cleaning units on the short sides, Y is the number of cleaning units on the long side, T is the time required for the cleaning device to turn, and L is the time required for the cleaning device to clean one cleaning unit.

5. A cleaning device, comprising:
a storage unit, storing a task map;
a processing unit for:
obtaining a shape that corresponds to the task map;
dividing the task map into a plurality of sub-regions according to a plurality of recesses in the shape;
merging the two adjacent sub-regions that have a common long side or short side, and obtaining a plurality of merge results that correspond to each of the merge actions;
calculating a plurality of cleaning times for each of the merge results;
selecting the merge result that has the shortest cleaning times as a first distribution result; and
performing a cleaning task according to the first distribution result.

6. The cleaning device as claimed in claim 5 , wherein:
the processing unit further calculates the cleaning time according to a first formula or a second formula according to the number of cleaning units on the short side of the sub-region;
when the number of cleaning units on the short side is an odd number, the cleaning time is calculated using the first formula, and the first formula is expressed as:
T total =2 XT +( XY− 1) L +√{square root over (1+( Y− 2) 2 )}* L

wherein when the number of cleaning units on the short side is an even number, the cleaning time is calculated using the second formula, and the second formula is expressed as:
T total =2 XT+XYL

wherein T total is the cleaning time, X is the number of cleaning units on the short sides, Y is the number of cleaning units on the long side, T is the time required for the cleaning device to turn, and L is the time required for the cleaning device to clean one cleaning unit.

Assignees

• Quanta Comp Inc

Inventors

• Chen Yu-Ching
• Hsu Tao-Chih
• Wang yang-sheng
• Chen Chun-Ting

Classifications

• G06Q10/06311 Primary

  Scheduling, planning or task assignment for a person or group · CPC title

• A47L2201/04

  Automatic control of the travelling movement; Automatic obstacle detection · CPC title

• G06Q10/047

  Optimisation of routes or paths, e.g. travelling salesman problem · CPC title

• B25J9/0003

  Home robots, i.e. small robots for domestic use · CPC title

• A47L11/4011

  Regulation of the cleaning machine by electric means; Control systems and remote control systems therefor · CPC title