메뉴 건너뛰기




Volumn 10, Issue , 1999, Pages 87-115

Efficient implementation of the plan graph in Stan

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; VECTORS;

EID: 0033347766     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.570     Document Type: Article
Times cited : (91)

References (6)
  • 1
    • 0031074857 scopus 로고    scopus 로고
    • Fast Planning through Planning Graph Analysis
    • Blum, A., & 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
  • 2
    • 11544324354 scopus 로고    scopus 로고
    • The Automatic Inference of State Invariants in TIM
    • Fox, M., & Long, D. (1998). The Automatic Inference of State Invariants in TIM. JAIR, 9, 317-371.
    • (1998) JAIR , vol.9 , pp. 317-371
    • Fox, M.1    Long, D.2
  • 3
  • 4
    • 0032179503 scopus 로고    scopus 로고
    • On the Relations between Intelligent Backtracking and Explanation Based Learning in Planning and CSP
    • Kambhampati, S. (1999). On the Relations Between Intelligent Backtracking and Explanation Based Learning in Planning and CSP. Artificial Intelligence, 105(1-2).
    • (1999) Artificial Intelligence , vol.105 , Issue.1-2
    • Kambhampati, S.1
  • 6
    • 0343269522 scopus 로고    scopus 로고
    • Incremental Graphplan
    • University of Washington
    • Smith, D., & Weld, D. (1998). Incremental Graphplan. Tech. rep. TR 98-09-06, University of Washington.
    • (1998) Tech. Rep. TR 98-09-06
    • Smith, D.1    Weld, D.2


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