Graph exploration by a finite automaton

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 451-462

  Fraigniaud, Pierre ^a   Ilcinkas, David ^a   Peer, Guy ^b   Pelc, Andrzej ^c   Peleg, David ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS; TOPOLOGY;

EDGE PORTS; GRAPH EXPLORATION; MAXIMUM DEGREE; MEMORY BITS; PLANAR GRAPH; PRIORI KNOWLEDGE; SPACE COMPLEXITY;

ROBOTS;

EID: 35048870321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_34     Document Type: Article

References (37)

1. S. Albers and M. R. Henzinger. Exploring unknown environments. SIAM J. Computing 29:1164-1188, 2000.
2. H. Antelmann, L. Budach and H.A. Rollik. On universal traps. Elektronische Informationsverarbeitung und Kybernetic, EIK 15(3):123-131, 1979.
3. G. Asser. Bemerkungen zum Labyrinth-Problem. Elektronische Informationsver-arbeitung und Kybernetic, EIK 13(4-5):203-216, 1977.
4. B. Awerbuch, M. Betke, R. Rivest and M. Singh. Piecemeal graph learning by a mobile robot. In 8th Conf. on Comput. Learning Theory, pages 321-328, 1995.
5. E. Bar-Eli, P. Berman, A. Fiat and R. Yan. On-line navigation in a room. J. Algorithms 17:319-341, 1994.
6. A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial, and M.Werman. Bounds on universal sequences. SIAM J. Computing 18(2):268-277, 1989.
7. M. Bender, A. Fernandez, D. Ron, A. Sahai and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. In 30th Ann. Symp. on Theory of Computing (STOC), pages 269-278, 1998.
8. M. Bender and D. Slonim. The power of team exploration: Two robots can learn unlabeled directed graphs. In 35th Ann. Symp. on Foundations of Computer Science (FOGS), pages 75-85, 1994.
9. A. Blum, P. Raghavan and B. Schieber. Navigating in unfamiliar geometric terrain. SIAM J. Computing 26:110-137, 1997.
10. M. Blum and D. Kozen. On the power of the compass (or, why mazes are easier to search than graphs). In 19th Symposium on Foundations of Computer Science (FOCS), pages 132-142, 1978.
11. M. Blum and W. Sakoda. On the capability of finite automata in 2 and 3 dimensional space. In 18th Ann. Symp. on Foundations of Computer Science (FOCS), pages 147-161, 1977.
12. M. Betke, R. Rivest and M. Singh. Piecemeal learning of an unknown environment. Machine Learning 18:231-254, 1995.
13. L. Budach. On the solution of the labyrinth problem for finite automata. Elektronische Informationsverarbeitung und Kybernetic, EIK 11(10-12):661-672, 1975.
14. L. Budach. Environments, labyrinths and automata. In Fund. Computat. Theory (FCT), LNCS 56, 54-64, 1977.
15. L. Budach. Automata and labyrinths. Math. Nachrichten, pages 195-282, 1978.
16. W. Coy. Automata in labyrinths. In Fund. Computat. Theory (FCT), LNCS 56, 65-71, 1977.
17. X. Deng, T. Kameda and C. H. Papadimitriou How to learn an unknown environment I: the rectilinear case. J. ACM 45:215-245, 1998.
18. X. Deng and C. H. Papadimitriou. Exploring an unknown graph. J. Graph Theory 32:265-297, 1999.
19. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc. Tree Exploration with Little Memory. In 13th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 588-597, 2002.
20. K. Döpp. Automaten in Labyrinthen. Elektronische Informationsverarbeitung und Kybernetic, EIK 7(2):79-94
21. Elektronische Informationsverarbeitung und Kybernetic, EIK 7(3):167-190, 1971.
22. G. Dudek, M. Jenkins, E. Milios, and D. Wilkes. Robotic Exploration as Graph Construction. IEEE Transaction on Robotics and Automation 7(6):859-865, 1991.
23. C. Duncan, S. Kobourov and V. Kumar. Optimal constrained graph exploration. In 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 807-814, 2001.
24. P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc. Collective Tree Exploration To appear in 6th Latin American Theoretical Informatics Symposium (LATIN), 2004.
25. P. Fraigniaud, and D. Ilcinkas. Directed Graphs Exploration with Little Memory. In 21st Symposium on Theoretical Aspects of Computer Science (STAGS), LNCS 1996, pages 246-257, 2004.
26. A. Hemmerling. Labyrinth Problems: Labyrinth-Searching Abilities of Automata. Volume 114 of Teubner-Texte zur Mathematik. B. G. Teubner Verlagsgesellschaft, Leipzig, 1989.
27. F. Hoffmann. One pebble does not suffice to search plane labyrinths. In Fund. Computat. Theory (FCT), LNCS 117, 433-444, 1981.
28. D. Kozen. Automata and planar graphs. In Fund. Computat. Theory (FCT), 243-254, 1979.
29. A. López-Ortiz and S. Schuierer. On-line parallel heuristics and robot searching under the competitive framework. In 8th Scandinavian Workshop on Algorithm Theory (SWAT), 2002.
30. H. Müller. Endliche Automaten und Labyrinthe. Elektronische Informationsverarbeitung und Kybernetic, EIK 7/4, 261-264, 1971.
31. H. Müller. Automata catching labyrinths with at most three components. Elektronische Informationsverarbeitung und Kybernetic, EIK 15(1-2):3-9, 1979.
32. P. Panaite and A. Pelc, Exploring unknown undirected graphs, J. Algorithms 33:281-295, 1999.
33. M.O. Rabin, Maze threading automata. Seminar talk presented at the University of California at Berkeley, October 1967.
34. N. Rao, S. Kareti, W. Shi, and S. Iyengar. Robot navigation in unknown terrains: Introductory survey of length, non-heuristic algorithms. Tech. Report ORNL/TM-12410, Oak Ridge National Lab., 1993.
35. H.A. Rollik. Automaten in planaren Graphen. Acta Informatica 13:287-298, 1980
36. (also in LNCS 67, pages 266-275, 1979).
37. CL. E. Shannon. Presentation of a maze-solving machine. In 8th Conf. of the Josiah Macy Jr. Found. (Cybernetics), pages 173-180, 1951.