메뉴 건너뛰기




Volumn , Issue , 2001, Pages 453-458

Local search topology in planning benchmarks: An empirical analysis

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL ANALYSIS; HEURISTIC FUNCTIONS; LOCAL SEARCH; PLANNING TASKS; TOPOLOGICAL PROPERTIES;

EID: 84880900212     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (45)

References (10)
  • 1
    • 0012303824 scopus 로고    scopus 로고
    • The 2000 AI planning systems competition
    • Forthcoming
    • Fahiem Bacchus and Dana Nau. The 2000 AI planning systems competition. The AI Magazine, 2001. Forthcoming.
    • (2001) The AI Magazine
    • Bacchus, F.1    Nau, D.2
  • 3
    • 0031385389 scopus 로고    scopus 로고
    • A robust and fast action selection mechanism for planning
    • MIT Press, July
    • Blai Bonet, Gábor Loerincs, and Héctor Geffner. A robust and fast action selection mechanism for planning. In Proc. AAAI-97, pages 714-719. MIT Press, July 1997.
    • (1997) Proc. AAAI-97 , pp. 714-719
    • Bonet, B.1    Loerincs, G.2    Geffner, H.3
  • 4
    • 0028498153 scopus 로고
    • The computational complexity of propositional STRIPS planning
    • Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2 , pp. 165-204
    • Bylander, T.1
  • 7
    • 84898688040 scopus 로고    scopus 로고
    • Combining the expressiveness of UCPOP with the efficiency of Graphplan
    • Springer-Verlag, September
    • B. Cenk Gazen and Craig Knoblock. Combining the expressiveness of UCPOP with the efficiency of Graphplan. In Proc. ECP'97, pages 221-233. Springer-Verlag, September 1997.
    • (1997) Proc. ECP'97 , pp. 221-233
    • Gazen, B.C.1    Knoblock, C.2
  • 8
    • 0000262692 scopus 로고    scopus 로고
    • A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm
    • Springer-Verlag, October
    • Jörg Hoffmann. A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm. In Proc. ISMIS-00, pages 216-227. Springer-Verlag, October 2000.
    • (2000) Proc. ISMIS-00 , pp. 216-227
    • Hoffmann, J.1
  • 9
    • 14344270404 scopus 로고    scopus 로고
    • On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm
    • Jana Koehler and Jörg Hoffmann. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 12:338-386, 2000.
    • (2000) Journal of Artificial Intelligence Research , vol.12 , pp. 338-386
    • Koehler, J.1    Hoffmann, J.2
  • 10
    • 0033698818 scopus 로고    scopus 로고
    • The 1998 AI planning systems competition
    • Drew McDermott. The 1998 AI planning systems competition. The AI Magazine, 21(2):35-55, 2000.
    • (2000) The AI Magazine , vol.21 , Issue.2 , pp. 35-55
    • McDermott, D.1


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