메뉴 건너뛰기




Volumn , Issue , 2004, Pages

Envelope-based planning in relational MDPs

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SETS; LARGE AMOUNTS; PROBLEM STRUCTURE; RELATIONAL MDP; SENSORY DATA;

EID: 84898930526     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (14)
  • 1
    • 0031074857 scopus 로고    scopus 로고
    • Fast plannning through planning graph analysis
    • Avrim L. Blum and Merrick L. Furst. Fast plannning through planning graph analysis. Artificial Intelligence, 90:281-300, 1997.
    • (1997) Artificial Intelligence , vol.90 , pp. 281-300
    • Blum, A.L.1    Furst, M.L.2
  • 3
    • 84880891360 scopus 로고    scopus 로고
    • Symbolic dynamic programming for firstorder MDPs
    • Craig Boutilier, Raymond Reiter, and Bob Price. Symbolic dynamic programming for firstorder MDPs. In IJCAI, 2001.
    • (2001) IJCAI
    • Boutilier, C.1    Reiter, R.2    Price, B.3
  • 5
    • 1942419280 scopus 로고    scopus 로고
    • Speeding up relational reinforcement learning through the use of an incremental first order decision tree learner
    • Kurt Driessens, Jan Ramon, and Hendrik Blockeel. Speeding up relational reinforcement learning through the use of an incremental first order decision tree learner. In European Conference on Machine Learning, 2001.
    • (2001) European Conference on Machine Learning
    • Driessens, K.1    Ramon, J.2    Blockeel, H.3
  • 12
    • 0032633177 scopus 로고    scopus 로고
    • Recent advances in AI planning
    • Daniel S. Weld. Recent advances in AI planning. AI Magazine, 20(2):93-123, 1999.
    • (1999) AI Magazine , vol.20 , Issue.2 , pp. 93-123
    • Weld, D.S.1
  • 13


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