Identifying Hierarchies for Fast Optimal Search

Authors: Tansel Uras, Sven Koenig

AAAI 2014 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental 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 Hern andez 2013) on maps from the video games Star Craft and Dragon Age: Origins.
Researcher Affiliation Academia Tansel Uras Sven Koenig Department of Computer Science University of Southern California Los Angeles, USA {turas, skoenig}@usc.edu
Pseudocode Yes Algorithm 1 Constructing N-Level Graphs and Algorithm 2 Searching N-Level Graphs
Open Source Code No The paper mentions a competition website and a map repository but does not provide any explicit statement or link for the open-source code of their methodology.
Open Datasets Yes All maps are available from Nathan Sturtevant s repository at http://movingai.com/benchmarks/.
Dataset Splits No The paper mentions using different map types for experiments (e.g., Star Craft, Dragon Age: Origins maps, maze maps) but does not provide specific details on how these datasets are split into training, validation, or test sets with percentages or sample counts.
Hardware Specification Yes The experiments are run on a PC with a dual-core 3.2GHz Intel Xeon CPU and 2GB of RAM.
Software Dependencies No The paper describes algorithms and data structures used (e.g., A* search, binary heap) but does not specify any software names with version numbers, such as programming languages, libraries, or solvers.
Experiment Setup No The paper describes the high-level construction of N-Level Graphs and partitioning methods but does not provide specific numerical hyperparameters, training configurations, or detailed system-level settings for the algorithms beyond the type of partitioning (basic vs. advanced).