메뉴 건너뛰기




Volumn , Issue , 2007, Pages 280-287

Complexity of concurrent temporal planning

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; CONDITION; EXISTENCE PROBLEMS; PLANNING PROBLEM; PSPACE-COMPLETE; TEMPORAL PLANNING;

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

References (11)
  • 1
    • 0028498153 scopus 로고
    • The computational complexity of propositional STRIPS planning
    • Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69(1-2):165-204.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2 , pp. 165-204
    • Bylander, T.1
  • 3
    • 27444434099 scopus 로고    scopus 로고
    • PDDL2.1: An extension to PDDL for expressing temporal planning domains
    • Fox, M., and Long, D. 2003. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20:61-124.
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 61-124
    • Fox, M.1    Long, D.2
  • 4
    • 85163445603 scopus 로고    scopus 로고
    • Heuristic planning with time and resources
    • Cesta, A, ed, Recent Advances in AI Planning. Sixth European Conference on Planning ECP'01, Springer-Verlag. to appear
    • Haslum, P., and Geffner, H. Heuristic planning with time and resources. In Cesta, A., ed., Recent Advances in AI Planning. Sixth European Conference on Planning (ECP'01), Lecture Notes in Artificial Intelligence. Springer-Verlag. to appear.
    • Lecture Notes in Artificial Intelligence
    • Haslum, P.1    Geffner, H.2
  • 7
    • 33748722573 scopus 로고
    • Technical Report CMU-RI-TR-93-05, Robotics Institute, Carnegie Mellon University
    • Muscettola, N. 1993. HSTS: Integrating planning and scheduling. Technical Report CMU-RI-TR-93-05, Robotics Institute, Carnegie Mellon University.
    • (1993) HSTS: Integrating planning and scheduling
    • Muscettola, N.1


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