메뉴 건너뛰기




Volumn 2, Issue , 2012, Pages 977-983

Kernel-based reinforcement learning on representative states

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY LEVELS; CONTINUOUS STATE; CONTINUOUS VARIABLES; CONTROL PROBLEMS; DECISION-MAKING PROBLEM; FIXED POINTS; MARKOV DECISION PROCESSES; OPTIMAL SOLUTIONS; TIME COMPLEXITY; TRAINING EXAMPLE;

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

References (17)
  • 2
    • 85012688561 scopus 로고
    • Princeton, NJ: Princeton University Press
    • Bellman. R. 1957. Dynamic Programming. Princeton, NJ: Princeton University Press.
    • (1957) Dynamic Programming
    • Bellman, R.1
  • 5
    • 0041965975 scopus 로고    scopus 로고
    • R-MAX - A general polynomial time algorithm for near-optimal reinforcement learning
    • Brafman, R., and Tennenholtz, M. 2003. R-MAX - a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research 3:213-231.
    • (2003) Journal of Machine Learning Research , vol.3 , pp. 213-231
    • Brafman, R.1    Tennenholtz, M.2
  • 6
    • 0026206780 scopus 로고
    • An optimal one-way multigrid algorithm for discrete-time stochastic control
    • Chow, C.-S., and Tsitsiklis, J. 1991. An optimal one-way multigrid algorithm for discrete-time stochastic control. IEEE Transactions on Automatic Control 36(8):898-914.
    • (1991) IEEE Transactions on Automatic Control , vol.36 , Issue.8 , pp. 898-914
    • Chow, C.-S.1    Tsitsiklis, J.2
  • 14
    • 0036832956 scopus 로고    scopus 로고
    • Kernel-based reinforcement learning
    • Ormoneit, D., and Sen, S. 2002. Kernel-based reinforcement learning. Machine Learning 49:161-178.
    • (2002) Machine Learning , vol.49 , pp. 161-178
    • Ormoneit, D.1    Sen, S.2


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