Partial Pattern Databases

  • Kenneth Anderson
  • Robert Holte
  • Jonathan Schaeffer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4612)

Abstract

Perimeters and pattern databases are two similar memory-based techniques used in single-agent search problems. We present partial pattern databases, which unify the two approaches into a single memory-based heuristic table. Our approach allows the use of any abstraction level. We achieve a three-fold reduction in the average number of nodes generated on the 13-pancake puzzle and a 27% reduction on the 15-puzzle.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Culberson, J.C., Schaeffer, J.: Efficiently searching the 15-puzzle. Technical Report TR 94-08, Department of Computing Science, University of Alberta (1994)Google Scholar
  2. 2.
    Culberson, J.C., Schaeffer, J.: Searching with pattern databases. In: Canadian Conference on AI, pp. 402–416 (1996)Google Scholar
  3. 3.
    Dillenburg, J.F., Nelson, P.C.: Perimeter search. Artificial Intelligence 65(1), 165–178 (1994)CrossRefGoogle Scholar
  4. 4.
    Edelkamp, S.: Planning with pattern databases. In: ECP: European Conference on Planning, Toledo, pp. 13–34 (2001)Google Scholar
  5. 5.
    Felner, A., Adler, A.: Solving the 24 puzzle with instance dependent pattern databases. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 248–260. Springer, Heidelberg (2005)Google Scholar
  6. 6.
    Felner, A., Korf, R.E., Hanan, S.: Additive pattern database heuristics. JAIR: Journal of Artificial Intelligence Research 22, 279–318 (2004)MATHGoogle Scholar
  7. 7.
    Ariel Felner and Nir Ofek. Combining perimeter search and pattern database abstractions. In: SARA. Symposium on Abstraction Reformulation and Approximation (2007)Google Scholar
  8. 8.
    Felner, A., Zahavi, U., Schaeffer, J., Holte, R.: Dual lookups in pattern databases. In: IJCAI, pp. 103–108 (2005)Google Scholar
  9. 9.
    Holte, R.C., Grajkowski, J., Tanner, B.: Hierarchical heuristic search revisited. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 121–133. Springer, Heidelberg (2005)Google Scholar
  10. 10.
    Holte, R.C., Newton, J., Felner, A., Meshulam, R., Furcy, D.: Multiple pattern databases. In: ICAPS, pp. 122–131 (2004)Google Scholar
  11. 11.
    Kaindl, H., Kainz, G.: Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research 7, 283–317 (1997)MATHGoogle Scholar
  12. 12.
    Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artifificial Intelligence 27(1), 97–109 (1985)MATHCrossRefGoogle Scholar
  13. 13.
    Korf, R.E.: Delayed duplicate detection: Extended abstract. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 1539–1541. Morgan Kaufmann, San Francisco (2003)Google Scholar
  14. 14.
    Manzini, G.: BIDA: An improved perimeter search algorithm. Artificial Intelligence 75(2), 347–360 (1995)MATHCrossRefGoogle Scholar
  15. 15.
    Reinefeld, A., Marsland, T.A.: Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(7), 701–710 (1994)CrossRefGoogle Scholar
  16. 16.
    Zahavi, U., Felner, A., Holte, R., Schaeffer, J.: Dual search in permutation state spaces. In: AAAI, pp. 1076–1081 (2006)Google Scholar
  17. 17.
    Zhou, R., Hansen, E.A.: Space-efficient memory-based heuristics. In: AAAI, pp. 677–682 (2004)Google Scholar
  18. 18.
    Zhou, R., Hansen, E.A.: External-memory pattern databases using structured duplicate detection. In: AAAI, pp. 1398–1405 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kenneth Anderson
    • 1
  • Robert Holte
    • 1
  • Jonathan Schaeffer
    • 1
  1. 1.University of Alberta, Computing Science Department, Edmonton, Alberta, T6G 2E8Canada

Personalised recommendations