메뉴 건너뛰기




Volumn 2148, Issue , 2001, Pages 55-78

Beyond the plan-length criterion

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY; SCHEDULING;

EID: 23044528574     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45612-0_4     Document Type: Conference Paper
Times cited : (9)

References (31)
  • 1
    • 0031363799 scopus 로고    scopus 로고
    • Planning by rewriting: Efficientlygenerating high-qualityplans
    • Ambite & Knoblock 1997] Ambite, J. L., and Knoblock, C. A. 1997. Planning by Rewriting: EfficientlyGenerating High-QualityPlans. AAAI-97, 706-713.
    • (1997) AAAI-97 , pp. 706-713
    • Ambite, J.L.1    Knoblock, C.A.2
  • 2
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • Blum & Furst 1997] Blum, A. L., and Furst, M. L. 1997. Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90: 281-300.
    • (1997) Artificial Intelligence , vol.90 , pp. 281-300
    • Blum, A.L.1    Furst, M.L.2
  • 4
    • 0346942368 scopus 로고    scopus 로고
    • Decision-theoretic planning: Structural assumptions and computational leverage
    • Boutilier, Dean & Hanks 1999] Boutilier, C.; Dean, T.; and Hanks, S. 19 99. Decision-Theoretic Planning: Structural Assumptions and Computational Leverage. Journal of Artificial Intelligence Research 11: 1-94.
    • (1999) Journal of Artificial Intelligence Research , vol.11 , pp. 1-94
    • Boutilier, C.1    Dean, T.2    Hanks, S.3
  • 5
    • 0010312449 scopus 로고    scopus 로고
    • To encode or not to encode-i: Linear planning
    • Brafman & Hoos 1999] Brafman, R. I., and Hoos, H. H. 1999. To Encode or not to Encode-I: Linear Planning. IJCAI-99, 988-993.
    • (1999) IJCAI-99 , pp. 988-993
    • Brafman, R.I.1    Hoos, H.H.2
  • 7
    • 27444447092 scopus 로고
    • The use of optimistic and pessimistic resource profiles to inform search in an activitybased planner
    • Drabble & Tate 1994] Drabble, B. and Tate, A. 1994. The Use of Optimistic and Pessimistic Resource Profiles to Inform Search in an ActivityBased Planner. AIPS-94, 243-248.
    • (1994) AIPS , vol.94 , pp. 243-248
    • Drabble, B.1    Tate, A.2
  • 8
    • 0008581455 scopus 로고    scopus 로고
    • Temporal and resource reasoning in planning: The parcplan approach
    • El-Kholy& Richards 1996] El-Kholy, A., and Richards, B. 1996. Temporal and Resource Reasoning in Planning: the parcPLAN approach. ECAI-96, 614-618.
    • (1996) ECAI , vol.96 , pp. 614-618
    • El-Kholy, A.1    Richards, B.2
  • 11
    • 44049114350 scopus 로고
    • Partial constraint satisfaction
    • Freuder & Wallace 1992] Freuder, E. C., and Wallace, R. J. 1992. Partial Constraint Satisfaction. Artificial Intelligence 58: 21-70.
    • (1992) Artificial Intelligence , vol.58 , pp. 21-70
    • Freuder, E.C.1    Wallace, R.J.2
  • 12
    • 0032596471 scopus 로고    scopus 로고
    • Fast planning through greedyaction graphs
    • Gerevini & Serina 1999] Gerevini, A., and Serina, I. 1999. Fast Planning through GreedyAction Graphs. AAAI-99, 503-510.
    • (1999) AAAI , vol.99 , pp. 503-510
    • Gerevini, A.1    Serina, I.2
  • 14
    • 0030352389 scopus 로고    scopus 로고
    • Pushing the envelope: Planning, propositional logic, and stochastic search
    • Kautz, H., and Selman, B. 1996. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. AAAI-96, 1194-1201.
    • (1996) AAAI , vol.96 , pp. 1194-1201
    • Kautz, H.1    Selman, B.2
  • 15
    • 0032596474 scopus 로고    scopus 로고
    • State-space planning by integer optimization
    • Kautz & Walser 1999] Kautz, H., and Walser, J. P. 1999. State-space Planning by Integer Optimization. AAAI-99, 526-533.
    • (1999) AAAI , vol.99 , pp. 526-533
    • Kautz, H.1    Walser, J.P.2
  • 16
    • 0001034942 scopus 로고    scopus 로고
    • Planning under resource constraints
    • Koehler 1998] Koehler, J. 1998. Planning under Resource Constraints. ECAI-98, 489-493.
    • (1998) ECAI , vol.98 , pp. 489-493
    • Koehler, J.1
  • 17
    • 84880678797 scopus 로고
    • Planning with sharable resource constraints
    • Laborie & Ghallab 199 5] Laborie, P., and Ghallab, M. 1995. Planning with Sharable Resource Constraints. IJCAI-95, 1643-1649.
    • (1995) IJCAI , vol.95 , pp. 1643-1649
    • Laborie, P.1    Ghallab, M.2
  • 18
    • 0028442512 scopus 로고
    • Implementation of resource constraints in ilog schedule: A li braryfor the development of constraint-based scheduling systems
    • Le Pape 1994] Le Pape, C. 1994. Implementation of Resource Constraints in ILOG Schedule: A Li braryfor the Development of Constraint-Based Scheduling Systems. Intelligent Systems Engineering 3(2): 55-66.
    • (1994) Intelligent Systems Engineering , vol.3 , Issue.2 , pp. 55-66
    • Le Pape, C.1
  • 20
    • 0039310873 scopus 로고
    • Hsts: Integrating planning and scheduling
    • In Zweben, M., and Fox M. S. (eds.
    • Muscettola 1994] Muscettola, N. 1994. HSTS: Integrating Planning and Scheduling. In Zweben, M., and Fox, M. S. (eds.), Intelligent Scheduling, Morgan Kaufmann, 169-212.
    • (1994) Intelligent Scheduling, Morgan Kaufmann , pp. 169-212
    • Muscettola, N.1
  • 21
    • 16244389072 scopus 로고    scopus 로고
    • Structural constraint satisfaction
    • (available via the Excalibur project's webpage
    • Nareyek, A. 1999. Structural Constraint Satisfaction In Papers from the AAAI-99 Workshop on Configuration 76-82. (available via the Excalibur project's webpage)
    • (1999) Papers from the AAAI-99 Workshop on Configuration , pp. 76-82
    • Nareyek, A.1
  • 23
    • 84894867096 scopus 로고    scopus 로고
    • Open world planning as scsp
    • Technical Report, WS-00-02. AAAI Press, Menlo Park, California. (available via the Exca libur project's webpage
    • Nareyek 2000] Nareyek, A. 2000. Open World Planning as SCSP. In Papers from the AAAI-2000Workshop on Constraints and AI Planning, Technical Report, WS-00-02, 35-46. AAAI Press, Menlo Park, California. (available via the Exca libur project's webpage)
    • (2000) Papers from the AAAI-2000Workshop on Constraints and AI Planning , pp. 35-46
    • Nareyek, A.1
  • 26
    • 29344440271 scopus 로고    scopus 로고
    • Numeric state variables in constraint-based planning
    • Rintanen & Jungholt 1999] Rintanen, J., and Jungholt, H. 1999. Numeric State Variables in Constraint-based Planning. ECP-99.
    • (1999) ECP , vol.99
    • Rintanen, J.1    Jungholt, H.2
  • 27
    • 84937493879 scopus 로고    scopus 로고
    • The handbook of graph grammars. Volume i: Foundations
    • Rozenberg 1997] Rozenberg, G. ed. 1997. The Handbook of Graph Grammars. Volume I: Foundations. Reading, World Scientific.
    • (1997) Reading, World Scientific
    • Rozenberg, G.1
  • 28
    • 0003958887 scopus 로고    scopus 로고
    • Scaling up planning byteasing out resource scheduling
    • Srivastava & Kambhampati 1999] Srivastava, B., and Kambhampati, S. 1999. Scaling up Planning byteasing out Resource Scheduling. ECP-99.
    • (1999) ECP , vol.99
    • Srivastava, B.1    Kambhampati, S.2
  • 29
    • 0032596455 scopus 로고    scopus 로고
    • Cplan: A constraint programming approach to planning
    • Van Beek & Chen 1999] Van Beek, P., and Chen, X. 1999. CPlan: A Constraint Programming Approach to Planning. AAAI-99, 585-590.
    • (1999) AAAI , vol.99 , pp. 585-590
    • Van Beek, P.1    Chen, X.2


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