SCOPUS 정보 검색 플랫폼

Volumn , Issue , 2000, Pages 1001-1007

Apprximate planning in large POMDPs via reusable trajectories

Author keywords

[No Author keywords available]

Indexed keywords

REINFORCEMENT LEARNING;

LOCAL SEARCH ALGORITHM; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; SAMPLE COMPLEXITY; STRATEGY CLASS; UPPER BOUND; VC DIMENSION;

COMPUTER SOFTWARE REUSABILITY;

EID: 84898967749 PISSN: 10495258 EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (92)

References (10)

1
- 84898958374
- Gradient descent for general reinforcement learning
- L. Baird and A. W. Moore. Gradient descent for general Reinforcement Learning. In Advances in Neural Information Processing Systems 11, 1999.
- (1999) Advances in Neural Information Processing Systems , vol.11
- Baird, L.¹ Moore, A.W.²

2
- 0346942368
- Decision theoretic planning: Structural assumptions and computational leverage
- C. Boutilier, T. Dean, and S. Hanks. Decision theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 1999.
- (1999) Journal of Artificial Intelligence Research
- Boutilier, C.¹ Dean, T.² Hanks, S.³

3
- 0002436850
- Tractable inference for complex stochastic processes
- X. Boyen and D. Roller. Tractable inference for complex stochastic processes. In Proc. UAI, pages 33-42, 1998.
- (1998) Proc. UAI , pp. 33-42
- Boyen, X.¹ Roller, D.²

4
- 0002192516
- Decision theoretic generalizations of the PAC model for neural net and oter learning applications
- David Haussier. Decision theoretic generalizations of the PAC model for neural net and oter learning applications. Information and Computation, 100:78-150, 1992.
- (1992) Information and Computation , vol.100 , pp. 78-150
- Haussier, D.¹

5
- 0032073263
- Planning and acting in partially observable stochastic domains
- L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101, 1998.
- (1998) Artificial Intelligence , vol.101
- Kaelbling, L.P.¹ Littman, M.L.² Cassandra, A.R.³

6
- 84899006669
- M. Keams, Y. Mansour, and A. Y. Ng. Approximate planning in large POMDPs via reusable trajectories, (long version), 1999.
- (1999) Approximate Planning in Large POMDPs Via Reusable Trajectories (Long Version
- Keams, M.¹ Mansour, Y.² Ng, A.Y.³

7
- 84880688552
- Computing factored value functions for policies in structured MDPs
- D. Roller and R. Parr. Computing factored value functions for policies in structured MDPs. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999.
- (1999) Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
- Roller, D.¹ Parr, R.²

8
- 0004007508
- MIT Press
- R. S. Sutton and A. G. Barto. Reinforcement Learning. MIT Press, 1998.
- (1998) Reinforcement Learning
- Sutton, R.S.¹ Barto, A.G.²

9
- 0003969585
- Springer-Verlag
- V.N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer-Verlag, 1982.
- (1982) Estimation of Dependences Based on Empirical Data
- Vapnik, V.N.¹

10
- 0000337576
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- R. J. Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8:229-256, 1992.
- (1992) Machine Learning , vol.8 , pp. 229-256
- Williams, R.J.¹

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