Strong Temporal Planning with Uncontrollable Durations: A State-Space Approach

Authors: Alessandro Cimatti, Andrea Micheli, Marco Roveri

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

Reproducibility Variable Result LLM Response
Research Type Experimental An experimental evaluation over several benchmark problems shows the practical feasibility of the proposed approach.
Researcher Affiliation Academia Alessandro Cimatti and Andrea Micheli and Marco Roveri Fondazione Bruno Kessler Italy {cimatti,amicheli,roveri}@fbk.eu
Pseudocode Yes Algorithm 1 The FSSTP framework
Open Source Code Yes The tool and the benchmark set can be downloaded from: https: //es-static.fbk.eu/people/roveri/tests/aaai15.
Open Datasets Yes We considered all planning problems from the temporal track of the IPC 2011 (Coles et al. 2012b): we modified them by declaring some actions uncontrollable and by enlarging the duration intervals of actions. [...] The tool and the benchmark set can be downloaded from: https: //es-static.fbk.eu/people/roveri/tests/aaai15.
Dataset Splits No The paper refers to using 'planning problems from the temporal track of the IPC 2011' and other benchmarks, but does not specify any training/validation/test dataset splits or cross-validation setup.
Hardware Specification Yes The experiments were executed on a Scientific Linux 64 bit, 12 cores Intel Xeon at 2.67GHz, with 96GB RAM.
Software Dependencies No The paper mentions COLIN, C++, and Math SAT SMT solver, but does not provide specific version numbers for any of these software components.
Experiment Setup Yes We used a timeout of 5 minutes, and a memory limit of 8GB. [...] We implemented the approaches described in the previous section as an extension of COLIN [...] We added three new schedulers, each implementing one of the defined encodings. [...] We considered all planning problems from the temporal track of the IPC 2011 [...] we modified them by declaring some actions uncontrollable and by enlarging the duration intervals of actions.