Graph exploration by a finite automaton

Theoretical Computer Science

Volumn 345, Issue 2-3, 2005, Pages 331-344

  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

Finite automaton; Graph exploration; Labyrinth; Mobile agent; Robot

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; KNOWLEDGE ACQUISITION; ROBOTS; SOFTWARE AGENTS; TOPOLOGY;

EDGE PORTS; GRAPH EXPLORATION; LABYRINTH; SPACE COMPLEXITY;

FINITE AUTOMATA;

EID: 27644490304     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.014     Document Type: Conference Paper

References (44)

1. S. Albers, and M.R. Henzinger Exploring unknown environments SIAM J. Comput. 29 2000 1164 1188
2. N. Alon, Y. Azar, and Y. Ravid Universal sequences for complete graphs Discrete Appl. Math. 27 1990 25 28
3. H. Antelmann, L. Budach, and H.A. Rollik On universal traps. Elektronische Informationsverarbeitung und Kybernetic EIK 15 3 1979 123 131
4. B. Awerbuch, M. Betke, R. Rivest, and M. Singh Piecemeal graph learning by a mobile robot Inform. Comput. 152 2 1999 155 172
5. L. Babai, N. Nisan, and M. Szegedy Multiparty protocols and logspace-hard pseudorandom sequences J. Comput. System Sci. 45 2 1992 204 232
6. E. Bar-Eli, P. Berman, A. Fiat, and P. Yan Online navigation in a room J. Algorithms 17 1994 319 341
7. A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial, and M. Werman Bounds on universal sequences SIAM J. Comput. 18 2 1989 268 277
8. M. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan The power of a pebble: exploring and mapping directed graphs Inform. Comput. 176 1 2002 1 21
9. M. Bender, D. Slonim, The power of team exploration: two robots can learn unlabeled directed graphs, in: 35th Annu. Symp. on Foundations of Computer Science (FOCS), 1994, pp. 75-85.
10. M. Betke, R. Rivest, and M. Singh Piecemeal learning of an unknown environment Machine Learning 18 1995 231 254
11. A. Blum, P. Raghavan, and B. Schieber Navigating in unfamiliar geometric terrain SIAM J. Comput. 26 1997 110 137
12. M. Blum, D. Kozen, On the power of the compass (or, why mazes are easier to search than graphs), in: 19th Symp. on Foundations of Computer Science (FOCS), 1978, pp. 132-142.
13. M. Blum, W. Sakoda, On the capability of finite automata in 2 and 3 dimensional space, in: 18th Annu. Symp. on Foundations of Computer Science (FOCS), 1977, pp. 147-161.
14. M. Bridgland Universal traversal sequences for paths and cycles J. Algorithms 8 3 1987 395 404
15. L. Budach On the solution of the labyrinth problem for finite automata. Elektronische Informationsverarbeitung und Kybernetic EIK 11 10-12 1975 661 672
16. L. Budach, Automata and labyrinths, Math. Nachr. (1978) 195-282.
17. J. Buss, and M. Tompa Lower bounds on universal traversal sequences based on chains of length five Inform. Comput. 120 2 1995 326 329
18. W. Coy, Automata in labyrinths, in: Fundamental Computational Theory (FCT), Lecture Notes of Computer Science, Vol. 56, 1977, pp. 65-71.
19. X. Deng, T. Kameda, and C.H. Papadimitriou How to learn an unknown environment I: the rectilinear case J. ACM 45 2 1998 215 245
20. X. Deng, and C.H. Papadimitriou Exploring an unknown graph J. Graph Theory 32 3 1999 265 297
21. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc Tree exploration with little memory J. Algorithms 51 1 2004 38 63
22. K. Döpp, Automaten in Labyrinthen Elektronische, Informationsverarbeitung und Kybernetic, EIK 7(2) & 7(3) 79-94 (1971) 167-189.
23. G. Dudek, M. Jenkins, E. Milios, and D. Wilkes Robotic exploration as graph construction IEEE Trans. Robotics Automation 7 6 1991 859 865
24. C. Duncan, S. Kobourov, V. Kumar, Optimal constrained graph exploration, in: 12th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2001, pp. 807-814.
25. P. Fraigniaud, L. Gasieniec, D. Kowalski, A. Pelc, Collective Tree Exploration Proc. Latin American Theoretical Informatics (LATIN'2004), Buenos Aires, Argentina, Lecture Notes of Computer Science, Vol. 2976, April 2004, pp. 141-151.
26. P. Fraigniaud, D. Ilcinkas, Directed graphs exploration with little memory, in: 21st Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes of Computer Science, Vol. 1996, 2004, pp. 246-257.
27. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, D. Peleg, Graph exploration by a finite automaton, in: 29th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS), Lecture Notes of Computer Science, Vol. 3153, 2004, pp. 451-462.
28. A. Hemmerling, Labyrinth Problems: Labyrinth-Searching Abilities of Automata, Teubner-Texte zur Mathematik, Vol. 114, B. G. Teubner Verlagsgesellschaft, Leipzig, 1989.
29. F. Hoffmann, One pebble does not suffice to search plane labyrinths, in: Fundamental Computational Theory (FCT), Lecture Notes of Computer Science, Vol. 117, 1981, pp. 433-444.
30. S. Hoory, and A. Widgerson Universal traversal sequences for expander graphs Inform. Process. Lett. 46 2 1993 67 69
31. R. Impagliazzo, N. Nisan, A. Widgerson, Pseudorandomness for network algorithms, in: 26th Annu. ACM Symp. on Theory of Computing (STOC), 1994, pp. 356-364.
32. S. Istrail, Polynomial universal traversing sequences for cycles are constructible, in: 20th Annual ACM Symp. on Theory of Computing (STOC), 1988, pp. 491-503.
33. H. Karloff, R. Paturi, and J. Simon Universal traversal sequences of length n O (log n ) for cliques Inform. Process. Lett. 28 5 1988 241 243
34. M. Kouckỳ Log-space constructible universal traversal sequences for cycles of length O (n 4.03 ) Theoret. Comput. Sci. 296 1 2003 117 144
35. D. Kozen, Automata and planar graphs, in: Fundamental Computational Theory (FCT), 1979, pp. 243-254.
36. A. López-Ortiz, and S. Schuierer On-line parallel heuristics, processor scheduling and robot searching under the competitive framework Theoret. Comput. Sci. 310 1-3 2004 527 537
37. H. Müller Endliche Automaten und Labyrinthe Elektronische Informationsverarbeitung und Kybernetic, EIK 7 4 1971 261 264
38. H. Müller Automata catching labyrinths with at most three components Elektronische Informationsverarbeitung und Kybernetic, EIK 15 1-2 1979 3 9
39. N. Nisan Pseudorandom generators for space-bounded computation Combinatorica 12 4 1992 449 461
40. P. Panaite, and A. Pelc Exploring unknown undirected graphs J. Algorithms 33 2 1999 281 295
41. M.O. Rabin, Maze threading automata, Seminar talk presented at the University of California at Berkeley, October 1967.
42. N. Rao, S. Kareti, W. Shi, S. Iyengar, Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms, Technical Report ORNL/TM-12410, Oak Ridge National Laboratories, 1993.
43. H. Rollik Automaten in planaren Graphen Acta Informatica 13 1980 287 298 (also in Lecture Notes of Computer Science, Vol. 67, 1979, pp. 266-275)
44. C. Shannon, Presentation of a maze-solving machine, in: Eighth Conf. of the Josiah Macy Jr. Found. (Cybernetics), 1951, pp. 173-180.