Skip to main content
ConductScienceScienceDex
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.

1

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

1 result for “multi-agent path finding”

Learn how ShareScore rates datasets ↗
zenodo40/100

Benchmark maps and assignments for multi-agent path finding

<p><strong>The dataset</strong></p> <p>The dataset is produced within the SafeLog project and it is used for benchmarking of multi-agent path planning algorithms. Specifically, the dataset consists of a set of 21 maps with increasing density and a set of 500 random assignments, each for a group of 100 agents for planning on each of the maps.</p> <p>All of the maps, in the form of a graph G = {V, E}, are built on&nbsp;the same set of 400 vertices V. The sets of edges Ej, where j &isin; (0; 20), in the maps then form a set ranging from a spanning tree to a mostly 4-connected graph. These maps were created by generating a complete square graph with the size of 20*20 vertices. The graph was then simplified to a spanning tree, and, finally, approximately 50 random edges from the complete graph were added 20 times, to create the set of 21 maps of density ranging from 800 to 1500 edges in the graph.&nbsp;<br> &nbsp;</p> <p><strong>Content and format</strong></p> <p>The following files are included in the dataset</p> <p><em>test_nodes.txt&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</em>- 400 nodes of a 20*20 square map in the form &quot;id x y&quot;<br> <em>testAssignment.txt</em>&nbsp; &nbsp; &nbsp; &nbsp; - 50499 random pairs of nodes ids from test_nodes.txt<br> <em>test_edgesX.txt</em>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;- pairs of adjacent nodes ids from test_nodes.txt forming edges<br> &nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;- X = 0 - tree<br> &nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;- X = 20 - full graph<br> &nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;- created starting at a full graph and repeatedly erasing edges until a tree remains</p> <p>To illustrate the maps in&nbsp;the dataset, we provide three images (1008.png, 1190.png, and 1350.png) showing maps with 1008 (1190, 1350) edges.&nbsp;</p> <p><strong>Citation</strong></p> <p>If you use the dataset, please cite:</p> <p>[1]&nbsp;&nbsp;Hvězda, J., Rybeck&yacute;, T., Kulich, M., and Přeučil, L. (2018). <a href="https://doi.org/10.1109/ITSC.2018.8569712"><em>Context-Aware Route Planning for Automated Warehouses</em></a>. Proceedings of 2018 21st International Conference on Intelligent Transportation Systems (ITSC).</p> <p><em>@inproceedings{Hvezda18itsc,<br> &nbsp; author = {Hvězda, Jakub and Rybeck&yacute;, Tom&aacute;&scaron; and Kulich, Miroslav and Přeučil, Libor},<br> &nbsp; title = {Context-Aware Route Planning for Automated Warehouses},<br> &nbsp; booktitle = {Proceedings of 2018 21st International Conference on Intelligent Transportation Systems (ITSC)},<br> &nbsp; publisher = {IEEE Intelligent Transportation Systems Society},<br> &nbsp; address = {Maui},<br> &nbsp; year = {2018},<br> &nbsp; doi = {10.1109/ITSC.2018.8569712},<br> }</em></p> <p>&nbsp;</p> <p>[2]&nbsp;Hvězda, J., Kulich, M., and Přeučil, L. (2019). <a href="https://link.springer.com/chapter/10.1007/978-3-030-31993-9_18">On Randomized Searching for Multi-robot Coordination</a>.&nbsp;&nbsp;In: Gusikhin O., Madani K. (eds) Informatics in Control, Automation and Robotics. ICINCO 2018. Lecture Notes in Electrical Engineering, vol 613. Springer, Cham.</p> <p><em>@inbook{Hvezda19springer,<br> &nbsp;&nbsp; &nbsp;author = {Hvězda, Jakub and Kulich, Miroslav and Přeučil, Libor},<br> &nbsp;&nbsp; &nbsp;title = {On Randomized Searching for Multi-robot Coordination},<br> &nbsp;&nbsp; &nbsp;booktitle = {Informatics in Control, Automation and Robotics},<br> &nbsp;&nbsp; &nbsp;publisher = {Springer},<br> &nbsp;&nbsp; &nbsp;address = {Cham, CH},<br> &nbsp;&nbsp; &nbsp;year = {2019},<br> &nbsp;&nbsp; &nbsp;series = {Lecture Notes in Electrical Engineering},<br> &nbsp;&nbsp; &nbsp;language = {English},<br> &nbsp;&nbsp; &nbsp;url = {https://link.springer.com/chapter/10.1007/978-3-030-31993-9_18},<br> &nbsp;&nbsp; &nbsp;doi = {10.1007/978-3-030-31993-9},<br> }</em></p> <p><br> [3] Hvězda, J., Kulich, M., and Přeučil, L. (2018). <a href="http://www.scitepress.org/PublicationsDetail.aspx?ID=ppwUqsGaX18=\&amp;t=1">Improved Discrete RRT for Coordinated Multi-robot Planning</a>. Proceedings of the 15th International Conference on Informatics in Control, Automation and Robotics - (Volume 2).</p> <p><em>@inproceedings{Hvezda18icinco,<br> &nbsp; author = {Hvězda, Jakub and Kulich, Miroslav and Přeučil, Libor},<br> &nbsp; title = {Improved Discrete RRT for Coordinated Multi-robot Planning},<br> &nbsp; booktitle = {Proceedings of the 15th International Conference on Informatics in Control, Automation and Robotics - (Volume 2)},<br> &nbsp; publisher = {SciTePress},<br> &nbsp; address = {Madeira, PT},<br> &nbsp; year = {2018},<br> &nbsp; language = {English},<br> &nbsp; url = {http://www.scitepress.org/PublicationsDetail.aspx?ID=ppwUqsGaX18=\&amp;t=1},<br> &nbsp; doi = {10.5220/0006865901710179},<br> &nbsp; access = {full}<br> }</em></p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p>

opencc-by-4.0Jan 2021View 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

ScienceDex for faculty

Your academic CV and NIH biosketch

Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.