Exploring unknown environments

SIAM Journal on Computing

Volumn 29, Issue 4, 2000, Pages 1164-1188

  Albers, Susanne ^a   Henzinger, Monika R ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATRIX ALGEBRA; NAVIGATION; ROBOT APPLICATIONS; THEOREM PROVING;

DIRECTED GRAPH; DIVIDE AND CONQUER METHOD; EXPLORATION ALGORITHM;

GRAPH THEORY;

EID: 0033714291     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979732428X     Document Type: Article

References (19)

1. B. AWERBUCH, M. BETKE, R. RIVEST, AND M. SINGH, Piecemeal graph learning by a mobile robot, in Proceedings of the 8th Conference on Comput. Learning Theory, Academic Press, New York, San Diego, CA, 1995, pp. 321-328.
2. E. BAR-ELI, P. BERMAN, A. FIAT, AND R. YAN, On-line navigation in a room, J. Algorithms, 17 (1994), pp. 319-341.
3. G. BARNES, J. F. Buss, W. L. Ruzzo, AND B. SCHIEBER, A sublinear space, polynomial time algorithm for directed s-1 connectivity, in Proceedings of the 7th Annual Conference on Structure in Complexity Theory, IEEE Computer Society, Los Alamitos, CA, 1992, pp. 27-33.
4. G. BARNES AND J. EDMONDS, Time-space lower bounds for directed s-t connectivity on graph automata models, SIAM J. Comput., 27 (1998). pp. 1190-1202.
5. P. BERMAN, A. BLUM, A. FIAT, H. KARLOFF, A. ROSÉN, AND M. SAKS, Randomized robot navigation algorithms, in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, PA, 1996, pp. 74-84.
6. A. BLUM AND P. CHALASANI, An on-line algorithm for improving performance in navigation, in Proceedings of the 34th Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1993, pp. 2-11.
7. A. BLUM, P. RAGHAVAN, AND B. SCHIEBER, Navigating in unfamiliar geometric terrain, SIAM J. Comput., 26 (1997), pp. 110-137.
8. M. BETKE, R. RIVEST, AND M. SINGH, Piecemeal learning of an unknown environment, Machine Learning, 18 (1995), pp. 231-254.
9. M. BENDER AND D. SLONIM, The power of team exploration: two robots can learn unlabeled directed graphs, in Proceedings of the 35th Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alanmitos, CA, 1994, pp. 75-85.
10. S. A. COOK AND C. W. RACKOFF, Space lower bounds for maze threadability on restricted machines, SIAM J. Comput., 9 (1980), pp. 636-652.
11. X. DENG, T. KAMEDA, AND C. H. PAPADIMITRIOU, How to learn an unknown environment, J. ACM, 45 (1998), pp. 215-245.
12. X. DENG AND C. H. PAPADIMITRIOU, Exploring an unknown graph, in Proceedings of the 31st Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1990, pp. 356-361.
13. X. DENG AND C. H. PAPADIMITRIOU, Exploring an unknown graph, revised version of [12].
14. J. EDMONDS AND C. K. POON, A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model, in Proceedings of the 27th Symposium on the Theory of Computing, ACM, New York, 1995, pp. 147-156.
15. F. HOFFMANN, C. ICKING, R. KLEIN, AND K. KRIEGEL, A competitive strategy for learning a polygon, in Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, PA, 1997, pp. 166-174.
16. E. KOUTSOUPIAS, result reported in [13].
17. S. KWEK, On a simple depth-first search strategy for exploring unknown graphs, in Proceedings of the 5th Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 1272, Springer-Verlag, New York, 1997, pp. 345-353.
18. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Shortest paths without a map, Theoret. Comput. Sci., 84 (1991), pp. 127-150.
19. R. RIVEST, problem formulation cited in [12].