Abstract
Whilst creating a perimeter around the goal node has led to very good results in some domains, it has been demonstrated that the performance decreases dramatically in other domains. This paper introduces a mathematical model which explains this phenomenon. Its purpose is twofold: firstly to analyze the performance of the heuristic function employed in perimeter search algorithms with any perimeter depth, h pd (·), and secondly to compare it with the performance of its unidirectional counterpart, h(·). The model introduced herein will be used for deriving other very important properties of the perimeter heuristic function such as the cross-over point where one heuristic function is preferable to the other.
This is a preview of subscription content, log in via an institution to check access.
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
Pohl, I.: First results on the effect of error in heuristic search. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 5, American Elsevier, New York (1970)
Pearl, J.: Heuristics. Addison-Wesley, Reading (1984)
Hansson, O., Mayer, A., Yung, M.: Criticizing solutions to relaxed models yields powerful admissible heuristics. Information Sciences 63, 207–222 (1992)
Korf, R.E., Taylor, L.A.: Finding optimal solutions to the twenty-four puzzle. In: Proceedings AAAI 1996, pp. 1202–1207 (1996)
Kainz, G., Kaindl, H.: Dynamic improvements of heuristic evaluations during search. In: AAAI 1996, pp. 311–317 (1996)
Kaindl, H., Kainz, G.: Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research 7, 283–317 (1997)
Culberson, J.C., Schaeffer, J.: Efficiently searching the 15-puzzle. Technical Report TR 94-08, University of Alberta (1994)
Culberson, J.C., Schaeffer, J.: Searching with pattern databases. In: Advances in Artificial Intelligence, 402–416. Springer-Verlag (1996)
Manzini, G.: BIDA∗: an improved perimeter search algorithm. Artificial Intelligence 75, 347–360 (1995)
Dillenburg, J.F., Nelson, P.C.: Perimeter search. Artificial Intelligence 65, 165–178 (1994)
Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27, 97–109 (1985)
Linares, C.: Caracterización de los modelos de búsqueda de un agente con descripciones generalizadas de los nodos origen y destino. PhD thesis, Facultad de Informática. Universidad Politécnica de Madrid (2001)
Linares, C., Junghanns, A.: Perimeter search performance. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 345–359. Springer, Heidelberg (2003)
Korf, R.E., Reid, M.: Complexity analysis of admissible heuristic search. In: Proceedings AAAI 1998, pp. 305–310 (1998)
Edelkamp, S., Korf, R.E.: The branching factor of regular search spaces. In: AAAI 1998, pp. 299–304 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Linares López, C. (2004). On the Heuristic Performance of Perimeter Search Algorithms. In: Conejo, R., Urretavizcaya, M., Pérez-de-la-Cruz, JL. (eds) Current Topics in Artificial Intelligence. TTIA 2003. Lecture Notes in Computer Science(), vol 3040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25945-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-25945-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22218-7
Online ISBN: 978-3-540-25945-9
eBook Packages: Springer Book Archive