메뉴 건너뛰기




Volumn , Issue , 2004, Pages 304-311

Planning with predictive state representations

Author keywords

[No Author keywords available]

Indexed keywords

INCREMENTAL PRUNING (IP) ALGORITHMS; PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES (POMDP); PREDICTIVE STATE REPRESENTATION (PSR) MODELS; Q-LEARNING ALGORITHMS; STOCHASTIC DYNAMICAL SYSTEMS;

EID: 21244494809     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (35)

References (13)
  • 1
    • 49649148257 scopus 로고
    • A theory of cerebellar function
    • J.S. Albus. A theory of cerebellar function. Mathematical Biosciences, 10:25-61, 1971.
    • (1971) Mathematical Biosciences , vol.10 , pp. 25-61
    • Albus, J.S.1
  • 3
    • 0001909869 scopus 로고    scopus 로고
    • Incremental Pruning: A simple, fast, exact method for partially observable Markov decision processes
    • Dan Geiger and Prakash Pundalik Shenoy, editors, San Francisco, CA, Morgan Kaufmann Publishers
    • Anthony Cassandra, Michael L. Littman, and Nevin L. Zhang. Incremental Pruning: A simple, fast, exact method for partially observable Markov decision processes. In Dan Geiger and Prakash Pundalik Shenoy, editors, Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-97), pages 54-61, San Francisco, CA, 1997. Morgan Kaufmann Publishers.
    • (1997) Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-97) , pp. 54-61
    • Cassandra, A.1    Littman, M.L.2    Zhang, N.L.3
  • 8
    • 0003861655 scopus 로고    scopus 로고
    • Algorithms for sequential decision making
    • Michael Lederman Littman. Algorithms for sequential decision making. Technical Report CS-96-09, 1996.
    • (1996) Technical Report , vol.CS-96-09
    • Littman, M.L.1
  • 11
    • 0029276036 scopus 로고
    • Td-gammon, a self-teaching backgammon program, achieves master-level play
    • Gerald Tesauro. Td-gammon, a self-teaching backgammon program, achieves master-level play. Communications of the ACM, 38:58-68, 1995.
    • (1995) Communications of the ACM , vol.38 , pp. 58-68
    • Tesauro, G.1
  • 13
    • 0010810245 scopus 로고    scopus 로고
    • Planning in stochastic domains: Problem characteristics and approximation
    • Nevin L. Zhang and Wenju Liu. Planning in stochastic domains: Problem characteristics and approximation. Technical Report HKUST-CS96-31, 1996.
    • (1996) Technical Report , vol.HKUST-CS96-31
    • Zhang, N.L.1    Liu, W.2


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