Abstract
T. Uras, S. Koenig and C. Hernandez. Subgoal Graphs for Eight-Neighbor Gridworlds [Competition Abstract]. In Symposium on Combinatorial Search (SoCS), 2012.Abstract: We propose a method for preprocessing an eight-neighbor gridworld to generate a subgoal graph and a method for using this subgoal graph to find shortest paths faster than A*, by first finding high-level paths through subgoals and then shortest low-level paths between consecutive subgoals in the high-level path.
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.