An Analysis of Map-Based Abstraction and Refinement

  • Nathan Sturtevant
  • Renee Jansen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4612)


A variety of techniques have been introduced over the last decade for abstracting search graphs and then using these abstractions for search. While some basic work has been done to predict the value of an abstraction mechanism, the results have not been validated in practice. In this paper we analyze a variety of old and new abstraction mechanisms in a pathfinding testbed and show that the work done in abstraction-based refinement-style search can be predicted by the diameter and size of abstract nodes.


Single Node Total Work Abstract Graph Search Graph Cost Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)CrossRefGoogle Scholar
  2. 2.
    Holte, R.C., Mkadmi, T., Zimmer, R.M., MacDonald, A.J.: Speeding up problem solving by abstraction: A graph oriented approach. Artificial Intelligence 85, 321–361 (1996)CrossRefGoogle Scholar
  3. 3.
    Botea, A., Müller, M., Schaeffer, J.: Near optimal hierarchical path–finding. Journal of Game Development 1(1), 7–28 (2004)Google Scholar
  4. 4.
    Sturtevant, N.R., Buro, M.: Partial pathfinding using map abstraction and refinement. In: AAAI, pp. 1392–1397 (2005)Google Scholar
  5. 5.
    Fernandez, A., Gonzalez, J.: Multi-Hierarchical Representation of Large-Scale Space. Kluwer Academic Publishers, Dordrecht (2001)zbMATHGoogle Scholar
  6. 6.
    Yang, Q., Tenenberg, J., Woods, S.: On the implementation and evaluation of ABT weak. Computational Intelligence Journal 12, 295–318 (1996)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Nathan Sturtevant
    • 1
  • Renee Jansen
    • 1
  1. 1.Department of Computing Science, University of Alberta, Edmonton, Alberta, T6G 2E8Canada

Personalised recommendations