메뉴 건너뛰기




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

Exploring unknown environments

Author keywords

[No Author keywords available]

Indexed keywords

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

EID: 0033714291     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979732428X     Document Type: Article
Times cited : (221)

References (19)
  • 4
    • 0342545781 scopus 로고    scopus 로고
    • Time-space lower bounds for directed s-t connectivity on graph automata models
    • 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.
    • (1998) SIAM J. Comput. , vol.27 , pp. 1190-1202
    • Barnes, G.1    Edmonds, J.2
  • 7
    • 0003187777 scopus 로고    scopus 로고
    • Navigating in unfamiliar geometric terrain
    • A. BLUM, P. RAGHAVAN, AND B. SCHIEBER, Navigating in unfamiliar geometric terrain, SIAM J. Comput., 26 (1997), pp. 110-137.
    • (1997) SIAM J. Comput. , vol.26 , pp. 110-137
    • Blum, A.1    Raghavan, P.2    Schieber, B.3
  • 8
    • 0029256026 scopus 로고
    • Piecemeal learning of an unknown environment
    • M. BETKE, R. RIVEST, AND M. SINGH, Piecemeal learning of an unknown environment, Machine Learning, 18 (1995), pp. 231-254.
    • (1995) Machine Learning , vol.18 , pp. 231-254
    • Betke, M.1    Rivest, R.2    Singh, M.3
  • 9
    • 84936752559 scopus 로고
    • The power of team exploration: Two robots can learn unlabeled directed graphs
    • IEEE Computer Society, Los Alanmitos, CA
    • 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.
    • (1994) Proceedings of the 35th Symposium on Foundations of Computer Science , pp. 75-85
    • Bender, M.1    Slonim, D.2
  • 10
    • 0000434997 scopus 로고
    • Space lower bounds for maze threadability on restricted machines
    • S. A. COOK AND C. W. RACKOFF, Space lower bounds for maze threadability on restricted machines, SIAM J. Comput., 9 (1980), pp. 636-652.
    • (1980) SIAM J. Comput. , vol.9 , pp. 636-652
    • Cook, S.A.1    Rackoff, C.W.2
  • 11
    • 0032026129 scopus 로고    scopus 로고
    • How to learn an unknown environment
    • X. DENG, T. KAMEDA, AND C. H. PAPADIMITRIOU, How to learn an unknown environment, J. ACM, 45 (1998), pp. 215-245.
    • (1998) J. ACM , vol.45 , pp. 215-245
    • Deng, X.1    Kameda, T.2    Papadimitriou, C.H.3
  • 14
    • 0004290830 scopus 로고
    • A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model
    • ACM, New York
    • 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.
    • (1995) Proceedings of the 27th Symposium on the Theory of Computing , pp. 147-156
    • Edmonds, J.1    Poon, C.K.2
  • 16
    • 85037787361 scopus 로고    scopus 로고
    • result reported in [13]
    • E. KOUTSOUPIAS, result reported in [13].
    • Koutsoupias, E.1
  • 17
    • 84947940108 scopus 로고    scopus 로고
    • On a simple depth-first search strategy for exploring unknown graphs
    • Proceedings of the 5th Workshop on Algorithms and Data Structures, Springer-Verlag, New York
    • 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.
    • (1997) Lecture Notes in Comput. Sci. , vol.1272 , pp. 345-353
    • Kwek, S.1
  • 19
    • 85037796439 scopus 로고    scopus 로고
    • problem formulation cited in [12]
    • R. RIVEST, problem formulation cited in [12].
    • Rivest, R.1


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