This upload contains code and data for learning policy sketches for classical planning domains and comparing the planners (1) first iteration of LAMA, (2) Dual-BFWS, (3) Serialized Iterated Width (SIW), and (4) Serialized Iterated Width with Sketches (SIWR) on a subset of classical planning benchmarks. The upload also contains an extended version of the paper published at ICAPS with further details and proofs. - benchmarks.zip contains a subset of classical planning domains. - experiments.zip contains experimental code and data for learning sketches and testing the four planners from above - data.zip contains textual representation of sketches for some of these domains, which can be given as input to the SIWR planner, and the logs genera...
Recent studies have shown that propositional planners, which de-rive from Graphplan and SATPLAN, can...
This repository contains the code, data sets, and experiment data for the AAAI 2022 paper "Explainab...
Abstract. We have recently shown that classical planning problems can be characterized in terms of a...
It has been observed that in many of the benchmark planning domains, atomic goals can be reached wit...
This bundle contains all benchmarks, code, and data used in the paper "Optimality Certificates for C...
This volume contains the papers accepted for presentation at ICAPS 2011, the Twenty-First Internatio...
Code The file speck-seipp-icaps2022-code.zip contains an extended version of the Fast Downward plan...
In a field of research about general reasoning mechanisms, it is essential to have appropriate bench...
22nd International Conference on Automated Planning and Scheduling. June 25-29, 2012, Atibaia, Sao P...
Automated, domain-independent planning is a research area within Artificial Intelligence that is use...
Benchmark suite for oversubscription planning. The benchmarks were created in a similar fashion to ...
In a field of research about general reasoning mechanisms, it is essential to have appropriate bench...
This repositories contains the code, benchmarks, and the experimental results for the ICAPS 2022 pap...
We introduce a width parameter that bounds the complexity of classical planning problems and domains...
# Fast Downward Fuzzing Extension @InProceedings{steinmetz-et-al-icaps22, author={M. Steinmetz ...
Recent studies have shown that propositional planners, which de-rive from Graphplan and SATPLAN, can...
This repository contains the code, data sets, and experiment data for the AAAI 2022 paper "Explainab...
Abstract. We have recently shown that classical planning problems can be characterized in terms of a...
It has been observed that in many of the benchmark planning domains, atomic goals can be reached wit...
This bundle contains all benchmarks, code, and data used in the paper "Optimality Certificates for C...
This volume contains the papers accepted for presentation at ICAPS 2011, the Twenty-First Internatio...
Code The file speck-seipp-icaps2022-code.zip contains an extended version of the Fast Downward plan...
In a field of research about general reasoning mechanisms, it is essential to have appropriate bench...
22nd International Conference on Automated Planning and Scheduling. June 25-29, 2012, Atibaia, Sao P...
Automated, domain-independent planning is a research area within Artificial Intelligence that is use...
Benchmark suite for oversubscription planning. The benchmarks were created in a similar fashion to ...
In a field of research about general reasoning mechanisms, it is essential to have appropriate bench...
This repositories contains the code, benchmarks, and the experimental results for the ICAPS 2022 pap...
We introduce a width parameter that bounds the complexity of classical planning problems and domains...
# Fast Downward Fuzzing Extension @InProceedings{steinmetz-et-al-icaps22, author={M. Steinmetz ...
Recent studies have shown that propositional planners, which de-rive from Graphplan and SATPLAN, can...
This repository contains the code, data sets, and experiment data for the AAAI 2022 paper "Explainab...
Abstract. We have recently shown that classical planning problems can be characterized in terms of a...