메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 1181-1186

Prottle: A probabilistic temporal planner

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATA STRUCTURES; HEURISTIC METHODS; PROBLEM SOLVING; STATE SPACE METHODS;

EID: 29344470126     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (22)

References (15)
  • 1
    • 13444288352 scopus 로고    scopus 로고
    • Decision-theoretic military operations planning
    • Aberdeen, D., Thiébaux, S., and Zhang, L. 2004. Decision-theoretic military operations planning. In Proc. ICAPS.
    • (2004) Proc. ICAPS
    • Aberdeen, D.1    Thiébaux, S.2    Zhang, L.3
  • 2
    • 84880884193 scopus 로고    scopus 로고
    • Planning with resources and concurrency: A forward chaining approach
    • Bacchus, F., and Ady, M. 2001. Planning with resources and concurrency: A forward chaining approach. In Proc. IJCAI.
    • (2001) Proc. IJCAI
    • Bacchus, F.1    Ady, M.2
  • 3
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90:281-300.
    • (1997) Artificial Intelligence , vol.90 , pp. 281-300
    • Blum, A.1    Furst, M.2
  • 4
    • 1642508388 scopus 로고    scopus 로고
    • Probabilistic planning in the Graphplan framework
    • Blum, A., and Langford, J. 1999. Probabilistic planning in the Graphplan framework. In Proc. ECP.
    • (1999) Proc. ECP
    • Blum, A.1    Langford, J.2
  • 5
    • 9444233135 scopus 로고    scopus 로고
    • Labeled RTDP: Improving the convergence of real-time dynamic programming
    • Bonet, B., and Geffner, H. 2003. Labeled RTDP: Improving the convergence of real-time dynamic programming. In Proc. ICAPS.
    • (2003) Proc. ICAPS
    • Bonet, B.1    Geffner, H.2
  • 7
    • 13444294407 scopus 로고    scopus 로고
    • Planning graph-based heuristics for cost-sensitive temporal planning
    • Do, M., and Kambhampati, S. 2002. Planning graph-based heuristics for cost-sensitive temporal planning. In Proc. AIPS.
    • (2002) Proc. AIPS
    • Do, M.1    Kambhampati, S.2
  • 8
    • 27444434099 scopus 로고    scopus 로고
    • PDDL2.1: An extension to PDDL for expressing temporal planning domains
    • Fox, M., and Long, D. 2003. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20:61-124.
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 61-124
    • Fox, M.1    Long, D.2
  • 10
    • 29344449965 scopus 로고    scopus 로고
    • Honours Thesis, Department of Computer Science, The Australian National University
    • Little, I. 2004. Probabilistic temporal planning. Honours Thesis, Department of Computer Science, The Australian National University.
    • (2004) Probabilistic Temporal Planning
    • Little, I.1
  • 11
    • 29344459580 scopus 로고    scopus 로고
    • Solving concurrent Markov decision processes
    • Mausam, and Weld, D. 2004. Solving concurrent Markov decision processes. In Proc. AAAI.
    • (2004) Proc. AAAI
    • Mausam1    Weld, D.2
  • 12
    • 33746077967 scopus 로고    scopus 로고
    • Concurrent probabilistic temporal planning
    • Mausam, and Weld, D. 2005. Concurrent probabilistic temporal planning. In Proc. ICAPS.
    • (2005) Proc. ICAPS
    • Mausam1    Weld, D.2
  • 13
    • 84880691938 scopus 로고    scopus 로고
    • Temporal planning with mutual exclusion reasoning
    • Smith, D., and Weld, D. 1999. Temporal planning with mutual exclusion reasoning. In Proc. IJCAI.
    • (1999) Proc. IJCAI
    • Smith, D.1    Weld, D.2
  • 15
    • 13444256700 scopus 로고    scopus 로고
    • Policy generation for continuous-time stochastic domains with concurrency
    • Younes, H. L. S., and Simmons, R. G. 2004. Policy generation for continuous-time stochastic domains with concurrency. In Proc. ICAPS.
    • (2004) Proc. ICAPS
    • Younes, H.L.S.1    Simmons, R.G.2


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