Skip to main content
Powered by ShareScore

Find research datasets worth reusing

Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.

7

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

7 results for “PDDL”

Learn how ShareScore rates datasets ↗
zenodo36/100

PDDL benchmarks for oversubscription planning

<p>Benchmark suite for oversubscription planning.</p> <p>The benchmarks were created in a similar fashion to the procedure described by Domshlak and Mirkis (2015), based on the collection of classical International Planning Competition (IPC) domains. The bounds are set to 25%, 50%, 75%, or 100% of the best known solution cost for the classical planning task obtained from planning.domains (Muise 2016). Each goal in the original problem has a utility of 10 and a randomly chosen 5% of the facts have a uniformly distributed integer utility in the range [1, 5].</p> <p>For more details, see:</p> <p>Michael Katz, Emil Keyder, Florian Pommerening and Dominik Winterer. Oversubscription Planning as Classical Planning with Multiple Cost Functions. In <em>Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019)</em>. 2019.</p>

opencc-by-4.0Feb 2019View details →
zenodo36/100

Experimental data and benchmarks used in the paper "Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks"

<p>This dataset contains both benchmarks and data used in the paper.</p> <p>PDDL benchmark files can be found in the files benchmarks.tar.gz and<br> bagged-benchmarks.tar.gz. The former contains all domains from all IPCs from the<br> repository https://bitbucket.org/aibasel/downward-benchmarks, without duplicate<br> domains that have been used in multiple IPCs. The latter contains the subset of<br> these tasks for which the reformulation in the &quot;bagged representation&quot; from the<br> following paper succeeded:</p> <p>Riddle, P.; Douglas, J.; Barley, M.; and Franco, S. 2016. Improving<br> performance by reformulating PDDL into a bagged representation.<br> In ICAPS 2016 Workshop on Heuristics and Search for Domain-<br> independent Planning, 28&ndash;36.</p> <p>We obtained the implementation of the baggy reformluation from the authors.</p> <p>All other files in this dataset contain raw and processed data of all<br> experiments, which were generated using Downward-Lab (see<br> https://doi.org/10.5281/zenodo.399255). The scripts used to run the experiments<br> can be found in the software bundle for this paper (see<br> https://doi.org/10.5281/zenodo.2621897).</p> <p>Directories without the &quot;-eval&quot; ending contain raw data, distributed over a<br> subdirectory for each experiment. Each of these contain a subdirectory tree<br> structure &quot;runs-*&quot; where each planner run has its own directory. For each run,<br> there are symbolic links to the input PDDL files domain.pddl and problem.pddl<br> (can be resolved by putting the benchmarks directory to the right place), the<br> run log file &quot;run.log&quot; (stdout), possibly also a run error file &quot;run.err&quot;<br> (stderr), the run script &quot;run&quot; used to start the experiment, and a &quot;properties&quot;<br> file that contains data parsed from the log file(s). Some directories (not for<br> the ground experiments, where these files got too large) also contain a file<br> generators.py that contain all symmetry group generators in permutation<br> notation.</p> <p>Directories with the &quot;-eval&quot; ending contain a &quot;properties&quot; file, which contains<br> a JSON directory with combined data of all runs of the corresponding<br> experiment. In essence, the properties file is the union over all properties<br> files generated for each individual planner run.</p>

opencc-by-4.0Apr 2019View details →
zenodo36/100

Unsolvable PDDL Benchmarks

<p>Collection of unsolvable planning task from (a) the benchmarks used in the Unsolvability IPC 2016 (https://unsolve-ipc.eng.unimelb.edu.au) and (b) http://fai.cs.uni-saarland.de/downloads/unsat-benchmarks.tar.bz2. All solvable problems from the original benchmarks are removed. Some domains and problems overlapped: The problems in the two directories bottleneck and unsat-pegsol-strips from (b) are identical to the ones in bottleneck and pegsol from (a) and thus omitted. We assume that problems in folders unsat-nomystery, unsat-rovers and unsat-tpp from (b) also overlap with those in folders over-nomystery, over-rovers and over-tpp from (a), but kept all problems from those folders.</p>

opencc-by-4.0Jul 2019View details →
zenodo32/100

Grammar2PDDL: PDDL benchmark generated from data science grammar

<p>A PDDL benchmark set, generated from Data Science grammar by requiring particular rules and terminals as soft goals.</p> <p>The dataset can also be found at&nbsp;<a href="https://github.com/IBM/PDDL-benchmark-ds-grammar">https://github.com/IBM/PDDL-benchmark-ds-grammar</a></p>

openapache2.0Mar 2020View details →
zenodo32/100

STRIPS PDDL benchmarks from sequential optimization tracks of IPC 1998-2014

<p>Subset of STRIPS benchmarks from the sequential optimization tracks of IPC 1998-2014&nbsp;from&nbsp;<a href="https://github.com/aibasel/downward-benchmarks">https://github.com/aibasel/downward-benchmarks</a>.</p>

opencc-by-4.0Mar 2018View details →
zenodo32/100

STRIPS PDDL benchmarks from sequential optimization tracks of IPC 1998-2018

<p>Subset of STRIPS benchmarks from the sequential optimization tracks of IPC 1998-2018 from&nbsp;<a href="github.com/aibasel/downward-benchmarks">https://github.com/aibasel/downward-benchmarks</a>.</p>

opencc-by-4.0Mar 2019View details →
zenodo28/100

PDDL+ Dataset

<p>.</p>

opencc-by-4.0Oct 2023View details →

ScienceDex guides

Understand access before you commit

These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.

Compare curated datasets

Allen Brain Atlas

Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.

allen-brain-atlas
neuroscienceopenDocumentation, web resources, and API references are available online.
Last verified 2026-04-30Open record

Annotated Behaviour and Observability Dataset (ABODe)

ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.

abode-home-cage
behavioral-neuroscienceopenThe DataShare record exposes download links for annotations, documentation, license text, and the zipped per-snippet data directory.
Last verified 2026-04-30Open record

DANDI Archive for NWB datasets

DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.

dandi-nwb
electrophysiologyopenPublished Dandiset metadata and archive endpoints are available through the production DANDI API.
Last verified 2026-04-30Open record

International Brain Laboratory public data

The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.

ibl
behavioral-neuroscienceopenPublic sessions can be searched and loaded from the IBL public data server through ONE.
Last verified 2026-04-29Open record

OpenNeuro

OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.

openneuro
neuroscienceopenPublished datasets are available on demand over the internet.
Last verified 2026-04-29Open record