Optimal line-sweep-based decompositions for coverage algorithms

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2001, Pages 27-32

  Huang, W H ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; IMAGE SENSORS; OPTIMAL CONTROL SYSTEMS; TRAVELING SALESMAN PROBLEM;

COVERAGE ALGORITHMS;

ROBOTICS;

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

References (10)

1. Complete distributed coverage of rectilinear environments
2. Coverage path planning: The boustrophedon cellular decomposition
3. Exact cellular decompositions in terms of critical points of Morse functions
4. Spanning-tree based coverage of continuous areas by a mobile robot
5. A terrain-covering algorithm for an auv
6. Cooperative sweeping by mobile robots
7. An advanced planning and navigation approach for autonomous cleaning robot operations
8. Planning paths of complete coverage of an unstructured environment by a mobile robot