메뉴 건너뛰기




Volumn , Issue , 2008, Pages 140-147

Unifying the causal graph and additive heuristics

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; SCHEDULING;

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

References (14)
  • 3
    • 0035369022 scopus 로고    scopus 로고
    • Planning as heuristic search
    • Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1):5-33.
    • (2001) AIJ , vol.129 , Issue.1 , pp. 5-33
    • Bonet, B.1    Geffner, H.2
  • 4
    • 0031385389 scopus 로고    scopus 로고
    • A robust and fast action selection mechanism for planning
    • Bonet, B.; Loerincs, G.; and Geffner, H. 1997. A robust and fast action selection mechanism for planning. In Proc. AAAI-97, 714-719.
    • (1997) Proc. AAAI-97 , pp. 714-719
    • Bonet, B.1    Loerincs, G.2    Geffner, H.3
  • 6
    • 0028585769 scopus 로고
    • HTN planning: Complexity and expressivity
    • Erol, K.; Hendler, J. A.; and Nau, D. S. 1994. HTN planning: Complexity and expressivity. In Proc. AAAI-94, 1123-1128.
    • (1994) Proc. AAAI-94 , pp. 1123-1128
    • Erol, K.1    Hendler, J.A.2    Nau, D.S.3
  • 7
    • 85166200109 scopus 로고    scopus 로고
    • Admissible heuristics for optimal planning
    • Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. AIPS 2000, 140-149.
    • (2000) Proc. AIPS 2000 , pp. 140-149
    • Haslum, P.1    Geffner, H.2
  • 8
    • 13444260042 scopus 로고    scopus 로고
    • A planning heuristic based on causal graph analysis
    • Helmert, M. 2004. A planning heuristic based on causal graph analysis. In Proc. ICAPS 2004, 161-170.
    • (2004) Proc. ICAPS 2004 , pp. 161-170
    • Helmert, M.1
  • 9
    • 33749001469 scopus 로고    scopus 로고
    • The Fast Downward planning system
    • Helmert, M. 2006. The Fast Downward planning system. JAIR 26:191-246.
    • (2006) JAIR , vol.26 , pp. 191-246
    • Helmert, M.1
  • 10
    • 49949089514 scopus 로고    scopus 로고
    • Understanding Planning Tasks - Domain Complexity and Heuristic Decomposition
    • of, Springer-Verlag
    • Helmert, M. 2008. Understanding Planning Tasks - Domain Complexity and Heuristic Decomposition, volume 4929 of LNAI. Springer-Verlag.
    • (2008) LNAI , vol.4929
    • Helmert, M.1
  • 11
    • 0036377352 scopus 로고    scopus 로고
    • The FF planning system: Fast plan generation through heuristic search
    • Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
    • (2001) JAIR , vol.14 , pp. 253-302
    • Hoffmann, J.1    Nebel, B.2
  • 12
    • 58849148456 scopus 로고    scopus 로고
    • Heuristics for planning with action costs revisited
    • Keyder, E., and Geffner, H. 2008. Heuristics for planning with action costs revisited. In Proc. ECAI 2008.
    • (2008) Proc. ECAI , pp. 2008
    • Keyder, E.1    Geffner, H.2
  • 13
    • 0036932097 scopus 로고    scopus 로고
    • Speeding up the calculation of heuristics for heuristic search-based planning
    • Liu, Y.; Koenig, S.; and Furcy, D. 2002. Speeding up the calculation of heuristics for heuristic search-based planning. In Proc. AAAI 2002, 484-491.
    • (2002) Proc. AAAI 2002 , pp. 484-491
    • Liu, Y.1    Koenig, S.2    Furcy, D.3


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