메뉴 건너뛰기




Volumn , Issue , 2000, Pages 102-111

Utilizing Automatically Inferred Invariants in Graph Construction and Search

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTION PERFORMANCE; GRAPH CONSTRUCTION; GRAPH SEARCH; GRAPHPLAN; MUTEXES; PERFORMANCE; PLANNING DOMAINS; PRE-PROCESSING; SIMPLE++;

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

References (10)
  • 1
    • 0001657540 scopus 로고
    • Fast. Planning through Plan-graph Analysis
    • Fürst. M
    • Blum. A., and Fürst. M. 1995. Fast. Planning through Plan-graph Analysis. In IJCAI.
    • (1995) IJCAI
    • Blum., A.1
  • 2
    • 11544324354 scopus 로고    scopus 로고
    • Thn automatic inference of state invariants in TITM
    • Fox, M., and Long, D. 1998. Thn automatic inference of state invariants in TITM. JAIR. 9.
    • (1998) JAIR , vol.9
    • Fox, M.1    Long, D.2
  • 3
    • 0009457242 scopus 로고    scopus 로고
    • Accelerating Partial Order Planners: Some Techniques for Effective Search Control and Pruning
    • Gorevini, A., and Schubert, L. 1996a. Accelerating Partial Order Planners: Some Techniques for Effective Search Control and Pruning. JAIR 5:95-137.
    • (1996) JAIR , vol.5 , pp. 95-137
    • Gorevini, A.1    Schubert, L.2
  • 4
    • 8644221178 scopus 로고    scopus 로고
    • Computing Parameter Domains as an Aid to Planning
    • Gerevini. A., and Schubert, L. 1996b. Computing Parameter Domains as an Aid to Planning. In AIPS-96.
    • (1996) AIPS-96
    • Gerevini., A.1    Schubert, L.2
  • 5
    • 0031636093 scopus 로고    scopus 로고
    • Inferring state constraints for domain-independent planning
    • L Madison. WI
    • Gerevini, A., and Schubert. L. 1998. Inferring state constraints for domain-independent planning. In Proceedings of AAAT-98, Madison. WI.
    • (1998) Proceedings of AAAT-98
    • Gerevini, A.1    Schubert2
  • 6
    • 85166178121 scopus 로고    scopus 로고
    • Improving Graphplan's search with E B L and DDB techniques
    • JCAI-99
    • Kambhampati, S. 1999. Improving Graphplan's search with E B L and DDB techniques. In Proceedings of I.JCAI-99.
    • (1999) Proceedings of I
    • Kambhampati, S.1
  • 7
    • 11544346615 scopus 로고
    • Automatically Syn¬ thesising Domain Constraints from Operator Descriptions
    • Kelleher, G.. and Cohn, A. 1992. Automatically Syn¬ thesising Domain Constraints from Operator Descriptions. In Proceedings ECAI92.
    • (1992) Proceedings ECAI92
    • Kelleher, G.1    Cohn, A.2
  • 8
    • 0033347766 scopus 로고    scopus 로고
    • The efficient implementation of the plan-graph in STAN
    • Long, D., and Fox, M. 1999. The efficient implementation of the plan-graph in STAN. JAIR 10.
    • (1999) JAIR , vol.10
    • Long, D.1    Fox, M.2
  • 10
    • 0001491788 scopus 로고    scopus 로고
    • Temporal Graphplan with mutual exclusion reasoning
    • Smith, D., and Weld, D. 1999. Temporal Graphplan with mutual exclusion reasoning. In Proceedings of IJCAI-99.
    • (1999) Proceedings of IJCAI-99
    • Smith, D.1    Weld, D.2


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