메뉴 건너뛰기




Volumn , Issue , 2002, Pages 668-673

SetA*: An efficient BDD-based heuristic search algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING;

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

References (17)
  • 1
    • 0035442648 scopus 로고    scopus 로고
    • AIPS'00 planning competition: The fifth international conference on artificial intelligence planning and scheduling systems
    • Bacchus, F. 2001. AIPS'00 planning competition: The fifth international conference on artificial intelligence planning and scheduling systems. AI Magazine 22(3):47-56.
    • (2001) AI Magazine , vol.22 , Issue.3 , pp. 47-56
    • Bacchus, F.1
  • 4
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 8:677-691.
    • (1986) IEEE Transactions on Computers , vol.8 , pp. 677-691
    • Bryant, R.E.1
  • 7
    • 0035443448 scopus 로고    scopus 로고
    • MIPS the model-checking integrated planning system
    • Edelkamp, S., and Helmert, M. 2001. MIPS the model-checking integrated planning system. AI Magazine 22(3):67-71.
    • (2001) AI Magazine , vol.22 , Issue.3 , pp. 67-71
    • Edelkamp, S.1    Helmert, M.2
  • 9
    • 2842560201 scopus 로고
    • STRIPS: A new approach to the application of theorem proving to problem solving
    • Fikes, R. E., and Nilsson, N. J. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2:189-208.
    • (1971) Artificial Intelligence , vol.2 , pp. 189-208
    • Fikes, R.E.1    Nilsson, N.J.2
  • 10
    • 84899829959 scopus 로고
    • A formal basis for heuristic determination of minimum path cost
    • Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for heuristic determination of minimum path cost. IEEE Transactions on SSC 100(4).
    • (1968) IEEE Transactions on SSC , vol.100 , Issue.4
    • Hart, P.E.1    Nilsson, N.J.2    Raphael, B.3
  • 12
    • 0000235433 scopus 로고    scopus 로고
    • OBDD-based universal planning for synchronized agents in non-deterministic domains
    • Jensen, R., and Veloso, M. M. 2000. OBDD-based universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research 13:189-226.
    • (2000) Journal of Artificial Intelligence Research , vol.13 , pp. 189-226
    • Jensen, R.1    Veloso, M.M.2
  • 13
    • 0033703504 scopus 로고    scopus 로고
    • The ATPS-98 planning competition
    • Long, D. 2000. The ATPS-98 planning competition. AI Magazine 21(2): 13-34.
    • (2000) AI Magazine , vol.21 , Issue.2 , pp. 13-34
    • Long, D.1
  • 16
    • 0001385536 scopus 로고
    • First results on the effect of error in heuristic search
    • Pohl, I. 1970. First results on the effect of error in heuristic search. Machine Intelligence 5:127-140.
    • (1970) Machine Intelligence , vol.5 , pp. 127-140
    • Pohl, I.1


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