메뉴 건너뛰기
ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling
Volumn , Issue , 2009, Pages 138-145
The influence of k-dependence on the complexity of planning
Author keywords

[No Author keywords available]
Indexed keywords

BINARY VARIABLES; CAUSAL GRAPH; COMPLEXITY RESULTS; PLAN GENERATION; PLAN GENERATION ALGORITHM; PLANNING DOMAINS; PLANNING PROBLEM;
EID: 78650625254     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)
References (15)
  • 2
    • 33750742736 scopus 로고    scopus 로고
    • Factored Planning: How, When, and When Not
    • Brafman, R., and Domshlak, C. 2006. Factored Planning: How, When, and When Not. In AAAI, 809-814.
    • (2006) AAAI , pp. 809-814
    • Brafman, R.1    Domshlak, C.2
  • 3
    • 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
  • 4
    • 0023381915 scopus 로고
    • PLANNING for CONJUNCTIVE GOALS
    • DOI 10.1016/0004-3702(87)90092-0
    • Chapman, D. 1987, Planning for conjunctive goals. Artificial Intelligence 32(3):333-377. (Pubitemid 17605251)
    • (1987) Artificial Intelligence , vol.32 , Issue.3 , pp. 333-377
    • Chapman, D.1
  • 5
    • 58849120080 scopus 로고    scopus 로고
    • Causal Graphs and Structurally Restricted Planning
    • Chen, H., and Giménez, O. 2008. Causal Graphs and Structurally Restricted Planning. In ICAPS, 36-43.
    • (2008) ICAPS , pp. 36-43
    • Chen, H.1    Giménez, O.2
  • 6
    • 0002812045 scopus 로고    scopus 로고
    • Planning with pattern databases
    • Edelkamp, S. 2001. Planning with pattern databases. In ECP, 13-24.
    • (2001) ECP , pp. 13-24
    • Edelkamp, S.1
  • 8
    • 78650615310 scopus 로고    scopus 로고
    • Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard
    • Giménez, O., and Jonsson, A. 2009. Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard. Journal of Artificial Intelligence Research 34:675-706.
    • (2009) Journal of Artificial Intelligence Research , vol.34 , pp. 675-706
    • Giménez, O.1    Jonsson, A.2
  • 9
    • 36348994284 scopus 로고    scopus 로고
    • Domain-independent construction of pattern database heuristics for cost-optimal planning
    • Haslum, P.; Botea, A.; Helmert, M.; Bonet, B.; and Koenig, S. 2007. Domain-independent construction of pattern database heuristics for cost-optimal planning. In AAAI, 1007-1012.
    • (2007) AAAI , pp. 1007-1012
    • Haslum, P.1    Botea, A.2    Helmert, M.3    Bonet, B.4    Koenig, S.5
  • 10
    • 52649133190 scopus 로고    scopus 로고
    • Flexible abstraction heuristics for optimal sequential planning
    • Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In ICAPS, 176-183.
    • (2007) ICAPS , pp. 176-183
    • Helmert, M.1    Haslum, P.2    Hoffmann, J.3
  • 13
    • 58849100929 scopus 로고    scopus 로고
    • Structural Patterns Heuristics via Fork Decompositions
    • Katz, M., and Domshlak, C. 2008b. Structural Patterns Heuristics via Fork Decompositions. In ICAPS, 182-189.
    • (2008) ICAPS , pp. 182-189
    • Katz, M.1    Domshlak, C.2
  • 14
    • 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
  • 15
    • 84880659749 scopus 로고    scopus 로고
    • A reactive planner for a model-based executive
    • Williams, B., and Nayak, P. 1997. A reactive planner for a model-based executive. In IJCAI, 1178-1185.
    • (1997) IJCAI , pp. 1178-1185
    • Williams, B.1    Nayak, P.2

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