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

Annals of Mathematics and Artificial Intelligence

Volumn 31, Issue 1-4, 2001, Pages 77-98

  Gabriely, Yoav ^a   Rimon, Elon ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035635030     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1016610507833     Document Type: Article

References (32)

1. D. Angluin, J. Westbrook and W. Zhu, Robot navigation with range queries, in: Proc. of STOC (1996) pp. 469-478.
2. E.M. Arkin, S.P. Fekete and J.S. Mitchell, The lawnmower problem, in: Proc. of 5th Canadian Conf. on Computational Geometry, Waterloo, Canada (1993) pp. 461-466.
3. E.M. Arkin, S.P. Fekete and J.S. Mitchell, Approximation algorithms for lawn mowing and milling, ftp.zpr.uni-koeln.de/pub/paper/zpr97-255.ps.gz 97.255, University of Koein (1997).
4. E.M. Arkin and R. Hassin, Approximation algorithms for the geometric covering salesman problem, Discrete Appl. Math. 55 (1994) 197-218.
5. A. Blum, P. Raghavan and B. Schieber, Navigating in unfamiliar terrain, in: Proc. of STOC (1991) pp. 494-504.
6. Z.J. Butler, A.A. Rizzi and R.L. Hollis, Complete distributed coverage of rectlinear environments, in: Proc. of Fourth Workshop on Algorithmic Foundations of Robotics, Hanover, New Hampshire, 2000.
7. H. Choset and J.W. Burdick, Sensor based planning, Part II: Incremental construction of the generalized Voronoi graph, in: IEEE Int. Conference on Robotics and Automation (1995) pp. 1643-1649.
8. H. Choset and P. Pignon, Coverage path planning: The boustrophedon decomposition, in: Proc. of Int. Conf. on Field and Service Robotics, Canberra, Australia, December 1997.
9. X. Deng, E. Milios and A. Mirzaian, Robot map verification of a graph world, in: Lecture Notes in Computer Science, Vol. 1663 (Springer, Berlin, 1999) pp. 86-97.
10. X. Deng and A. Mirzaian, Competitive robot mapping with homogeneous markers, IEEE Trans. Robotics Autom. 12(4) (1996) 532-542.
11. G. Dudek, M. Jenkin, E. Milios and D. Wilkes, Robotic exploration as graph construction, IEEE Trans. Robotics Autom. 7(6) (1991) 859-865.
12. G. Dudek, M. Jenkin, E. Milios and D. Wilkes, Map validation and robot self-location in a graph-like world, Robotics Autonom. Syst. 22 (1997) 159-178.
13. E. Bar Eli, P. Berman, A. Fiat and P. Yan, Online navigation in a room, J. Algorithms 17(3) (1996) 319-341.
14. H. Enders, W. Feiten and G. Lawitzky, Field test of navigation system: Autonomous cleaning in supermarkets, in: Proc. of IEEE Int. Conf. on Robotics and Automation (1998) pp. 1779-1781.
15. S. Hedberg, Robots cleaning up hazardous waste, AI Expert (May 1995) pp. 20-24.
16. M. Held, On the Computational Geometry of Pocket Machining (Springer, New York, 1967).
17. S. Hert, S. Tiwari and V.J. Lumelsky, A terrain covering algorithm for an AUV, Autonom. Robots 3 (1996) 91-119.
18. C. Icking and R. Klein, Competitive strategies for autonomous systems, Technical Report CS:175, University of Hagen, Germany (1995).
19. A. Itai, C. Papadimitrio and J. Szwarcfiter, Hamiltonian paths in grid graphs, SIAM J. Comput. 11 (1982) 676-686.
20. J.D. Nicoud and M.K. Habib, The PEMEX autonomous demining robot: Perception and navigation strategies, in: Proc. of IEEE/RSJ Int. Conf. on Intelligent Robot Systems (1995) pp. 1:419-424.
21. S. Ntafos, Watchman routes under limited visibility, Comput. Geom. Theory Appl. 1 (1992) 149-170.
22. U. Peles and S. Abramson, RoboMow by Friendly Machines, www.friendlymachines.com, Israel, 1998.
23. A. Pirzadeh and W. Snyder, A unified solution to coverage and search in explored and unexplored terrains using indirect control, in: Proc. of IEEE Int. Conf. on Robotics and Automation (1990) pp. 2113-2119.
24. N.S.V. Rao and S.S. Iyengar, Autonomous robot navigation in unknown terrains: visibility graph based methods, IEEE Trans. Systems Man Cybern. 20(6) (1990) 1443-1449.
25. E. Rimon, Construction of c-space roadmaps from local sensory data: What should the sensors look for? Algorithmica 17(4) (1997) 357-379.
26. R.A. Russell, Laying and sensing odor markings as a strategy for assisting mobile robot navigation tasks, IEEE Robotics Autom. Magazine 2 (1995) 3-9.
27. R.A. Russell, Heat trails as short-lived navigational markers for mobile robots, in: Proc. of IEEE Int. Conf. on Robotics and Automation (1997) pp. 3534-3539.
28. R.E. Tarjan, Data Structures and Network Algorithms (SIAM, Philadelphia, PA, 1983).
29. C.J. Tayior and D.J. Kriegman, Vision based motion planning and exploration algorithms for mobile robots, in: Proc. of Workshop on Algorithmic Foundations of Robotics (A.K. Peters, 1995) pp. 69-83.
30. I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, Distributed covering by ant-robots using evaporating traces, IEEE Trans. Robotics Autom. 15(5) (1999) 918-933.
31. I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, Efficiently searching a graph by a smell-oriented vertex process, Ann. Math. Artif. Intell. 24 (1998) 211-223.
32. H. Yaguchi, Robot introduction to cleaning work in the East Japan Railway Co, Adv. Robotics 10(4) (1996) 403-414.