External symbolic heuristic search with pattern databases

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 51-60

  Edelkamp, Stefan ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MODULAR ROBOTS; SCHEDULING;

BREADTH-FIRST SEARCH; HEURISTIC EVALUATION FUNCTIONS; HEURISTIC SEARCH; INTERNATIONAL PLANNING COMPETITIONS; OPTIMAL SEARCH; PATTERN DATABASE; SYMBOLIC REPRESENTATION; SYMBOLIC SEARCH;

HEURISTIC ALGORITHMS;

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

References (42)

1. A. Aggarwal and J. S. Vitter. The input/output, complexity of sorting and related problems. Journal of the ACM, 31 (9):1116-1127, 1988.
2. L. Arge. The I/O - complexity of ordered binary decision diagram manipulation. In International Symposium on Algorithms and Computation (ISAAC), pages 82-91, 1995.
3. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 193-207, 1999.
4. Biere.//eke - efficient//-calculus model checking. In Computer-Aided Verification (CAV), pages 468-471, 1997.
5. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001.
6. R. E. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transaction on Computing, C35(8):677-691, 1986.
7. Cimatti, E. Giunchiglia, F., Giunchiglia, and P. Traverso. Planning via model checking: A deci-sion procedure for AR. In European Conference on Planning (ECP), pages 130-142, 1997.
8. A. Cimatti, M. Roveri, and P. Traverso. Automatic OBDD-based generation of universal plans in non- deterministic domains. In National Conference on Artificial Intelligence (AAAI), pages 875-881, 1998.
9. J. C. Culberson and J. Schaeffer. Pattern databases. Computational Intelligence, 14(4):318-334, 1998.
10. R. B. Dial. Shortest-path forest with topological ordering. Communication of the ACM, 12(ll):632-633. 1969.
11. S. Edelkamp and M. Helmert. Exhibiting knowledge in planning problems to minimize state encoding length. In European Conference on Planning (ECP), pages 135-147, 1999.
12. S. Edelkamp and M. Helmert. The model checking integrated planning system MIPS. AI-Magazine, pages 67-71, 2001.
13. S. Edelkamp and F. Reffel. OBDDs in heuristic search. In German Conference on Artificial Intelligence (KI), pages 81-92, 1998.
14. S. Edelkamp, S. Jabbar, and S. Schroedl. External A*. In German Conference on Artificial Intelligence (KI), pages 226-240, 2004.
15. S. Edelkamp. Symbolic pattern databases in heuristic search planning. In Artificial Intelligence Planning and Scheduling (AIPS), pages 274-283* 2002.
16. R. Fikes and N. Nilsson. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.
17. E. A. Hansen, R. Zhou, and Z. Feng. Symbolic heuristic search using decision diagrams. In Symposium on Abstraction, Reformulation and Approximation (SARA), pages 83-98, 2002.
18. P. Haslum and H. Geffner. Admissible heuristics for optimal planning. In Artificial Intelligence Planning and Scheduling (AIPS), pages 140-149, 2000.
19. M. Helmert. A planning heuristic based on causal graph analysis. In International Conference on Automated Planning and Scheduling (ICAPS), pages 161- 170, 2004.
20. R. C. Holte, M. B. Perez, R. M. Zimmer, and A. J. Donald. Hierarchical A*: Searching abstraction hierarchies. In National Conference on Artificial Intelligence (AAAI), pages 530-535, 1996.
21. J. Hu and D. L. Dill. Reducing BDD size by exploiting functional dependencies. In Design Automation, pages 266-271, 1993.
22. S. Jabbar and S. Edelkamp. I/O efficient directed model checking. In Conference on Verification, Model Checking and Abstract Interpretation (VMCAI), 2005. 313-329.
23. R. M. Jensen, R. E. Bryant, and M. M. Veloso. SetA*: An efficient BDD-based heuristic search algorithm. In National Conference on Artificial Intelligence (AAAI), pages 668-673, 2002.
24. H. Kautz and B. Selman. Pushing the envelope: Planning propositional logic, and stochastic search. In National Conference on Artificial Intelligence (AAAI), pages 1194-1201, 1996.
25. R. E. Korf and A. Felner. Disjoint pattern database heuristics. In J. Schaeffer and H. J. van den Herik, editors, Chips Challenging Champions, pages 13-26. Elsevier Science, 2002.
26. R. E. Korf. Finding optimal solutions to Rubik's Cube using pattern databases. In National Conference on Artificial Intelligence (AAAI), pages 700-705, 1997.
27. Breadth-first frontier search with delayed duplicate detection
28. Symbolic Model Checking
29. Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
30. I/O-complexity of graph algorithms
31. Heuristic Search Algorithms Based on Symbolic Data Structures
32. Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases
33. Error detection with directed symbolic model checking
34. Algorithms for Memory Hierarchies
35. Heuristic search + local model checking in selective μ-calculus
36. Using magnetic disk instead of main memory in the murphi verifier
37. Branching Programs and Binary Decision Diagrams
38. A Performance Study of BDD-Based Model Checking
39. Space-and time-efficient BDD construction via working set control
40. Breadth-first heuristic search
41. Structured duplicate detection in external-memory graph search