메뉴 건너뛰기




Volumn 31, Issue , 2008, Pages 319-351

The complexity of planning problems with simple causal graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; STATE SPACE METHODS;

EID: 44449099222     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2432     Document Type: Article
Times cited : (47)

References (22)
  • 6
    • 0028498153 scopus 로고
    • The computational complexity of propositional STRIPS planning
    • Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69, 165-204.
    • (1994) Artificial Intelligence , vol.69 , pp. 165-204
    • Bylander, T.1
  • 7
    • 0023381915 scopus 로고
    • Planning for conjunctive goals
    • Chapman, D. (1987). Planning for conjunctive goals. Artificial Intelligence, 32(3), 333-377.
    • (1987) Artificial Intelligence , vol.32 , Issue.3 , pp. 333-377
    • Chapman, D.1
  • 10
    • 0029332411 scopus 로고
    • Complexity, decidability and undecidability results for domain-independent planning
    • Erol, K., Nau, D., & Subrahmanian, V. (1995). Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76(1-2), 75-88.
    • (1995) Artificial Intelligence , vol.76 , Issue.1-2 , pp. 75-88
    • Erol, K.1    Nau, D.2    Subrahmanian, V.3
  • 11
    • 2842560201 scopus 로고
    • STRIPS: A new approach to the application of theorem proving to problem solving
    • Fikes, R., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 5(2), 189-208.
    • (1971) Artificial Intelligence , vol.5 , Issue.2 , pp. 189-208
    • Fikes, R.1    Nilsson, N.2
  • 13
    • 0037301799 scopus 로고    scopus 로고
    • Complexity results for standard benchmark domains in planning
    • Helmert, M. (2003). Complexity results for standard benchmark domains in planning. Artificial Intelligence, 143(2), 219-262.
    • (2003) Artificial Intelligence , vol.143 , Issue.2 , pp. 219-262
    • Helmert, M.1
  • 18
    • 0028484996 scopus 로고
    • Automatically generating abstractions for planning
    • Knoblock, C. (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68(2), 243-302.
    • (1994) Artificial Intelligence , vol.68 , Issue.2 , pp. 243-302
    • Knoblock, C.1
  • 19
    • 0023421864 scopus 로고
    • Planning as search: A quantitative approach
    • Korf, R. (1987). Planning as search: A quantitative approach. Artificial Intelligence, 33(1), 65-88.
    • (1987) Artificial Intelligence , vol.33 , Issue.1 , pp. 65-88
    • Korf, R.1


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