Symbolic heuristic search using decision diagrams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2371, Issue , 2002, Pages 83-98

  Hansen, Eric ^a   Zhou, Rong ^a   Feng, Zhengzhu ^b  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGEBRA; GRAPHIC METHODS; HEURISTIC ALGORITHMS; MODEL CHECKING;

COMPACT REPRESENTATION; DECISION DIAGRAM; DECISION-THEORETIC PLANNING; HEURISTIC SEARCH; HEURISTIC SEARCH ALGORITHMS; STATE ABSTRACTION; STATE EVALUATION; SYMBOLIC MODEL CHECKING;

BINARY DECISION DIAGRAMS;

EID: 84956856578     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45622-8_7     Document Type: Conference Paper

References (20)

1. Cimatti, A., Roveri, M., Traverso, P.: Automatic OBDD-based generation of universal plans in non-deterministic domains. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence. (1998) 875–881
2. Cimatti, M., Roveri, M.: Conformant planning via symbolic model checking. Journal of Artificial Intelligence Research 13 (2000) 305–338
3. Edelkamp, S., Reffel, F.: OBDDs in heuristic search. In: German Conference on Artificial Intelligence (KI). (1998) 81–92
4. Edelkamp, S., Reffel, F.: Deterministic state space planning with BDDs. In: Proceedings of the 5th European Conference on Planning (ECP-99). (1999) 381–2
5. Jensen, R., Veloso, M.: OBDD-based universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research 13 (2000) 189–226
6. Jensen, R.: OBDD-based deterministic planning using the UMOP planning framework. In: Proceedings of the AIPS-00 Workshop on Model-Theoretic Approaches to Planning. (2000) 26–31
7. Hoey, J., St-Aubin, R., Hu, A., Boutilier, C.: SPUDD: Stochastic planning using decision diagrams. In: Proceedings of the Fifteenth Conference on Uncertainty in Articial Intelligence. (1999) 279–288
8. St-Aubin, R., Hoey, J., Boutilier, C.: APRICODD: Approximate policy construction using decision diagrams. In: Proceedings of NIPS-2000. (2000)
9. Bertsekas, D.: Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA (1995)
10. Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Science and Cybernetics (SSC-4) 100–107
11. Hansen, E., Zilberstein, S.: LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129 (2001) 35–62
12. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35 (1986) 677–691
13. K.L. McMillan: Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts (1993)
14. R. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, F. Somenzi: Algebraic Decision Diagrams and Their Applications. In: IEEE /ACM International Conference on CAD, IEEE Computer Society Press (1993) 188–191
15. Somenzi, F.: Binary decision diagrams. In Broy, M., Steinbruggen, R., eds.: Calculational System Design. Volume 173 of NATO Science Series F: Computer and Systems Sciences. IOS Press (1999) 303–366
16. Edelkamp, S.: Directed symbolic exploration in AI-planning. In: AAAI Spring Symposium on Model-based Validation of Intelligence, Stanford University (2001) 84–92
17. Somenzi, F.: CUDD: CU decision diagram package. ftp://vlsi.colorado.edu/pub/ (1998)
18. Daniele, M., Traverso, P., Vardi, M.: Strong cyclic planning revisited. In: Proceedings of the 5th European Conference on Planning (ECP-99). (1999)
19. Nilsson, N.: Principles of Artificial Intelligence. Tioga Publishing Co., Palo Alto, CA (1980)
20. Feng, Z., Hansen, E.: Symbolic heuristic search for factored Markov decision processes. (2002) Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02).