Memory-efficient symbolic heuristic search

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 304-313

  Jensen, Rune M ^a   Hansen, Eric A ^b   Richards, Simon ^b   Zhou, Rong ^c  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b MISSISSIPPI STATE UNIVERSITY   (United States)

^c PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; PERFORMANCE; PROBLEM SOLVING; STATE SPACE METHODS; STORAGE ALLOCATION (COMPUTER);

BINARY DECISION DIAGRAMS; MEMORY EFFICIENT STRATEGY; STRIPS PLANNING PROBLEMS; SYMBOLIC SEARCHES;

HEURISTIC METHODS;

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

References (24)

1. Bertoli, P.; Cimatti, A.; Roveri, M.; and Traverso, P. 2001. Planning in nondeterministic domains under partial observability via symbolic model checking. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), 473-478.
2. Cimatti, A.; Roveri, M.; and Bertoli, P. 2004. Conformant planning via symbolic model checking and heuristic search. Artificial Intelligence 159(1-2):127-206.
3. Cimatti, A.; Roveri, M.; and Traverso, P. 1998. Automatic OBDD-based generation of universal plans in non-deterministic domains. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), 875-881.
4. Clarke, E.; Grumberg, O.; and Peled, D. 2000. Model Checking. MIT Press.
5. Edelkamp, S., and Reffel, F. 1998. OBDDs in heuristic search. In Proceedings of the 22nd Annual German Conference on Artificial Intelligence, volume 1504 of Lecture Notes in Computer Science, 81-92. Springer.
6. Edelkamp, S. 2001. Directed symbolic exploration in AI-planning. In Proceedings of the AAAI Spring Symposium on Model-Based Validation of Intelligence, 84-92.
7. Edelkamp, S. 2002. Symbolic pattern databases in heuristic search planning. In Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems (AIPS-02), 274-283.
8. Edelkamp, S. 2005. External symbolic heuristic search with pattern databases. In Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), 51-60.
9. Feng, Z., and Hansen, E. 2002. Symbolic heuristic search for factored Markov decision processes. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), 455-460.
10. Hansen, E.; Zhou, R.; and Feng, Z. 2002. Symbolic heuristic search using decision diagrams. In Proceedings of the 5th International Symposium on Abstraction, Reformulation, and Approximation, volume 2371 of Lecture Notes in Computer Science, 83-98. Springer.
11. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proceedings of the 5th International Conference on Artificial Intelligence Planning System (AIPS'00), 140-149. AAAI Press.
12. Hoey, J.; St-Aubin, R.; Hu, A. J.; and Boutilier, C. 1999. SPUDD: Stochastic planning using decision diagrams. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99), 279-288.
13. Jensen, R., and Veloso, M. 2000. OBDD-based universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research 13:189-226.
14. Jensen, R.; Bryant, R.; and Veloso, M. 2002. SetA*: An efficient BDD-based heuristic search algorithm. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), 668-673.
15. Jensen, R. 2003. Efficient BDD-based planning for non-deterministic, fault-tolerant, and adversarial domains. Ph.D. Dissertation, Carnegic-Mellon University. Technical report no. CMU-CS-03-139.
16. Korf, R.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005. Frontier search. Journal of the ACM 52(5):715-748.
17. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
18. Korf, R. 1999. Divide-and-conquer bidirectional search: First results. In Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 1184-1189.
19. Nymeyer, A., and Qian, K. 2003. Heuristic search algorithms based on symbolic data structures. In Proceedings of the 16th Australian Conference on Artificial Intelligence, volume 2903 of Lecture Notes in Computer Science, 966-979. Springer.
20. Richards, S. 2004. Symbolic bidirectional breadth-first heuristic search. Master's thesis, Mississippi State University. Department of Computer Science and Engineering.
21. Yang, B.; Bryant, R. E.; O'Hallaron, D. R.; Biere, A.; Coudert, O.; Janssen, G.; Ranjan, R. K.; and Somenzi, F. 1998. A performance study of BDD-based model checking. In Formal Methods in Computer-Aided Design FM-CAD-98, 255-289.
22. Zhou, R., and Hansen, E. 2003. Sparse-memory graph search. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), 1259-1266.
23. Zhou, R., and Hansen, E. 2005. Beam-stack search: Integrating backtracking with beam search. In Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), 90-98.
24. Zhou, R., and Hansen, E. 2006. Breadth-first heuristicsearch. Artificial Intelligence 170(4-5):385-408.