SCOPUS 정보 검색 플랫폼

Volumn 33, Issue 2, 1999, Pages 281-295

Exploring Unknown Undirected Graphs

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000049929 PISSN: 01966774 EISSN: None Source Type: Journal
DOI: 10.1006/jagm.1999.1043 Document Type: Article

Times cited : (148)

References (12)

2
- 84923103437
- Piecemeal graph learning by a mobile robot
- B. Awerbuch, M. Betke, R. Rivest, and M. Singh, Piecemeal graph learning by a mobile robot, in "Proceedings 8th Conf. on Comput. Learning Theory, 1995," pp. 321-328.
- Proceedings 8th Conf. on Comput. Learning Theory, 1995 , pp. 321-328
- Awerbuch, B.¹ Betke, M.² Rivest, R.³ Singh, M.⁴

3
- 0000577784
- On-line navigation in a room
- E. Bar-Eli, P. Berman, A. Fiat, and R. Yan, On-line navigation in a room, J. Algorithms 17 (1994), 319-341.
- (1994) J. Algorithms , vol.17 , pp. 319-341
- Bar-Eli, E.¹ Berman, P.² Fiat, A.³ Yan, R.⁴

4
- 84966888626
- Randomized robot navigation algorithms
- P. Berman, A. Blum, A. Fiat, H. Karloff, A. Rosen, and M. Saks, Randomized robot navigation algorithms, in "Proceedings 7th ACM-SIAM Symp. on Discrete Algorithms, 1996," pp. 74-84.
- Proceedings 7th ACM-SIAM Symp. on Discrete Algorithms, 1996 , pp. 74-84
- Berman, P.¹ Blum, A.² Fiat, A.³ Karloff, H.⁴ Rosen, A.⁵ Saks, M.⁶

5
- 0003187777
- Navigating in unfamiliar geometric terrain
- A. Blum, P. Raghavan, and B. Schieber, Navigating in unfamiliar geometric terrain, SIAM J. Comput. 26 (1997), 110-137.
- (1997) SIAM J. Comput. , vol.26 , pp. 110-137
- Blum, A.¹ Raghavan, P.² Schieber, B.³

6
- 0029256026
- Piecemeal learning of an unknown environment
- M. Betke, R. Rivest, and M. Singh, Piecemeal learning of an unknown environment, Mach. Learning 18 (1995), 231-254.
- (1995) Mach. Learning , vol.18 , pp. 231-254
- Betke, M.¹ Rivest, R.² Singh, M.³

7
- 0032026129
- How to learn an unknown environment. I. The rectilinear case
- X. Deng, T. Kameda, and C. H. Papadimitriou, How to learn an unknown environment. I. The rectilinear case, J. ACM 45 (1998), 215-245.
- (1998) J. ACM , vol.45 , pp. 215-245
- Deng, X.¹ Kameda, T.² Papadimitriou, C.H.³

9
- 0030782578
- A competitive strategy for learning a polygon
- F. Hoffmann, C. Icking, R. Klein, and R. Kriegel, A competitive strategy for learning a polygon, in "Proceedings, 8th ACM-SIAM Symp. on Discrete Algorithms, 1997," pp. 166-174.
- Proceedings, 8th ACM-SIAM Symp. on Discrete Algorithms, 1997 , pp. 166-174
- Hoffmann, F.¹ Icking, C.² Klein, R.³ Kriegel, R.⁴

10
- 0032284322
- Exploring unknown undirected graphs
- P. Panaite and A. Pelc, Exploring unknown undirected graphs, in "Proceedings, 9th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1998," pp. 316-322.
- Proceedings, 9th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1998 , pp. 316-322
- Panaite, P.¹ Pelc, A.²

11
- 0026190127
- Shortest paths without a map
- C. H. Papadimitriou and M. Yannakakis, Shortest paths without a map, Theoret. Comput. Sci. 84 (1991), 127-150.
- (1991) Theoret. Comput. Sci. , vol.84 , pp. 127-150
- Papadimitriou, C.H.¹ Yannakakis, M.²

12
- 0003634992
- Technical Report ORNL/TM-12410, Oak Ridge National Laboratory, July
- N. S. V. Rao, S. Hareti, W. Shi, and S. S. Iyengar, "Robot Navigation in Unknown Terrains: Introductory Survey of Non-heuristic Algorithms," Technical Report ORNL/TM-12410, Oak Ridge National Laboratory, July 1993.
- (1993) Robot Navigation in Unknown Terrains: Introductory Survey of Non-heuristic Algorithms
- Rao, N.S.V.¹ Hareti, S.² Shi, W.³ Iyengar, S.S.⁴

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.