메뉴 건너뛰기




Volumn 2, Issue , 1997, Pages 1158-1162

Prioritized goal decomposition of Markov decision processes: Toward a synthesis of classical and decision theoretic planning

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION MECHANISM; DECISION-THEORETIC PLANNING; MARKOV DECISION PROCESSES; MERGING TECHNIQUES; PROVIDE GUIDANCES; VALUE FUNCTIONS;

EID: 84880685295     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (33)

References (14)
  • 2
    • 85166207010 scopus 로고
    • Exploiting structure in policy construction
    • Montreal
    • C Boutilier, R. Dearden, and M. Goldszmidt. Exploiting structure in policy construction. In IJCAJ-95, pp. 1104-1111, Montreal, 1995.
    • (1995) IJCAJ-95 , pp. 1104-1111
    • Boutilier, C.1    Dearden, R.2    Goldszmidt, M.3
  • 4
    • 0027708037 scopus 로고
    • Planning with deadlines in stochastic domains
    • Washington, D.C.
    • T. Dean, L. P. Kaelbling, J. Kirman, and A. Nicholson. Planning with deadlines in stochastic domains. In AAAI-93, pp.574-579, Washington, D.C., 1993.
    • (1993) AAAI-93 , pp. 574-579
    • Dean, T.1    Kaelbling, L.P.2    Kirman, J.3    Nicholson, A.4
  • 5
    • 84990553353 scopus 로고
    • A model for reasoning about persistence and causation
    • T. Dean and K. Kanazawa. A model for reasoning about persistence and causation. Comp. Intel., 5(3): 142-150,1989.
    • (1989) Comp. Intel. , vol.5 , Issue.3 , pp. 142-150
    • Dean, T.1    Kanazawa, K.2
  • 6
    • 0030697013 scopus 로고    scopus 로고
    • Abstraction and approximate decision-theoretic planning
    • PII S0004370296000239
    • R. Dearden and C. Boutilier. Abstraction and approximate decision theoretic planning. Artif. Intel., 89:219-283, 1997. (Pubitemid 127412235)
    • (1997) Artificial Intelligence , vol.89 , Issue.1-2 , pp. 219-283
    • Dearden, R.1    Boutilier, C.2
  • 9
    • 0028566295 scopus 로고
    • An algorithm for probabilistic least-commitment planning
    • Seattle
    • N. Kushmerick, S. Hanks, and D. Weld. An algorithm for probabilistic least-commitment planning. In AAA/-94, pp. 1073-1078, Seattle, 1994.
    • (1994) AAA/-94 , pp. 1073-1078
    • Kushmerick, N.1    Hanks, S.2    Weld, D.3
  • 10
    • 0342772590 scopus 로고
    • Systematic nonlinear planning
    • Anaheim
    • D. McAilester and D. Rosenblitt. Systematic nonlinear planning. In AAA/-9/, pp.634-639, Anaheim, 1991.
    • (1991) AAA/-9 , pp. 634-639
    • McAilester, D.1    Rosenblitt, D.2
  • 11
    • 0002489296 scopus 로고
    • UCPOP: A sound, complete, partial order planner for adl
    • J. S. Penberthy and D. S. Weld. UCPOP: A sound, complete, partial order planner for adl. In KR-92, 1992.
    • (1992) KR-92
    • Penberthy, J.S.1    Weld, D.S.2
  • 13
    • 0028750404 scopus 로고
    • An introduction to least commitment planning
    • Winter 1994
    • D. S. Weld. An introduction to least commitment planning. Al Magazine, Winter 1994:27-61,1994.
    • (1994) Al Magazine , pp. 27-61
    • Weld, D.S.1
  • 14
    • 84880647869 scopus 로고
    • Merging seperately generated plans in limited domains
    • Q. Yang, D. S. Nau, and J. Hendler. Merging seperately generated plans in limited domains. Comp. Intel, 8(4), 1992.
    • (1992) Comp. Intel , vol.8 , Issue.4
    • Yang, Q.1    Nau, D.S.2    Hendler, J.3


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