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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Culberson, J.C., Schaeffer, J.: Efficiently searching the 15-puzzle. Technical Report TR 94-08, Department of Computing Science, University of Alberta (1994)
Culberson, J.C., Schaeffer, J.: Searching with pattern databases. In: Canadian Conference on AI, pp. 402–416 (1996)
Dillenburg, J.F., Nelson, P.C.: Perimeter search. Artificial Intelligence 65(1), 165–178 (1994)
Edelkamp, S.: Planning with pattern databases. In: ECP: European Conference on Planning, Toledo, pp. 13–34 (2001)
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)
Felner, A., Korf, R.E., Hanan, S.: Additive pattern database heuristics. JAIR: Journal of Artificial Intelligence Research 22, 279–318 (2004)
Ariel Felner and Nir Ofek. Combining perimeter search and pattern database abstractions. In: SARA. Symposium on Abstraction Reformulation and Approximation (2007)
Felner, A., Zahavi, U., Schaeffer, J., Holte, R.: Dual lookups in pattern databases. In: IJCAI, pp. 103–108 (2005)
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)
Holte, R.C., Newton, J., Felner, A., Meshulam, R., Furcy, D.: Multiple pattern databases. In: ICAPS, pp. 122–131 (2004)
Kaindl, H., Kainz, G.: Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research 7, 283–317 (1997)
Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artifificial Intelligence 27(1), 97–109 (1985)
Korf, R.E.: Delayed duplicate detection: Extended abstract. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 1539–1541. Morgan Kaufmann, San Francisco (2003)
Manzini, G.: BIDA: An improved perimeter search algorithm. Artificial Intelligence 75(2), 347–360 (1995)
Reinefeld, A., Marsland, T.A.: Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(7), 701–710 (1994)
Zahavi, U., Felner, A., Holte, R., Schaeffer, J.: Dual search in permutation state spaces. In: AAAI, pp. 1076–1081 (2006)
Zhou, R., Hansen, E.A.: Space-efficient memory-based heuristics. In: AAAI, pp. 677–682 (2004)
Zhou, R., Hansen, E.A.: External-memory pattern databases using structured duplicate detection. In: AAAI, pp. 1398–1405 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anderson, K., Holte, R., Schaeffer, J. (2007). Partial Pattern Databases. In: Miguel, I., Ruml, W. (eds) Abstraction, Reformulation, and Approximation. SARA 2007. Lecture Notes in Computer Science(), vol 4612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73580-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-73580-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73579-3
Online ISBN: 978-3-540-73580-9
eBook Packages: Computer ScienceComputer Science (R0)