IP Library › Granted Patent US 12,339,667
Granted Patent B2
US 12,339,667 · App. 17/583,250 · Granted Jun 24, 2025

Autonomous mobile robots for coverage path planning

Inventors: Ayush Kumar Gaud (Tokyo, JP); Shigekazu Matsuzaki (Tokyo, JP); Koji Nakatani (Tokyo, JP); Takafumi Kashimoto (Tokyo, JP)
Assignees: Rapyuta Robotics Co., Ltd.; Taisei Corporation
G05D1/0274G05D1/0219G05D1/0238G05D1/0291
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,339,667
App. No.
17/583,250
Granted
Jun 24, 2025
Kind
B2
Abstract

The disclosure generally relates to a method and a system for heterogeneous autonomous mobile robots for coverage path planning. The method may include receiving sensor data from one or more sensor devices. The sensor data includes information corresponding to one or more robots in a predefined region. The method may further include generating a map for the one or more robots based on the received sensor data. The map includes a probable occupancy of each of the plurality of cells by the one or more robots in the predefined region. The method further includes determining a set of poses of the one or more robots based on the generated map and an optimal set of poses from the set of poses based on the visibility matrix. The method may further include generating a coverage path plan for each of the one or more robots based on the determined optimal set of poses.

Claims (63)

1. A processor-implemented method comprising:

receiving, by a processor, sensor data from sensor devices, the sensor data comprising information corresponding to robots in a predefined region, wherein the predefined region is divided into a plurality of cells, wherein the robots are configured to explore the predefined region simultaneously, and broadcast the information dynamically among the robots, based on regions explored as each robot progresses a predefined path;

generating, by the processor, a collision map for the robots based on the received sensor data, the collision map comprising probability of each cell being occupied by each of the robots and visibility of each cell from the plurality of cells accounting for obstruction, wherein the collision map determines feasibility of each robot physically being in a cell among the plurality of cells and wherein the collision map is shared amongst the robots to increase an observable environment for the robots;

identifying, by the processor, a set of goal poses of the robots based on the generated collision map, wherein the set of goal poses and the plurality of cells forms a visibility matrix, the visibility matrix comprising an index for quality of sensor observation;

identifying, by the processor:

an optimal set of goal poses from the set of goal poses based on the visibility matrix, estimating an overall coverage value of each cell in the visibility matrix, and

an optimal order of goal poses visited by the robots from the determined optimal set of goal poses;

generating, by the processor, a coverage path plan for each of the robots based on the identified optimal set of goal poses and the optimal order of poses, wherein generating the coverage path plan comprises assigning a sensor visibility cost to each of the cells corresponding to the optimal set of goal poses;

initiating, by the processor, a replanning for the generated coverage path, wherein the replanning comprises selecting a next goal pose from the set of goal poses;

generating, by the processor, a new coverage path for each of the robots based on said next goal pose; and

facilitating, by the processor, traversal of the robots based on the generated new coverage path to reduce traversed distance by the robots.

2. The method of claim 1 , comprising:

updating coverage path based on feedback received from the sensor data, the feedback comprising the quality of each observation captured by the sensor devices.

3. The method of claim 2 , further comprising: updating probability of quality of each observation captured by the sensor devices.

4. The method of claim 2 , wherein updating the coverage path further comprising:

aggregating the sensor data of each of the robots collected over a period; and

dynamically updating the sensor data upon receiving new information corresponding to the robots.

5. The method of claim 1 , wherein the information corresponding to robots comprises sensor field of view of the robots in the predefined region including the plurality of cells.

6. The method of claim 5 , wherein the sensor field of view comprises position of the robots, orientation of the robots, one or more viewpoint of the robots in the predefined region.

7. The method of claim 1 , comprising:

generating a coverage map, the coverage map comprising a region, from the predefined region, covered by the sensor devices.

8. The method of claim 1 , wherein the visibility matrix comprises assigning an index for quality of sensor observation to each cell in a coverage map, wherein the visibility matrix comprises rows representing the plurality of cell and columns representing the set of goal poses.

9. The method of claim 1 , wherein identifying the optimal order of goal poses comprises creating a distance metrics for each pose from the optimal set of goal poses accounting for kinematic constraints and feasibility of each of the robots, and wherein identifying the optimal order of goal poses enables prioritizing poses to be visited by the robots.

10. The method of claim 1 , wherein the sensor visibility cost assigned to each of the cells is indicative of a measure of confidence of the visibility of the cell by each of the robots.

11. A system comprising:

a memory storing instructions;

a processor coupled to the memory, wherein the processor is configured by the instructions to:

receive sensor data from sensor devices, the sensor data comprising information corresponding to robots in a predefined region, wherein the predefined region is divided into a plurality of cells, wherein the robots are configured to explore the predefined region simultaneously, and broadcast the information dynamically among the robots, based on regions explored as each robot progresses a predefined path;

generate a collision map for the robots based on the received sensor data, the collision map comprising probability of each cell being occupied by each of the robots and visibility of each cell from the plurality of cells accounting for obstruction, wherein the collision map determines feasibility of each robot physically being in a cell among the plurality of cells and wherein the collision map is shared amongst the robots to increase an observable environment for the robots;

identify a set of goal poses of the robots based on the generated collision map, wherein the set of goal poses and the plurality of cells forms a visibility matrix, the visibility matrix comprising an index for quality of sensor observation;

identify:

an optimal set of goal poses from the set of goal poses based on the visibility matrix estimating an overall coverage value of each cell in the visibility matrix, and

an optimal order of poses visited by the robots from the determined optimal set of goal poses;

generate a coverage path plan for each of the robots based on the identified optimal set of goal poses and the optimal order of poses, wherein generating the coverage path plan comprises assigning a sensor visibility cost to each of the cells corresponding to the optimal set of goal poses;

initiate a replanning for the generated coverage path, wherein the replanning comprises selecting a next goal pose from the set of goal poses;

generate a new coverage path for each of the robots based on said next goal pose; and

facilitate traversal of the robots based on the generated new coverage path to reduce traversed distance by the robots.

12. The system of claim 11 , further configured to:

updating coverage path based on feedback received from the sensor data, the feedback comprising the quality of each observation captured by the sensor devices.

13. The system of claim 12 , further configured to update probability of quality of each observation captured by the sensor devices.

14. The system of claim 12 , further configured to:

aggregate the sensor data of each of the robots collected over a period; and

dynamically update the sensor data upon receiving new information corresponding to the robots.

15. The system of claim 11 , wherein the information corresponding to robots comprises sensor field of view of the robots in the predefined region including the plurality of cells.

16. The system of claim 15 , wherein the sensor field of view comprises position of the robots, orientation of the robots, one or more viewpoint of the robots in the predefined region.

17. The system of claim 11 , further configured to:

generate a coverage map, the coverage map comprising a region, from the predefined region, covered by the sensor devices.

18. The system of claim 11 , wherein the visibility matrix comprises:

assigning an index for quality of sensor observation to each cell in a coverage map, wherein the visibility matrix comprises rows representing the plurality of cell and columns representing the set of goal poses.

19. The system of claim 11 , wherein to identify the optimal order of goal poses, the processor is further configured to:

create a distance metrics for each pose from the optimal set of goal poses accounting for kinematic constraints and feasibility of each of the robots, and wherein identifying the optimal order of goal poses enables prioritizing poses in which the poses are to be visited by the robots.

20. The system of claim 11 , wherein the sensor visibility cost assigned to each of the cells is indicative of a measure of confidence of the visibility of the cell by each of the robots.

21. One or more non-transitory machine-readable information storage mediums comprising one or more instructions which when executed by one or more hardware processors cause:

receiving sensor data from sensor devices, the sensor data comprising information corresponding to robots in a predefined region, wherein the predefined region is divided into a plurality of cells, wherein the robots are configured to explore the predefined region simultaneously, and broadcast the information dynamically among the robots, based on regions explored as each robot progresses a predefined path;

generating a collision map for the robots based on the received sensor data, the collision map comprising probability of each cell being occupied by each of the robots and visibility of each cell from the plurality of cells accounting for obstruction, wherein the collision map determines feasibility of each robot physically being in a cell among the plurality of cells and wherein the collision map is shared amongst the robots to increase an observable environment for the robots;

identifying a set of goal poses of the robots based on the generated map, wherein the set of goal poses and the plurality of cells forms a visibility matrix, the visibility matrix comprising an index for quality of sensor observation;

identifying:

an optimal set of goal poses from the set of goal poses based on the visibility matrix, estimating an overall coverage value of each cell in the visibility matrix, and

an optimal order of poses visited by the robots from the determined optimal set of goal poses;

generating a coverage path plan for each of the robots based on the identified optimal set of goal poses and the optimal order of poses, wherein generating the coverage path plan comprises assigning a sensor visibility cost to each of the cells corresponding to the optimal set of goal poses;

initiating a replanning for the generated coverage path, wherein the replanning comprises selecting a next goal pose from the set of goal poses;

generating a new coverage path for each of the robots based on said next goal pose; and

facilitating, by the processor, traversal of the robots based on the generated new coverage path to reduce traversed distance by the robots.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 26, 2022
From: GAUD, AYUSH KUMAR
To: RAPYUTA ROBOTICS CO., LTD.
Reel/Frame 059703/0396 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 26, 2022
From: MATSUZAKI, SHIGEKAZU; NAKATANI, KOJI; KASHIMOTO, TAKAFUMI
To: TAISEI CORPORATION
Reel/Frame 059703/0418 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 27, 2022
From: GAUD, AYUSH KUMAR
To: RAPYUTA ROBOTICS CO., LTD.
Reel/Frame 058785/0444 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 27, 2022
From: MATSUZAKI, SHIGEKAZU; NAKATANI, KOJI; KASHIMOTO, TAKAFUMI; ISHIMARU, HIROKI
To: TAISEI CORPORATION
Reel/Frame 058785/0448 →
Continuity (2)
Provisional Application 63278169 · Nov 11, 2021
Related Publication 20230147624A1 · May 11, 2023
References Cited (19)
US 5315517A · Kawase et al. · 1994 [cited by applicant]
US 11016491B1 · Millard · 2021 [cited by examiner]
US 20180246520A1 · Martinson · 2018 [cited by examiner]
US 20190220020A1 · Macias · 2019 [cited by examiner]
US 20190286145A1 · LaFary · 2019 [cited by examiner]
US 20200398428A1 · Murray · 2020 [cited by examiner]
US 20210103290A1 · Pajovic · 2021 [cited by examiner]
US 20210356972A1 · Kwon · 2021 [cited by examiner]
US 20220163969A1 · Li · 2022 [cited by examiner]
US 20220197304A1 · Cochran · 2022 [cited by examiner]
JP H05158533A · 1993 [cited by applicant]
JP 2007249632A · 2007 [cited by applicant]
JP 2017050018A · 2017 [cited by applicant]
Song Soohwan et al: “Online coverage and inspection planning for 3D modeling”, Autonomous Robots, vol. 44, No. 8, Aug. 8, 2020, pp. 1431-1450, XP037264942. [cited by applicant]
Jing Wei et al: “Sampling-based view planning for 3D visual coverage task with Unmanned Aerial Vehicle”, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), IEEE, Oct. 9, 2016, pp. 1808-1815… [cited by applicant]
Zhou Boyu et al: “FUEL: Fast UAV Exploration Using Incremental Frontier Structure and Hierarchical Planning”, IEEE Robotics and Automation Letters, IEEE, vol. 6, No. 2, Jan. 14, 2021, pp. 779-786, XPO11834085. [cited by applicant]
Bircher Andreas et al: “Three-dimensional coverage path planning via viewpoint resampling and tour optimization for aerial robots”, Autonomous Robots, vol. 40, No. 6, Nov. 2, 2015, pp. 1059-1078, XP036021882. [cited by applicant]
Search Report and Search Opinion mailed on Dec. 23, 2022, in European Application No. 22185921.8. [cited by applicant]
Zaenker Tobias et al: “Viewpoint Planning for Fruit Size and Position Estimation”, 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), IEEE, Sep. 27, 2021 (Sep. 27, 2021), pp. 3271-3277, XP0… [cited by applicant]