Enriching Non-Parametric Bidirectional Search Algorithms
Authors: Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon E. Shimony, Avi Hayoun2379-2386
AAAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We ran experiments on four domains: (1) 50 14-Pancake Puzzle instances with the GAP heuristic (Helmert 2010). To get a range of heuristic strengths, we also used the GAP-n heuristics (for n = 1 . . . 3) where the n smallest pancakes are left out of the heuristic computation. (2) The standard 100 instances of the 15 Puzzle problem (Korf 1985) using the Manhattan Distance heuristic. (3) Grid-based pathfinding: 156 maps from Dragon Age Origins (DAO) (Sturtevant 2012), each with different start and goal points (a total of 3150 instances); (4) 50 instances of the 12-disk 4-peg Towers of Hanoi (TOH4) problem with (10+2), (8+4) and (6+6) additive PDBs (Felner, Korf, and Hanan 2004). Table 1 presents results averaged over all instances for a representative set of the heuristics we used. |
| Researcher Affiliation | Academia | Shahaf S. Shperberg CS Department Ben-Gurion University Be er-Sheva, Israel shperbsh@post.bgu.ac.il Ariel Felner ISE Department Ben-Gurion University Be er-Sheva, Israel felner@bgu.ac.il Nathan R. Sturtevant CS Department University of Alberta Canada sturtevant@cs.du.edu Solomon E. Shimony Avi Hayoun CS Department Ben-Gurion University Be er-Sheva, Israel shimony@cs.bgu.ac.il hyounav@cs.bgu.ac.il |
| Pseudocode | Yes | Algorithm 1: LBF high-level Algorithm 2: NBS Expand Level (LB, C) Algorithm 3: DVCBS Expand a Level |
| Open Source Code | No | The paper does not provide any concrete access information (link, statement of release, or mention of supplementary materials) for its source code. |
| Open Datasets | Yes | We ran experiments on four domains: (1) 50 14-Pancake Puzzle instances with the GAP heuristic (Helmert 2010)... (2) The standard 100 instances of the 15 Puzzle problem (Korf 1985)... (3) Grid-based pathfinding: 156 maps from Dragon Age Origins (DAO) (Sturtevant 2012)... (4) 50 instances of the 12-disk 4-peg Towers of Hanoi (TOH4) problem with (10+2), (8+4) and (6+6) additive PDBs (Felner, Korf, and Hanan 2004). |
| Dataset Splits | No | The paper mentions the number of instances for each problem domain but does not specify any training, validation, or test splits for these instances. |
| Hardware Specification | No | The paper does not provide specific details regarding the hardware (e.g., CPU, GPU models, memory) used for running the experiments. |
| Software Dependencies | No | The paper does not provide specific software dependency details, such as library names or version numbers, needed to replicate the experiments. |
| Experiment Setup | No | The paper describes the algorithmic logic and variants (e.g., how nodes are selected for expansion) but does not provide specific experimental setup details such as hyperparameter values, training configurations, or system-level settings. |