Exploiting Symmetries by Planning for a Descriptive Quotient
Authors: Mohammad Abdulaziz, Michael Norrish, Charles Gretton
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | By running our algorithm, we obtained a set of benchmarks with soluble descriptive quotients whose solutions can be instantiated to concrete plans. That set includes 439 problems, from 16 IPC benchmarks and 4 benchmarks from [Porco et al., 2013]. In all our experimentation we identified 120 instances where we were able to confirm that the descriptive quotient does not have a solution and the concrete problem does. Figure 1 plots the sizes, in terms of the number of actions, of concrete and quotient problem descriptions. The plotted data shows that the descriptive quotient can be much smaller than its concrete counterpart. In just over 15% of instances the quotient has less than half the number of actions. |
| Researcher Affiliation | Collaboration | Mohammad Abdulaziz and Michael Norrish and Charles Gretton Canberra Research Lab., NICTA , Australian National University, Griffith University |
| Pseudocode | No | The paper describes methods and definitions but does not include any blocks of pseudocode or explicitly labeled algorithms. |
| Open Source Code | Yes | bitbucket.org/Mohammad Abdulaziz/planning.git in code Base. |
| Open Datasets | Yes | That set includes 439 problems, from 16 IPC benchmarks and 4 benchmarks from [Porco et al., 2013]. |
| Dataset Splits | No | The paper refers to using benchmarks but does not specify any training, validation, or test dataset splits or percentages. |
| Hardware Specification | No | No specific hardware (e.g., GPU/CPU models, memory) used for experiments is mentioned in the paper. |
| Software Dependencies | No | Implemented in C++,2 our approach uses: NAUTY\TRACES to calculate symmetries [Mc Kay and Piperno, 2014]; Z3 to find isomorphic subproblems [de Moura and Bjørner, 2008]; and the initial-plan search by LAMA as the base planner [Richter and Westphal, 2010]. While specific software is named, no version numbers are provided in the text. |
| Experiment Setup | Yes | We limit base planner runtimes to 30 minutes. |