# US 2021/0341932 A1 · Robot scheduling method

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0341932 A1
- Document ID: US20210341932A1
- Status: Published application
- Kind: A1
- Application number: 17/283,159
- Filed: 2019-11-09
- Published: 2021-11-04
- Earliest claimed: 2018-11-09
- Assignees: Suzhou Radiant Photovoltaic Technology Co., Ltd
- Applicants: Suzhou Radiant Photovoltaic Technology Co., Ltd
- Inventors: Jianxiang LU; Zhixiang WANG; Jianrong XU; Fei XU
- Web page: https://patentgrep.com/patent/US20210341932A1

## CPC

- B08B 13/00: Accessories or details of general applicability for machines or apparatus for cleaning
- B65G 67/02: Loading or unloading land vehicles
- G01G 19/021: {having electrical weight-sensitive devices (G01G19/04 - G01G19/07 take precedence)}
- G05D 1/0225: {involving docking at a fixed facility, e.g. base station or loading bay (parking aids B62D15/027)}
- G05D 1/0297: {by controlling means in a control room}
- G05D 1/661: Docking at a base station (delivering or retrieving payloads G05D1/667)
- H02S 40/10: Cleaning arrangements
- B63H 25/00: Steering; Slowing-down otherwise than by use of propulsive elements (using movably-installed outboard propulsion units B63H20/00); Dynamic anchoring, i.e. positioning vessels by means of main or auxiliary propulsive elements
- F24S 40/20: Cleaning; Removing snow
- G01C 21/20: Instruments for performing navigational calculations (G01C21/24, G01C21/26 take precedence)
- G05D 1/0217: {in accordance with energy consumption, time reduction or distance reduction criteria}
- G05D 1/644: Optimisation of travel parameters, e.g. of energy consumption, journey time or distance
- Y02E 10/40: Solar thermal energy, e.g. solar towers
- Y02E 10/50: Photovoltaic [PV] energy
- B08B: CLEANING IN GENERAL; PREVENTION OF FOULING IN GENERAL
- B65G: TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS (packaging B65B; handling thin or filamentary materials, e.g. paper sheets or thread, B65H; cranes B66C; portable mobile or lifting or hauling appliances, e.g. hoists, B66D; devices for lifting or lowering goods for loading or unloading purposes, e.g. fork-lift trucks, B66F9/00; emptying bottles, jars, casks, barrels or similar containers, not otherwise provided for, B67C9/00; delivering or transferring liquids B67D; filling or discharging vessels for liquefied, solidified or compressed gases F17C; pipe-line systems for fluids F17D)
- G01G: WEIGHING (sorting by weighing B07C5/16)
- G05D: SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- H02S: GENERATION OF ELECTRIC POWER BY CONVERSION OF INFRARED RADIATION, VISIBLE LIGHT OR ULTRAVIOLET LIGHT, e.g. USING PHOTOVOLTAIC [PV] MODULES (obtaining electrical energy from radioactive sources G21H1/12; light sensitive inorganic semiconductor devices H10F; light sensitive organic semiconductor devices H10K30/00; thermoelectric devices H10N10/00; pyroelectric devices H10N15/00)
- B63H: MARINE PROPULSION OR STEERING (propulsion of air-cushion vehicles B60V1/14; specially adapted for submarines, other than nuclear propulsion, B63G; specially adapted for torpedoes F42B19/00)
- F24S: SOLAR HEAT COLLECTORS; SOLAR HEAT SYSTEMS (for producing mechanical power from solar energy F03G6/00)
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- Y02E: REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION

## Abstract

A robot scheduling method. A robot comprises a cleaning robot for performing cleaning operations in a cleaning area, and a conveying robot for transporting the cleaning robot in an aisle area. The robot scheduling method comprises a task generating step, a task issuing step, a route planning step, a travel controlling step, and a conveying controlling step.

## Claims

### Claim 1

A robot scheduling method, wherein robots in the robot scheduling method comprises:
a cleaning robot configured to perform cleaning operations in a cleaning region; and
a conveying robot configured to transport the cleaning robot in an aisle region; and
wherein the robot scheduling method comprises following steps:
a task generating step for generating a conveying task instruction;
a task issuing step for issuing the conveying task instruction to the conveying robot;
a route planning step for planning an optimization route of the conveying robot;
a travel controlling step for controlling the conveying robot to travel along the optimization route; and
a docking controlling step for controlling the conveying robot to dock with the cleaning region.

### Claim 2 (depends on 1)

The robot scheduling method according to claim 1, wherein before performing the task generating step, the method further comprises following steps:
an operation region information acquiring step for acquiring operation region information, wherein an operation region comprises a plurality of cleaning regions and the aisle region between two or more cleaning regions, the operation region information comprises an operation region map and a location and a size of each of the cleaning regions in the operation region;
a task information acquiring step for acquiring operation task information, wherein the operation task information comprises a location, a size, and a workable time of the cleaning region that needs to be cleaned; and
a robot number calculating step for calculating a number of cleaning robots and conveying robots that need to be scheduled.

### Claim 3 (depends on 2)

The robot scheduling method according to claim 2, wherein the robot number calculating step comprises following steps:
a cleaning robot speed acquiring step for acquiring a travel speed of each of the cleaning robots;
a total area calculating step for calculating a total area that needs to be cleaned according to the size of the cleaning region that needs to be cleaned;
a total operating hours calculating step for calculating total operating hours required for the cleaning robots to complete all cleaning tasks according to the total area of the cleaning region that needs to be cleaned and the travel speed of each of the cleaning robots; and
a cleaning robot number calculating step for calculating the number of the cleaning robots that need to be scheduled according to the total operating hours and the workable time.

### Claim 4 (depends on 2)

The robot scheduling method according to claim 2, wherein the robot number calculating step comprises following steps:
a conveying robot speed acquiring step for acquiring a travel speed of each of the conveying robots;
a first docking region location acquiring step for acquiring a location of a first docking region of the cleaning region that needs to be cleaned according to the operation region map and the location and the size of the cleaning region that needs to be cleaned;
a total distance calculating step for calculating a total distance that all conveying robots need to travel according to initial storage locations of all conveying robots and the location of the first docking region of the cleaning region that needs to be cleaned;
a conveying robot number calculating step for calculating the number of the conveying robots that need to be scheduled according to the total distance and the travel speed of each of the conveying robots.

### Claim 5 (depends on 1)

The robot scheduling method according to claim 1, wherein the cleaning region is a solar panel or a solar panel array; and/or
wherein the cleaning region comprises:
a first docking region which is a region outside the cleaning region and adjacent to one side of the cleaning region; and
a second docking region which is a region inside the cleaning region and adjacent to one side of the cleaning region, and is opposite to the first docking region.

### Claim 6 (depends on 1)

The robot scheduling method according to claim 1, wherein before performing the task generating step, the method further comprises following steps:
a conveying robot monitoring step for acquiring a location and a load status of each conveying robot in real time, wherein the load status comprises a fully loaded state and an unloaded state;
a cleaning robot monitoring step for acquiring a real-time operation progress of each cleaning robot in real time; and
a conveying robot searching step for searching for one conveying robot that is closest to a first docking region of the cleaning region and is in the unloaded state when an operation progress of one cleaning robot in one cleaning region exceeds a preset threshold.

### Claim 7 (depends on 6)

The robot scheduling method according to claim 6, wherein the conveying robot monitoring step comprises following steps:
an aisle region setting step for setting two or more aisle regions to form an aisle network for at least one robot to travel;
a locating point setting step for evenly setting at least one locating point in the aisle network;
a tag setting step for setting at least one readable tag at each locating point, wherein the readable tag stores locating point information comprising a location and a serial number of the locating point where the readable tag is located;
a tag reading step for reading and outputting the locating point information of the readable tag by one conveying robot; and
a locating point information acquiring step for acquiring the locating point information of the readable tag output by the conveying robot to obtain the location and the serial number of the locating point where the conveying robot is located.

### Claim 8 (depends on 6)

The robot scheduling method according to claim 6, wherein the cleaning robot monitoring step comprises following steps:
a sensor setting step for setting a weight sensor or a distance sensor on a conveying device of each conveying robot;
a sensor data reading step for reading a sensing data of the weight sensor or the distance sensor of one conveying robot; and
a load status determining step for determining whether the conveying robot is loaded with the cleaning robot or not according to the sensing data of the weight sensor or the distance sensor, wherein if so, the load status of the conveying robot is in the fully loaded state; if not, the load status of the conveying robot is in the unloaded state.

### Claim 9 (depends on 6)

The robot scheduling method according to claim 6, wherein the conveying robot searching step comprises following steps:
a shortest travel distance calculating step for calculating a shortest travel distance between each conveying robot in the unloaded state and the first docking region of the cleaning region;
a shortest travel distance comparing step for comparing the shortest travel distance of each conveying robot in the unloaded state and the first docking region of the cleaning region; and
a conveying robot selecting step for selecting the conveying robot with a smallest shortest travel distance and in the unloaded state,
wherein the shortest travel distance is a distance corresponding to a shortest route of the conveying robot traveling in the aisle region to the first docking region of the cleaning region.

### Claim 10 (depends on 1)

The robot scheduling method according to claim 1, wherein the conveying task instruction comprises:
starting point information comprising a location of a starting point in a conveying task, wherein when one conveying robot acquires the conveying task instruction, a real-time location of the conveying robot is set to be the starting point;
stop-by point information comprising a position of a stop-by point in the conveying task, wherein when the cleaning robot is located in a storage region, the stop-by point is located in the storage region; and when the cleaning robot is located on an upper surface of one cleaning region where the cleaning operations have been performed, the stop-by point is located in a first docking region of the cleaning region; and
terminal point information comprising a position of a terminal point in the conveying task, wherein the terminal point is located in a first docking region of a cleaning region that needs to be cleaned.

### Claim 11 (depends on 10)

The robot scheduling method according to claim 10, wherein the route planning step comprises:
a route deducing step for deducing at least one passable route in at least one aisle region according to the positions of the starting point and the terminal point, wherein the passable route passes through the stop-by point;
a route comparing step for comparing lengths of passable routes when there are two or more passable routes; and
an optimization route determining step for determining the passable route as the optimization route if there is only one passable route, or for determining a shortest passable route as the optimization route if there are two or more passable routes.

### Claim 12 (depends on 1)

The robot scheduling method according to claim 1, wherein the docking controlling step comprises following steps:
an approaching cleaning region step for controlling the conveying robot to travel to a first docking region of one cleaning region, wherein the conveying robot comprises a docking platform and a bridge board;
a docking platform initial adjusting step for controlling the conveying robot to adjust a height and/or an angle of the docking platform, so that an upper surface of the docking platform is flush with an upper surface of the cleaning region, wherein an entrance of the conveying device faces a second docking region;
a docking step for controlling the conveying robot to extend the bridge board to dock with the upper surface of the docking platform with the upper surface of the cleaning region; and
a cleaning robot transferring step for controlling the cleaning robot to travel from the docking platform to the upper surface of the cleaning region, or from the cleaning region to the upper surface of the docking platform of the cleaning region.

### Claim 13 (depends on 12)

The robot scheduling method according to claim 12, wherein the docking controlling step comprises following steps:
an undocking step for controlling the conveying robot to retract the bridge board so that the upper surface of the docking platform is separated from the upper surface of the cleaning region;
a docking platform readjusting step for controlling the conveying robot to adjust the height and/or the angle of the docking platform, so that the docking platform is moved to a lowest point and keeps in a horizontal level; and
a conveying robot leaving step for controlling the conveying robot to leave the cleaning region.
