Complete sensor-based coverage with extended-range detectors: A hierarchical decomposition in terms of critical points and voronoi diagrams

IEEE International Conference on Intelligent Robots and Systems

Volumn 3, Issue , 2001, Pages 1305-1311

  Acar, Ercan U ^a   Choset, Howie ^a   Atkar, Prasad N ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; END EFFECTORS; GRAPH THEORY; IMAGE SENSORS; MOBILE ROBOTS;

CRITICAL POINTS; EXTENDED-RANGE DETECTORS; SENSOR-BASED COVERAGE; VORONOI DIAGRAMS;

MOTION PLANNING;

EID: 0035560111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Critical point sensing in unknown environments
2. Contact-sensor based coverage of rectilinear environments
3. Region filling operations with random obstacle avoidance for mobile robots
4. Exact cellular decompositions in terms of critical points of morse functions
5. Sensor based motion planning: Incremental construction of the hierarchical generalized voronoi graph
6. Sensor based motion planning: The hierarchical generalized voronoi graph
7. Coverage path planning: The boustrophedon decomposition
8. Spanning-tree based coverage of continous areas by a mobile robot
9. Randomized search strategies with imperfect sensors
10. A terrain-covering algorithm for an AUV
11. Dynamic path planning in sensor-based terrain acquisition
12. Making a clean sweep: Bahavior based vacuuming
13. Planning paths of complete coverage of an unstructured environment by a mobile robot