.png){kind=icon}
Return
Scalable Coverage Path Planning for Cleaning Robots Using Rectangular Map Decomposition on Large Environments
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2853146.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The goal of coverage path planning is to create a path that covers the entire free space in a given environment. Coverage path planning is the most important component of cleaning robot technology, because it determines the cleaning robot's movement. When the environment covered by a cleaning robot is extremely large and contains many obstacles, the computation for coverage path planning can be complicated. This can result in significant degradation of the execution time for coverage path planning. Not many studies have focused on the scalability of coverage path planning methods. In this paper, we propose a scalable coverage path planning method based on rectangular map decomposition. The experimental results demonstrate that the proposed method reduces the execution time for coverage path planning up to 14 times when compared with conventional methods.
Keywords:
Cleaning robot
robot path planning
coverage path planning
scalability
computational efficiency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
Nano-sized LaMnO3 powders prepared by spray pyrolysis from spray solution containing citric acidOAAI
OAAIShareSaveBioactive Compounds, Nutritional Quality and Antioxidant Capacity of the Red-Fleshed Kirkwood Navel and Ruby Valencia Oranges.png)
Antioxidants
OAAI
AntioxidantsIF0
OAAIShareSaveShareSaveShareSave
View more