메뉴 건너뛰기




Volumn , Issue , 2007, Pages 251-260

Using data mining to enhance automated planning and scheduling

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; MANNED SPACE FLIGHT; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

EID: 34548808239     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIDM.2007.368881     Document Type: Conference Paper
Times cited : (8)

References (22)
  • 1
    • 2842560201 scopus 로고
    • STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
    • Fi71
    • [Fi71] Fikes and Nilsson. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving, Artificial Intelligence, Vol. 2, 1971, pp 189-208.
    • (1971) Artificial Intelligence , vol.2 , pp. 189-208
    • Fikes1    Nilsson2
  • 2
    • 27444434099 scopus 로고    scopus 로고
    • PDDL2.1: An extension of PDDL for expressing temporal planning domains
    • Fo03
    • [Fo03] Fox, M. and Long, D. "PDDL2.1: An extension of PDDL for expressing temporal planning domains." Journal of Artificial Intelligence Research. 20, 2003: p. 61-124.
    • (2003) Journal of Artificial Intelligence Research , vol.20 , pp. 61-124
    • Fox, M.1    Long, D.2
  • 3
    • 34548706957 scopus 로고    scopus 로고
    • th UK Special Interest Group on Planning, 2004.
    • th UK Special Interest Group on Planning, 2004.
  • 6
    • 14344283976 scopus 로고    scopus 로고
    • Graph as (dynamic) CSP: Exploiting EBL, DDB and other CSP Techniques in Graphplan
    • [Ka00] Kambhampati, S. Planning Graph as (dynamic) CSP: Exploiting EBL, DDB and other CSP Techniques in Graphplan. Journal of Artificial Intelligence Research 12, 2000 p. 1-34.
    • (2000) Journal of Artificial Intelligence Research , vol.12 , pp. 1-34
    • Kambhampati K.001    Planning, S.2
  • 8
    • 0036377352 scopus 로고    scopus 로고
    • The FF planning system: Fast plan generation through heuristic search
    • Ho01
    • [Ho01] Hoffmann, J. and Nebel, B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001.
    • (2001) Journal of Artificial Intelligence Research , vol.14 , pp. 253-302
    • Hoffmann, J.1    Nebel, B.2
  • 10
    • 0030416991 scopus 로고    scopus 로고
    • Failure Driven Dynamic Search Control for Partial Order Planners: An explanation-based approach
    • Ka97
    • [Ka97] Kambhampati, S., Katukam, S. and Qu, Y Failure Driven Dynamic Search Control for Partial Order Planners: An explanation-based approach. Artificial Intelligence. 88(1-2) p. 253-313, 1997
    • (1997) Artificial Intelligence , vol.88 , Issue.1-2 , pp. 253-313
    • Kambhampati, S.1    Katukam, S.2    Qu, Y.3
  • 18
    • 34548745075 scopus 로고    scopus 로고
    • [Ye99] Yen, J., Jain, A., and Balaram., J. ROAMS: Rover Analysis, Modeling and Simulation. In proceedings of Artificial Intelligence, Robotics, and Automation in Space, 1999.
    • [Ye99] Yen, J., Jain, A., and Balaram., J. ROAMS: Rover Analysis, Modeling and Simulation. In proceedings of Artificial Intelligence, Robotics, and Automation in Space, 1999.
  • 22
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • BlFu97
    • [BlFu97] A. L. Blum and M. L. Furst. Fast planning through planning graph analysis. Artificial Intelligence Journal, 90(1-2), 1997, p. 225-279.
    • (1997) Artificial Intelligence Journal , vol.90 , Issue.1-2 , pp. 225-279
    • Blum, A.L.1    Furst, M.L.2


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