메뉴 건너뛰기




Volumn 148, Issue , 2006, Pages 561-568

Region-based value iteration for partially observable Markov decision processes

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV DECISION PROCESSES; OPTIMAL POLICY; POLYHEDRAL PARTITION; REGION-BASED VALUE ITERATION (RBVI);

EID: 34250694951     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143915     Document Type: Conference Paper
Times cited : (1)

References (14)
  • 1
    • 0031385391 scopus 로고    scopus 로고
    • A heuristic variable grid solution method for pomdps
    • Brafman, R. I. (1997). A heuristic variable grid solution method for pomdps. AAAI (pp. 727-733).
    • (1997) AAAI , pp. 727-733
    • Brafman, R.I.1
  • 3
    • 4043061882 scopus 로고    scopus 로고
    • Variational Bayesian model selection for mixture distributions
    • Corduneanu, A., & Bishop, C. (2001). Variational Bayesian model selection for mixture distributions. AI and Statistics (pp. 27-34).
    • (2001) AI and Statistics , pp. 27-34
    • Corduneanu, A.1    Bishop, C.2
  • 4
    • 0032073263 scopus 로고    scopus 로고
    • Planning and acting in partially observable stochastic domains
    • Kaelbling, L., Littman, M., & Cassandra, A. (1998). Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101, 99-134.
    • (1998) Artificial Intelligence , vol.101 , pp. 99-134
    • Kaelbling, L.1    Littman, M.2    Cassandra, A.3
  • 5
    • 85138579181 scopus 로고
    • Learning policies for partially obsevable environments:scaling up
    • Littman, M. L., Cassandra, A. R., & Kaelbling, L. P. (1995). Learning policies for partially obsevable environments:scaling up. ICML (pp. 362-370).
    • (1995) ICML , pp. 362-370
    • Littman, M.L.1    Cassandra, A.R.2    Kaelbling, L.P.3
  • 6
    • 0000494894 scopus 로고
    • Computationally feasible bounds for partially observed Markov decision processes
    • Lovejoy, W. S. (1991). Computationally feasible bounds for partially observed Markov decision processes. Operations Research, 39, 162-175.
    • (1991) Operations Research , vol.39 , pp. 162-175
    • Lovejoy, W.S.1
  • 7
    • 84880772945 scopus 로고    scopus 로고
    • Point-based value iteration: An anytime algorithm for POMDPs
    • Pineau, J., Gordon, G., & Thrun, S. (2003). Point-based value iteration: An anytime algorithm for POMDPs. IJCAI (pp. 1025-1032).
    • (2003) IJCAI , pp. 1025-1032
    • Pineau, J.1    Gordon, G.2    Thrun, S.3
  • 9
    • 33745673007 scopus 로고    scopus 로고
    • Bounded finite state controllers
    • Poupart, P., & Boutilier, C. (2003). Bounded finite state controllers. NIPS.
    • (2003) NIPS
    • Poupart, P.1    Boutilier, C.2
  • 10
    • 0015658957 scopus 로고
    • The optimal control of partially observable Markov processes over a finite horizon
    • Smallwood, R. D., & Sondik, E. J. (1973). The optimal control of partially observable Markov processes over a finite horizon. Operational Research, 21, 1071-1088.
    • (1973) Operational Research , vol.21 , pp. 1071-1088
    • Smallwood, R.D.1    Sondik, E.J.2
  • 11
    • 31144465830 scopus 로고    scopus 로고
    • Heuristic search value iteration for POMDPs
    • Smith, T., & Simmons, R. (2004). Heuristic search value iteration for POMDPs. Proc. of UAI.
    • (2004) Proc. of UAI
    • Smith, T.1    Simmons, R.2
  • 12
    • 80053262864 scopus 로고    scopus 로고
    • Point-based POMDP algorithms: Improved analysis and implementation
    • Smith, T., & Simmons, R. (2005). Point-based POMDP algorithms: Improved analysis and implementation. Proc. of UAI.
    • (2005) Proc. of UAI
    • Smith, T.1    Simmons, R.2


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