메뉴 건너뛰기




Volumn 1, Issue , 2008, Pages 486-493

The permutable POMDP: Fast solutions to POMDPs for preference elicitation

Author keywords

Decision making under uncertainty

Indexed keywords

MULTI AGENT SYSTEMS;

EID: 84899990618     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (32)

References (13)
  • 5
    • 0012257655 scopus 로고    scopus 로고
    • Near-optimal reinforcement learning in polynomial time
    • M. Kearns and S. Singh. Near-optimal reinforcement learning in polynomial time. ICML, 1998.
    • (1998) ICML
    • Kearns, M.1    Singh, S.2
  • 6
    • 84880772945 scopus 로고    scopus 로고
    • Point-based value iteration: An anytime algorithm forpomdps
    • J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm forpomdps. IJCAI, 2003.
    • (2003) IJCAI
    • Pineau, J.1    Gordon, G.2    Thrun, S.3
  • 7
    • 84883297286 scopus 로고    scopus 로고
    • The advisor-pomdp: A principled approach to trust through reputation in electronic markets
    • K Regan, R. Cohen, and P. Poupart. The advisor-pomdp: A principled approach to trust through reputation in electronic markets. Conference on Privacy Security and Trust, 2005.
    • (2005) Conference on Privacy Security and Trust
    • Regan, K.1    Cohen, R.2    Poupart, P.3
  • 9
    • 84880906197 scopus 로고    scopus 로고
    • Forward search value iteration for pomdps
    • G. Shani, R. Brafman, and S. Shimony. Forward search value iteration for pomdps. IJCAI, 2007.
    • (2007) IJCAI
    • Shani, G.1    Brafman, R.2    Shimony, S.3
  • 10
    • 31144465830 scopus 로고    scopus 로고
    • Heuristic search value iteration for pomdps
    • Banff, Alberta
    • T. Smith and R. Simmons. Heuristic search value iteration for pomdps. In Proc. of UAI 2004, Banff, Alberta, 2004.
    • (2004) Proc. of UAI 2004
    • Smith, T.1    Simmons, R.2
  • 13


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