Symbolic Pattern Databases in Heuristic Search Planning

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 274-283

  Edelkamp, Stefan ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; HEURISTIC ALGORITHMS; MODULAR ROBOTS;

ACTION PLANNING; DOMAIN INDEPENDENTS; HEURISTIC MODEL; HEURISTIC SEARCH; HEURISTIC SEARCH PLANNING; INDEPENDENT ACTION; MODELS CHECKING; PATTERN DATABASE; RECENT PROGRESS; SYMBOLIC REPRESENTATION;

MODEL CHECKING;

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

References (43)

1. Bertoli, P., and Cimatti, A. 2002. Improving heuristics for planning as search in belief space. In Artificial Intelligence Planning and Scheduling (AIPS). This volume.
2. Bertoli, P.; Cimatti, A.; Roveri, M.; and Traverso, P. 2001. Planning in nondeterministic domains under partial observability via symbolic model checking. In International Joint Conference on Artificial Intelligence (IJCAI).
3. Bertoli, P.; Cimatti, A.; and Roveri, M. 2001. Heuristic search symbolic model checking = efficient conformant planning. In International Joint Conference on Artificial Intelligence (IJCAI), 467-472.
4. Bloem, R.; Ravi, K.; and Somenzi, F. 2000. Symbolic guided search for CTL model checking. In Conference on Design Automation (DAC), 29-34.
5. Bryant, R. E. 1992. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3):142-170.
6. Cabodi, G.; Camurati, P.; and Quer, S. 1996. Improved reachability analysis of large finite state machines. In Computer-Aided Design (CAD), 354-359.
7. Cimatti, A.; Giunchiglia, F.; and Roveri, M. 2000. Abstraction in planning via model checking. Technical report, IRST.
8. Cimatti, A.; Roveri, M.; and Traverso, P. 1998. Automatic OBDD-based generation of universal plans in nondeterministic domains. In National Conference on Artificial Intelligence (AAAI), 875-881.
9. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(4):318-334.
10. Edelkamp, S., and Helmert, M. 1999. Exhibiting knowledge in planning problems to minimize state encoding length. In European Conference on Planning (ECP), Lecture Notes in Computer Science, 135-147. Springer.
11. Edelkamp, S., and Helmert, M. 2001. The model checking integrated planning system MIPS. AI-Magazine 67-71.
12. Edelkamp, S., and Reffel, F. 1998. OBDDs in heuristic search. In German Conference on Artificial Intelligence (KI), Lecture Notes in Computer Science, 81-92. Springer.
13. Edelkamp, S., and Schrödl, S. 2000. Localizing A*. In National Conference on Artificial Intelligence (AAAI), 885-890.
14. Edelkamp, S. 2001a. Directed symbolic exploration and its application to AI-planning. In AAAI-Spring Symposium on Model-based Validation of Intelligence, 84-92.
15. Edelkamp, S. 2001b. Planning with pattern databases. In European Conference on Planning (ECP), Lecture Notes in Computer Science. Springer. 13-24.
16. Edelkamp, S. 2001c. Prediction of regular search tree growth by spectral analysis. In German Conference on Artificial Intelligence (KI), Lecture Notes in Computer Science. Springer. 154-168.
17. Edelkamp, S. 2002. Mixed propositional and numerical planning in the Model Checking Integrated Planning System. In The International Conference on AI Planning and Scheduling (AIPS), Workshop on Temporal Planning.
18. Feng, Z., and Hansen, E. 2002. Symbolic heuristic search for factored markov decision processes. In National Conference on Artificial Intelligence (AAAI). To appear.
19. Fikes, R., and Nilsson, N. 1971. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2:189-208.
20. Fox, M., and Long, D. 2001. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Technical report, University of Durham, UK.
21. Fraer, R.; Kamhi, G.; B. Ziv, M. Y. V.; and Fix, L. 2000. Efficient reachability analysis for verification and falsification. IBM FV'2000 Summer Seminar. www.haifa.il.ibm.com/ibmfv2000/abstracts/fraer.html.
22. Giunchiglia, F., and Traverso, P. 1999. Planning as model checking. In European Conference on Planning (ECP), 1-19.
23. Hansen, E. A., and Zilberstein, S. 1998. Heuristic search in cyclic anc/or graphs. In National Conference on Artificial Intelligence (AAAI), 412-418.
24. Hansen, E. A.; Zhou, R.; and Feng, Z. 2002. Symbolic heuristic search using decision diagrams. submitted.
25. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for heuristic determination of minimum path cost. IEEE Transactions on on Systems Science and Cybernetics 4:100-107.
26. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Artificial Intelligence Planning and Scheduling (AIPS), 140-149.
27. Helmert, M. 2001. On the complexity of planning in transportation domains. In European Conference on Planning (ECP), Lecture Notes in Computer Science, 349-360. Springer.
28. Hernadvölgyi, I. T. 2000. Automatic generation of memory based search heursitics. In National Conference on Artificial Intelligence (AAAI). 1103.
29. Hoffmann, J., and Nebel, B. 2001. Fast plan generation through heuristic search. Artificial Intelligence Research 14:253-302.
30. Hoffmann, J. 2002. Local search topology in planning benchmarks: A theoretical analysis. In Artificial Intelligence Planning and Scheduling (AIPS). This volume.
31. Holte, R. C., and Hernadvölgyi, I. T. 1999. A space-time tradeoff for memory-based heuristics. In National Conference on Artificial Intelligence (AAAI), 704-709.
32. Jensen, R. M., and Veloso, M. M. 2000. OBDD-based universal planning for synchronized agents in nondeterministic domains. Artificial Intelligence Research 13:189-226.
33. Jensen, R. M.; Bryant, R. E.; and Veloso, M. M. 2002. SetA*: An efficient BDD-based heuristic search algorithm. In National Conference on Artificial Intelligence (AAAI). To appear.
34. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning propositional logic, and stochastic search. In National Conference on Artificial Intelligence (AAAI), 1194-1201.
35. Korf, R. E., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134(1-2):9-22.
36. Korf, R. E.; Reid, M.; and Edelkamp, S. 2001. Time Complexity of Iterative-Deepening-A*. Artificial Intelligence 129(1-2):199-218.
37. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
38. Korf, R. E. 1997. Finding optimal solutions to Rubik's Cube using pattern databases. In National Conference on Artificial Intelligence (AAAI), 700-705.
39. Meinel, C., and Stangier, C. 2001. Hierarchical image computation with dynamic conjunction scheduling. In Conference on Computer Design (ICCD'01).
40. Pearl, J. 1985. Heuristics. Addison-Wesley.
41. Reffel, F., and Edelkamp, S. 1999. Error detection with directed symbolic model checking. In World Congress on Formal Methods (FM), Lecture Notes in Computer Science, 195-211. Springer.
42. Reinefeld, A., and Marsland, T. A. 1994. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(7):701-710.
43. Yang, C. H., and Dill, D. L. 1998. Validation with guided search of the state space. In Conference on Design Automation (DAC), 599-604.