The power of a Pebble: Exploring and mapping directed graphs

Information and Computation

Volumn 176, Issue 1, 2002, Pages 1-21

  Bender, Michael A ^a   Fernández, Antonio ^b   Ron, Dana ^c   Sahai, Amit ^d   Vadhan, Salil ^e  

^a Stony Brook University   (United States)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c TEL AVIV UNIVERSITY   (Israel)

^d Princeton University   (United States)

^e HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MAPPING; NAVIGATION; PROBLEM SOLVING; ROBOTS; WORLD WIDE WEB;

ROBOT NAVIGATION;

GRAPH THEORY;

EID: 0037055377     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3081     Document Type: Article

References (39)

1. Adams, R. (2000), Colossal cave adventure page, available at http://people.delphi.com/rickadams/adventure/index.html.
2. Albers, S., and Henzinger, M. R. (1997), Exploring unknown environments, in "Proceedings of the Twenty Ninth Annual ACM Symposium on the Theory of Computing".
3. Angluin, D. (1987), Learning regular sets from queries and counterexamples, Inform. and Comput. 75, 87-106.
4. Angluin, D., Westbrook, J., and Zhu, W. (1996), Robot navigation with range queries, in "Proceedings of the Twenty Eighth Annual ACM Symposium on the Theory of Computing," pp. 469-478.
5. Anjan, V. (1987), Ph.D. thesis, Mathematical Institute of the Academy of Sciences, Minsk.
6. Awerbuch, B., Betke, M., Rivest, R. L., and Singh, M. (1995), Piecemeal graph exploration by a mobile robot, in "Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory," pp. 321-328.
7. Baeza-Yates, R., Culberson, J., and Rawlins, G. (1993), Searching in the plane, Inform. and Comput. 106(2), 234-252.
8. Bar-Eli, E., Berman, P., Fiat, A., and Yan, P. (1994), Online navigation in a room, J. Algorithms 17, 319-341.
9. Bender, M., Fernández, A., Ron, D., Sahai, A., and Vadhan, S. (1998), The power of a pebble: Exploring and mapping directed graphs, in "Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, May 1998," pp. 269-278, Assoc. Comput. Mach, New York.
10. Bender, M. A., and Slonim, D. (1994), The power of team exploration: Two robots can learn unlabeled directed graphs, in "Proceedings of the Thirty Fifth Annual Symposium on Foundations of Computer Science," pp. 75-85.
11. Berman, P., Blum, A., Fiat, A., Karloff, H., Rosen, A., and Saks, M. (1996), Randomized robot navigation algorithms, in "Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 74-84.
12. Betke, M. Rivest, R. L., and Singh, M. (1995), Piecemeal learning of an unknown environment, Machine Learning 18, 231-254.
13. Blum, A., and Chalasani, P. (1993), An on-line algorithm for improving performance in navigation, in "Proceedings of the Thirty Fourth Annual Symposium on Foundations of Computer Science," pp. 2-11.
14. Blum, A., Raghavan, P., and Schieber, B. (1997), Navigating in unfamiliar geometric terrain, SIAM J. Comput. 26, 110-137.
15. Blum, M., and Kozen, D. (1978), On the power of the compass (or, why mazes are easier to search than graphs), in "Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science," pp. 132-142.
16. Blum, M., and Sakoda, W. J. (1977), On the capability of finite automata in 2 and 3 dimensional space, in "Proceedings of the Eighteenth Annual Symposium on Foundations of Computer Science," pp. 147-161.
17. Dean, T., Angluin, D., Basye, K., Engelson, S., Kaelbling, L., Kokkevis, E., and Maron, O. (1995), Inferring finite automata with stochastic output functions and an application to map learning, Machine Learning 18, 81-108.
18. Dean, T., Basye, K., and Kaelbling, L. (1992), Uncertainty in graph-based map learning, Robot Learning.
19. Deng, X., Kameda, T., and Papadimitriou, C. (1998), How to learn an unknown environment I: The rectilinear case, J. Assoc. Comput. Mach. 45, 215-245.
20. Deng, X., Milios, E., and Mirzaian, A. (1999), Robot map verification of a graph world, in "Algorithms and Data Structures (WADS '99), Vancouver, BC, Canada, August 1999," pp. 86-97, Lecture Notes in Computer Science, Springer-Verlag, Berlin.
21. Deng, X., and Mirzaian, A. (1996), Competitive robot mapping with homogeneous markers, IEEE Trans. Robot. Automat. 12, 532-542.
22. Deng, X., and Papadimitriou, C. H. (1990), Exploring an unknown graph, in "Proceedings of the Thirty First Annual Symposium on Foundations of Computer Science," pp. 356-361.
23. Dudek, G., Jenkin, M., Milios, E., and Wilkes, D. (1991), Robotic exploration as graph construction, IEEE Trans. Robot. Automat. 7, 859-865.
24. Dudek, G., Jenkin, M., Milios, E. and Wilkes, D. (1997), Map validation and robot self-location in a graph-like world, Robot. Auton. Systems 22, 159-178.
25. Freund, Y., Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., and Schapire, R. E. (1995), Efficient algorithms for learning to play repeated games against computationally bounded adversaries, in "Proceedings of the Thirty Sixth Annual Symposium on Foundations of Computer Science," pp. 332-341.
26. Freund, Y., Kearns, M., Ron, D., Rubinfeld, R., Schapire, R. E., and Sellie, L. (1997), Efficient learning of typical finite automata from random walks, Inform. and Comput. 138, 23-48.
27. Hoffman, F., Icking, C., Klein, R., and Kriegel, K. (1997), A competitive strategy for learning a polygon, in "Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 166-174.
28. Kohavi, Z. (1978), "Switching and Finite Automata Theory," 2nd ed., McGraw-Hill, New York.
29. Kudryavtsev, V. B., Ushchumlich, Sh., and Kilibarda, G. (1993), On the behavior of automata in labyrinths, Discrete Math. Appl. 3, 1-28.
30. Panaite, P., and Pelc, A. (1998), Exploring unknown undirected graphs, in "Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms."
31. Papadimitriou, C. H., and Yannakakis, M. (1991), Shortest paths without a map, Theoret. Comput. Sci. 84, 127-150.
32. Rabin, M. O. (1967), Maze threading automata, in "Seminar Talk presented at the University of California at Berkeley, October 1967."
33. Reyzin, L. (1992), Traversal problems for certain types of deterministic and non-deterministic automata, unpublished manuscript.
34. Rivest, R., and Schapire, R. (1993), Inference of finite automata using homing sequences, Inform. and Comput. 103, 299-347.
35. Rivest, R., and Schapire, R. (1994), Diversity-based inference of finite automata, J. Assoc. Comput. Mach. 43, 555-589.
36. Ron, D., and Rubinfeld, R. (1997), Exactly learning automata of small cover time, Machine Learning 27, 69-96.
37. Royer, E. M., and Toh, C.-K. (1999), A review of current routing protocols for ad hoc mobile wireless networks, IEEE Personal Comm. 6, 46-55.
38. Shah, A. N. (1974), Pebble automata on arrays, in "Computer Graphics and Image Processing," pp. 236-246.
39. Zhang, L. (1994), A survey of the problem of learning an unknown environment, unpublished manuscript.