메뉴 건너뛰기




Volumn 8077 LNAI, Issue , 2013, Pages 1-12

Using state-based planning heuristics for partial-order causal-link planning

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS;

EID: 84885067860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40942-4_1     Document Type: Conference Paper
Times cited : (10)

References (22)
  • 2
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • Blum, A.L., Furst, M.L.: Fast planning 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
  • 4
    • 33745772398 scopus 로고    scopus 로고
    • Directed model checking with distancepreserving abstractions
    • Valmari, A. (ed.) Springer, Heidelberg
    • Dräger, K., Finkbeiner, B., Podelski, A.: Directed model checking with distancepreserving abstractions. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 19-34. Springer, Heidelberg (2006)
    • (2006) SPIN. 2006 LNCS , vol.3925 , pp. 19-34
    • Dräger, K.1    Finkbeiner, B.2    Podelski, A.3
  • 5
    • 2842560201 scopus 로고
    • STRIPS: A new approach to the application of theorem proving to problem solving
    • Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189-208 (1971)
    • (1971) Artificial Intelligence , vol.2 , pp. 189-208
    • Fikes, R.E.1    Nilsson, N.J.2
  • 12
    • 11544363000 scopus 로고    scopus 로고
    • Refinement planning as a unifying framework for plan synthesis
    • Kambhampati, S.: Refinement planning as a unifying framework for plan synthesis. AI Magazine 18(2), 67-98 (1997)
    • (1997) AI Magazine , vol.18 , Issue.2 , pp. 67-98
    • Kambhampati, S.1
  • 15
    • 0028396495 scopus 로고
    • On the computational complexity of temporal projection, planning, and plan validation
    • Nebel, B., Bäckström, C.: On the computational complexity of temporal projection, planning, and plan validation. Artificial Intelligence 66(1), 125-160 (1994)
    • (1994) Artificial Intelligence , vol.66 , Issue.1 , pp. 125-160
    • Nebel, B.1    Bäckström, C.2
  • 20
    • 31144445319 scopus 로고    scopus 로고
    • Branching and pruning: An optimal temporal POCL planner based on constraint programming
    • Vidal, V., Geffner, H.: Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artificial Intelligence 170(3), 298-335 (2006)
    • (2006) Artificial Intelligence , vol.170 , Issue.3 , pp. 298-335
    • Vidal, V.1    Geffner, H.2
  • 21
    • 79960128513 scopus 로고    scopus 로고
    • Systematic nonlinear planning: A commentary
    • Weld, D.S.: Systematic nonlinear planning: A commentary. AI Magazine 32(1), 101-103 (2011)
    • (2011) AI Magazine , vol.32 , Issue.1 , pp. 101-103
    • Weld, D.S.1


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