Spanning-tree based coverage of continuous areas by a mobile robot

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2, Issue , 2001, Pages 1927-1933

  Gabriely, Y ^a   Rimon, E ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTER SIMULATION; MOTION PLANNING; ROBOT APPLICATIONS;

SPANNING TREE COVERING (STC) ALGORITHMS;

MOBILE ROBOTS;

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

References (18)

1. Complete distributed coverage of rectlinear environments
2. Coverage path planning: Boustrophedon decomposition
3. Competitive robot mapping with homogeneous markers
4. Robotic exploration as graph construction
5. Field test of Autonomous cleaning in supermarkets
6. Robots cleaning up hazardous waste
7. A terrain covering algorithm for an AUV
8. Competitive strategies for autonomous systems
9. The PEMEX autonomous detaining robot
10. Watchman routes under limited visibility
11. A unified solution to coverage and search in explored and unexplored terrains using indirect control
12. Autonomous robot navigation in unknown terrains: Visibility graph based methods
13. Laying and sensing odor markings for assisting mobile robot navigation tasks
14. Distributed covering by ant-robots using evaporating traces