Competitive on-line coverage of grid environments by a mobile robot

Computational Geometry: Theory and Applications

Volumn 24, Issue 3, 2003, Pages 197-224

  Gabriely, Yoav ^a   Rimon, Elon ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Competitive covering; Mobile robot covering; On line spanning tree construction; Sensor based covering

Indexed keywords

EID: 84867953364     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00110-4     Document Type: Article

References (22)

1. E.M. Arkin, S.P. Fekete, and I.S. Mitchell Approximation algorithms for lawn mowing and milling Computational Geometry 17 2000 25 50
2. S. Arora Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems J. ACM 45 5 1998 753 782
3. P.N. Atkar, H. Choset, A.A. Rizzi, and E.U. Acar Exact cellular decomposition of closed orientable surfaces embedded in R 3 IEEE Int. Conf. on Robotics and Automation 2001 699 704
4. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo Competitive algorithms for the on-line traveling salesman Proc. of 4th WADS Lecture Notes in Computer Science 955 1995 Springer-Verlag Berlin 206 217
5. X. Deng, T. Kameda, and C. Papadimitriou How to learn an unknown environment 31th IEEE Symp. on Foundations of Computer Science 1991 298 303
6. X. Deng, and A. Mirzaian Competitive robot mapping with homogeneous markers IEEE Trans. on Robotics and Automation 12 4 1996 532 542
7. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes Robotic exploration as graph construction IEEE Trans. on Robotics and Automation 7 6 1991 859 865
8. H. Enders, W. Feiten, and G. Lawitzky Field test of a navigation system: Autonomous cleaning in supermarkets IEEE Int. Conf. on Robotics and Automation 1998 1779 1781
9. Y. Gabriely, E. Rimon, Spanning-tree based coverage by a mobile robot, Technical Report, Dept. of ME, Technion, http://www.technion.ac.il/~robots, 1999
10. M. Grigni, E. Koutsoupias, and C. Papadimitriou An approximation scheme for planar graph TSP 36th IEEE Symp. on Foundations of Computer Science 1995 640 645
11. S. Hedberg Robots cleaning up hazardous waste AI Expert 1995 20 24
12. M. Held On the Computational Geometry of Pocket Machining 1987 Springer-Verlag New York
13. C. Icking, T. Kamphans, R. Klein, and E. Langetepe On the competitive complexity of navigation tasks 16th European Workshop on Computational Geometry, Eilat 2000 140 143
14. C. Icking, T. Kamphans, R. Klein, and E. Langetepe On the competitive complexity of navigation tasks Sensor Based Intelligent Robots Lecture Notes in Computer Science 2238 2002 Springer-Verlag Berlin 245 258
15. C. Icking, and R. Klein Competitive strategies for autonomous systems H. Bunke, T. Kanade, H. Noltemeier, Modelling and Planning for Sensor Based Intelligent Robot Systems 1995 World Scientific Singapore 23 40
16. A. Itai, C. Papadimitrio, and J. Szwarcfiter Hamiltonian paths in grid graphs SIAM J. Comput. 11 1982 676 686
17. B. Kalyanasundaram, and K.R. Pruhs Constructing competitive tours from local information Lecture Notes in Computer Science 700 1993 Springer-Verlag 102 113
18. J.S.B. Mitchell Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems SIAM J. Comput. 28 1999 1298 1309
19. J.D. Nicoud, and M.K. Habib The PEMEX autonomous demining robot: Perception and navigation strategies IEEE/RSJ Int. Conf. on Intelligent Robot Systems 1995 419 424
20. S. Ntafos Watchman routes under limited visibility Computational Geometry 1 1992 149 170
21. N.S.V. Rao, and S.S. Iyengar Autonomous robot navigation in unknown terrains: visibility graph based methods IEEE Trans. Systems Man Cybernet. 20 6 1990 1443 1449
22. I.A. Wagner, M. Lindenbaum, and A.M. Bruckstein Distributed covering by ant-robots using evaporating traces IEEE Trans. on Robotics and Automation 15 5 1999 918 933