Compiling Away Uncertainty in Strong Temporal Planning with Uncontrollable Durations
Authors: Andrea Micheli, Minh Do, David E. Smith
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We evaluate our technique by comparing it with a recent technique for PDDL domains with temporal uncertainty. The experimental results demonstrate the practical applicability of our approach and show complementary behavior with respect to previous techniques. |
| Researcher Affiliation | Collaboration | Andrea Micheli FBK and University of Trento Trento, 38123, Italy amicheli@fbk.eu Minh Do and David E. Smith NASA Ames Research Center Moffet Field, CA, 94035, USA {minh.do, david.smith}@nasa.gov |
| Pseudocode | No | The paper does not contain a dedicated "Pseudocode" or "Algorithm" block. The compilation technique is described in prose and mathematical notation. |
| Open Source Code | No | The paper states "We implemented our compilation approach in an automatic translator" but does not provide specific access information (e.g., a link or an explicit statement of public release) for this code. |
| Open Datasets | Yes | We used ... the full benchmark set of 563 problems described in [Cimatti et al., 2015]. We considered two domains adapted from the FAPE distribution, namely rover and handover. Additionally, we model a match domain derived from the matchcellar domain used in IPC 2011. |
| Dataset Splits | No | The paper mentions using "the full benchmark set of 563 problems" and different configurations for ANML domains, but does not specify any explicit training, validation, or test dataset splits (e.g., percentages or counts). |
| Hardware Specification | No | The paper states "We used a timeout of 600 seconds, with 8 GB of memory" but does not specify any particular hardware details such as CPU or GPU models used for the experiments. |
| Software Dependencies | No | The paper mentions using the "COLIN and POPF planners" and the "FAPE [Dvorak et al., 2014] planner" but does not provide specific version numbers for these software dependencies. |
| Experiment Setup | Yes | We used a timeout of 600 seconds, with 8 GB of memory and the full benchmark set of 563 problems described in [Cimatti et al., 2015]. For each domain, we tested with three different configurations: different initial states, goals, and variable domains. |