The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Optimal line-sweep-based decompositions for coverage algorithms
Abstract
Robotic coverage is the problem of moving a sensor or actuator over all points in given region. Ultimately, we want a coverage path that minimizes some cost such as time. We take the approach of decomposing the coverage region into subregions, selecting a sequence of those subregions, and then generating a path that covers each subregion in turn. We focus on generating decompositions based upon the planar line sweep. After a general overview of the coverage problem, we describe how our assumptions lead to the optimality criterion of minimizing the sum of subregion altitudes (which are measured relative to the sweep direction assigned to that subregion). For a line-sweep decomposition, the sweep direction is the same for all subregions. We describe how to find the optimal sweep direction for convex polygonal worlds. We then introduce the minimal sum of altitudes (MSA) decomposition in which we may assign a different sweep direction to each subregion. This decomposition is better for generating an optimal coverage path. We describe a method based on multiple line sweeps and dynamic programming to generate the MSA decomposition.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Spanning-tree based coverage of continuous areas by a mobile robot
Gabriely, Y., & Rimon, E. (2001) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1016610507833 · Cited by 388
Cooperative sweeping by multiple mobile robots
Kurabayashi, D., Ota, J., Arai, T., & Yoshida, E. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1996.506964 · Cited by 152
Using Path Transforms to Guide the Search for Findpath in 2D
Zelinsky, A. (1994) · The International Journal of Robotics Research · doi:10.1177/027836499401300403 · Cited by 129
Cited by
A survey on coverage path planning for robotics
Galceran, E., & Carreras, M. (2013) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.09.004 · Cited by 1,575
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“Note that for some convex area P, the number of turns is minimized if the largest difference in -coordinates between a pair of points belonging to P, when measured along the chosen sweep direction −→ , is at its minimum [115, 168].”
BackgroundSurvey on Coverage Path Planning with Unmanned Aerial Vehicles
Cabreira, T., Brisolara, L., & Ferreira Jr., P. R. (2019) · Drones · doi:10.3390/drones3010004 · Cited by 604
Energy-Aware Coverage Path Planning of UAVs
Di Franco, C., & Buttazzo, G. (2015) · 2015 IEEE International Conference on Autonomous Robot Systems and Competitions · doi:10.1109/icarsc.2015.17 · Cited by 360
Autonomous UAV Surveillance in Complex Urban Environments
Semsch, E., Jakob, M., Pavlicek, D., & Pechoucek, M. (2009) · 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology · doi:10.1109/wi-iat.2009.132 · Cited by 308
Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time
Avellar, G., Pereira, G., Pimenta, L., & Iscold, P. (2015) · Sensors · doi:10.3390/s151127783 · Cited by 305
Maza, I., & Ollero, A. (2008) · Distributed Autonomous Robotic Systems 6 · doi:10.1007/978-4-431-35873-2_22 · Cited by 282
Coverage path planning with unmanned aerial vehicles for 3D terrain reconstruction
Torres, M., Pelta, D. A., Verdegay, J. L., & Torres, J. C. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.02.007 · Cited by 272
Metadata
- Authors
- Huang, W. H.
- Venue
- Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 1
- Pages
- 27-32
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2108154659
- Cited by
- 307
- References
- 3
- FWCI
- 3.22
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.