The compression power of symbolic pattern databases

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 2-11

  Ball, Marcel ^a   Holte, Robert C ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DECISION TABLES; HEURISTIC METHODS; SCHEDULING;

ABSTRACT SPACES; COMPRESSION POWER; EXPERIMENTAL EVIDENCES; LOOK-UP TABLES; ORDERS OF MAGNITUDES; PATTERN DATABASE; PROBLEM DOMAINS; SINGLE DOMAINS; STATE SPACES;

TABLE LOOKUP;

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

References (20)

1. Ball, M. A. 2008. Compression of pattern databases using algebraic decision diagrams. Master's thesis, University of Alberta.
2. Bonet, B., and Geffner, H. 1999. Planning as heuristic search: New results. In Biundo, S., and Fox, M., eds., Proc. 5th European Conf. on Planning, 359-371. Durham, UK: Springer: Lecture Notes on Computer Science.
3. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
4. Edelkamp, S., and Kissmann, P. 2008. Limits and possibilities of bdds in state space search. In AAAI'08.
5. Edelkamp, S. 2001. Planning with pattern databases. In Proceedings of the 6th European Conference on Planning, 13-24.
6. Edelkamp, S. 2002. Symbolic pattern databases in heuristic search planning. In Proceedings of Sixth International Conference on AI Planning and Scheduling (AIPS-02), 274-283.
7. Felner, A.; Korf, R. E.; Meshulam, R.; and Holte, R. 2007. Compressed pattern databases. Journal of Artificial Intelligence Research 30:213-247.
8. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. In IEEE Transactions on Systems Science and Cybernetics, volume SSC-4(2), 100-107.
9. Hernádvölgyi, I., and Holte, R. C. 2000. Experiments with automatically created memory-based heuristics. Proc. SARA-2000, Lecture Notes in Artificial Intelligence 1864:281-290.
10. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research (JAIR) 14:253-302.
11. Holte, R. C.; Felner, A.; Newton, J.; Meshulam, R.; and Furcy, D. 2006. Maximizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence 170:1123-1136.
12. Korf, R. E., and Felner, A. 2007. Recent progress in heuristic search: A case study of the four-peg Towers of Hanoi problem. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 2324-2329.
13. Korf, R. E. 1980. Toward a model of representation changes. Artificial Intelligence 14(1):41-78.
14. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
15. Long, D., and Fox, M., eds. 2003. Special Issue on the 3rd International Planning Competition, Journal of Artificial Intelligence Research (JAIR), volume 20.
16. Prieditis, A. E. 1993. Machine discovery of effective admissible heuristics. Machine Learning 12:117-141.
17. Reinefeld, A., and Marsland, T. 1994. Enhanced iterativedeepening search. IEEE Trans. PAMI 16:701-710.
18. R.I. Bahar; E.A. Frohm; C.M. Gaona; G.D. Hachtel; E. Macii; A. Pardo; and F. Somenzi. 1993. Algebraic Decision Diagrams and Their Applications. In IEEE /ACM International Conference on CAD, 188-191. Santa Clara, California: IEEE Computer Society Press.
19. Samadi, M.; Siabani, M.; Felner, A.; and Holte, R. 2008. Compressing pattern databases with learning. In ECAI'2008.
20. Somenzi, F 2005. CUDD: CU Decision Diagram package release 2.4.1. Software Release.