Abstract

T. Uras and S. Koenig. Identifying Hierarchies for Fast Optimal Search. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2014.

Abstract: Search with Subgoal Graphs (Uras, Koenig, and Hernandez 2013) was a non-dominated optimal path-planning algorithm in the Grid-Based Path Planning Competitions 2012 and 2013. During a preprocessing phase, it computes a Simple Subgoal Graph from a given grid, which is analogous to a visibility graph for continuous terrain, and then partitions the vertices into global and local subgoals to obtain a Two-Level Subgoal Graph. During the path-planning phase, it performs an A* search that ignores local subgoals that are not relevant to the search, which significantly reduces the size of the graph being searched. In this paper, we generalize this partitioning process to any undirected graph and show that it can be recursively applied to generate more than two levels, which reduces the size of the graph being searched even further. We distinguish between basic partitioning, which only partitions the vertices into different levels, and advanced partitioning, which can also add new edges. We show that the construction of Simple-Subgoal Graphs from grids and the construction of Two-Level Subgoal Graphs from Simple Subgoal Graphs are instances of generalized partitioning. We then report on experiments on Subgoal Graphs that demonstrate the effects of different types and levels of partitioning. We also report on experiments that demonstrate that our new N-Level Subgoal Graphs achieve a speed up of 1.6 compared to Two-Level Subgoal graphs from (Uras, Koenig, and Hernandez 2013) on maps from the video games StarCraft and Dragon Age: Origins. Errata: This version of the paper has two references corrected. Comment: It was pointed out to us when we presented the paper at AAAI-15 that subgoal hierarchies are related to contraction hierarchies (R. Geisberger, P. Sanders, D. Schultes, D. Delling. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In 7th Workshop on Experimental Algorithms (WEA), LNCS 5038, pages 319-333, 2007) and swamp hierarchies with swamps of size one (N. Pochter, A. Zohar, J. Rosenschein and A. Felner. Search Space Reduction Using Swamp Hierarchies. Proceedings of the AAAI, 2010). This is exciting news since it not only allows for the unification of concepts but might also make it possible to obtain much larger speedups on grid-based path planning tasks by using ideas from highway routing. You definitely want to check out these papers as well!

Download the paper in pdf.

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.


This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.