SetA*: An efficient BDD-based heuristic search algorithm

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 668-673

  Jensen, Rune M ^a   Bryant, Randal E ^a   Veloso, Manuela M ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING;

BINARY DECISION DIAGRAMS (BDD);

ARTIFICIAL INTELLIGENCE;

EID: 0036932213     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bacchus, F. 2001. AIPS'00 planning competition: The fifth international conference on artificial intelligence planning and scheduling systems. AI Magazine 22(3):47-56.
2. Bloem, R.; Ravi, K.; and Somenzi, F. 2000. Symbolic guided search for CTL model checking. In Proceedings of the 37th Design Automation Conference (DAC'00), 29-34. ACM.
3. Bonet, B., and Geffner, H. 1999. Planning as heuristic search: New results. In Proceedings of the European Conference on Planning (ECP-99). Springer.
4. Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 8:677-691.
5. Cimatti, A.; Giunchiglia, E.; Giunchiglia, F.; and Traverso, P. 1997. Planning via model checking: A decision procedure for AR. In Proceedings of the 4th European Conference on Planning (ECP'97), 130-142. Springer.
6. Clarke, E.; Grumberg, O.; and Peled, D. 1999. Model Checking. MIT Press.
7. Edelkamp, S., and Helmert, M. 2001. MIPS the model-checking integrated planning system. AI Magazine 22(3):67-71.
8. Edelkamp, S., and Reffel, F. 1998. OBDDs in heuristic search. In Proceedings of the 22nd Annual German Conference on Advances in Artificial Intelligence (KI-98), 81-92. Springer.
9. 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.
10. 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).
11. Hoffmann, J. 2001. Local search topology in planning benchmarks: An empirical analysis. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), 453-458. Morgan Kaufmann.
12. 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.
13. Long, D. 2000. The ATPS-98 planning competition. AI Magazine 21(2): 13-34.
14. McMillan, K. L. 1993. Symbolic Model Checking. Kluwer Academic Publ.
15. Pearl, J. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
16. Pohl, I. 1970. First results on the effect of error in heuristic search. Machine Intelligence 5:127-140.
17. Yang, C. H., and Dill, D. L. 1998, Validation with guided search of the state space. In Proceedings of the 35th Design Automation Conference (DAC'98), 599-604. ACM.