Optimal Line-sweep-based Decompositions for Coverage Algorithms

@inproceedings{Huang2001OptimalLD,
  title={Optimal Line-sweep-based Decompositions for Coverage Algorithms},
  author={Wesley H. Huang},
  booktitle={ICRA},
  year={2001}
}
Robotic coverage is the problem of moving a sensor or actuator over all points in a 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. In this paper, we focus on generating decompositions based upon the planar line sweep. After a general overview of the coverage problem, we describe… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 189 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 128 extracted citations

Optimal Coverage Path Planning Based on the Rotating Calipers Algorithm

2017 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE) • 2017
View 6 Excerpts
Highly Influenced

Coverage path planning based on a multiple sweep line decomposition

IECON 2015 - 41st Annual Conference of the IEEE Industrial Electronics Society • 2015
View 8 Excerpts
Highly Influenced

Area coverage with heterogeneous UAVs using scan patterns

2016 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR) • 2016
View 3 Excerpts
Highly Influenced

190 Citations

01020'00'04'09'14'19
Citations per Year
Semantic Scholar estimates that this publication has 190 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…