From Non-Negative to General Operator Cost Partitioning
Authors: Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We implemented the state equation heuristic and the potential heuristic that optimizes the heuristic value of the initial state in the Fast Downward planning system (Helmert 2006). All our experiments were run on the set of tasks from optimal tracks of IPC 1998 2011, limiting runtime to 30 minutes and memory usage to 2 GB. Each task ran on a single core of an Intel Xeon E5-2660 processor (2.2 GHz). Linear programs were solved with IBM s CPLEX v12.5.1. Table 1 shows the number of solved tasks (coverage) for the tested configurations. Figure 2 shows that using general operator cost partitioning substantially reduces the number of expansions. Figure 3: Number of solved tasks per time for the potential and the state equation heuristic. |
| Researcher Affiliation | Academia | Florian Pommerening and Malte Helmert and Gabriele R oger and Jendrik Seipp University of Basel Basel, Switzerland |
| Pseudocode | No | The paper does not contain any sections explicitly labeled as "Pseudocode" or "Algorithm", nor does it present any structured algorithmic steps in a code-like format. |
| Open Source Code | No | The paper does not provide any explicit statement or link indicating that the source code for the described methodology is publicly available. |
| Open Datasets | Yes | All our experiments were run on the set of tasks from optimal tracks of IPC 1998 2011 |
| Dataset Splits | No | The paper mentions using "tasks from optimal tracks of IPC 1998 2011" but does not specify any training, validation, or test dataset splits or percentages. |
| Hardware Specification | Yes | Each task ran on a single core of an Intel Xeon E5-2660 processor (2.2 GHz). |
| Software Dependencies | Yes | Linear programs were solved with IBM s CPLEX v12.5.1. |
| Experiment Setup | Yes | All our experiments were run on the set of tasks from optimal tracks of IPC 1998 2011, limiting runtime to 30 minutes and memory usage to 2 GB. |