메뉴 건너뛰기




Volumn , Issue , 2008, Pages 174-181

Optimal additive composition of abstraction-based admissible heuristics

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING;

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

References (13)
  • 1
    • 0029405902 scopus 로고
    • Complexity results for SAS+ planning
    • Bäckström, C., and Nebel, B. 1995. Complexity results for SAS+ planning. Comp. Intell. 11 (4):625-655.
    • (1995) Comp. Intell , vol.11 , Issue.4 , pp. 625-655
    • Bäckström, C.1    Nebel, B.2
  • 2
    • 0028498153 scopus 로고
    • The computational complexity of propositional STRIPS planning
    • Bylander, T. 1994. The computational complexity of propositional STRIPS planning. AIJ 69(1-2):165-204.
    • (1994) AIJ , vol.69 , Issue.1-2 , pp. 165-204
    • Bylander, T.1
  • 3
    • 0032141813 scopus 로고    scopus 로고
    • Pattern databases
    • Culberson, J., and Schaeffer, J. 1998. Pattern databases. Comp. Intell. 14(4):318-334.
    • (1998) Comp. Intell , vol.14 , Issue.4 , pp. 318-334
    • Culberson, J.1    Schaeffer, J.2
  • 5
    • 0002812045 scopus 로고    scopus 로고
    • Planning with pattern databases
    • Edelkamp, S. 2001. Planning with pattern databases. In ECP, 13-34.
    • (2001) ECP , pp. 13-34
    • Edelkamp, S.1
  • 6
    • 26944481300 scopus 로고    scopus 로고
    • Additive pattern database heuristics
    • Felner, A.; Korf, R. E.; and Hanan, S. 2004. Additive pattern database heuristics. JAIR 22:279-318.
    • (2004) JAIR , vol.22 , pp. 279-318
    • Felner, A.1    Korf, R.E.2    Hanan, S.3
  • 7
    • 36348994284 scopus 로고    scopus 로고
    • Domain-independent construction of pattern database heuristics for cost-optimal planning
    • Haslum, P.; Botea, A.; Helmert, M.; Bonet, B.; and Koenig, S. 2007. Domain-independent construction of pattern database heuristics for cost-optimal planning. In AAAI, 1007-1012.
    • (2007) AAAI , pp. 1007-1012
    • Haslum, P.1    Botea, A.2    Helmert, M.3    Bonet, B.4    Koenig, S.5
  • 8
    • 29344444840 scopus 로고    scopus 로고
    • New admissible heuristics for domain-independent planning
    • Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In AAAI, 1163-1168.
    • (2005) AAAI , pp. 1163-1168
    • Haslum, P.1    Bonet, B.2    Geffner, H.3
  • 9
    • 52649133190 scopus 로고    scopus 로고
    • Flexible abstraction heuristics for optimal sequential planning
    • Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In ICAPS, 176-183.
    • (2007) ICAPS , pp. 176-183
    • Helmert, M.1    Haslum, P.2    Hoffmann, J.3
  • 10
    • 52249096179 scopus 로고    scopus 로고
    • Katz, M., and Domshlak, C. 2008a. New islands of tractability of cost-optimal planning. JAIR 32.
    • Katz, M., and Domshlak, C. 2008a. New islands of tractability of cost-optimal planning. JAIR 32.
  • 11
    • 58849100929 scopus 로고    scopus 로고
    • Katz, M., and Domshlak, C. 2008b. Structural patterns heuristics via fork decomposition. In ICAPS this Pearl, J. 1984. Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
    • Katz, M., and Domshlak, C. 2008b. Structural patterns heuristics via fork decomposition. In ICAPS (this volume). Pearl, J. 1984. Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
  • 13
    • 58849149321 scopus 로고    scopus 로고
    • Yang, F.; Culberson, J.; and Holte, R. 2007. A general additive search abstraction. Technical Report TR07-06, CS Depart., Univ. of Alberta. (Extended abstract in SARA-07).
    • Yang, F.; Culberson, J.; and Holte, R. 2007. A general additive search abstraction. Technical Report TR07-06, CS Depart., Univ. of Alberta. (Extended abstract in SARA-07).


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