메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 1163-1168

New admissible heuristics for domain-independent planning

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING;

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

References (11)
  • 1
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through graph analysis
    • Blum, A., and Furst, M. 1997. Fast planning through graph analysis. Artificial Intelligence 90(1-2):281-300.
    • (1997) Artificial Intelligence , vol.90 , Issue.1-2 , pp. 281-300
    • Blum, A.1    Furst, M.2
  • 7
    • 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. Journal of AI Research 14:253-302.
    • (2001) Journal of AI Research , vol.14 , pp. 253-302
    • Hoffmann, J.1    Nebel, B.2
  • 9
    • 0036147811 scopus 로고    scopus 로고
    • Disjoint pattern database heuristics
    • Korf, R., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134(1-2):9-22.
    • (2002) Artificial Intelligence , vol.134 , Issue.1-2 , pp. 9-22
    • Korf, R.1    Felner, A.2


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