The Multi-Agent Transportation Problem
Authors: Pascal Bachor, Rolf-David Bergdoll, Bernhard Nebel
AAAI 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | A MAT solver is empirically evaluated with regard to varying input characteristics and movement constraints and compared to a MAPD solver that utilizes conflict-based search (CBS). We empirically evaluate the runtime of our implementation with regard to varying input characteristics, such as the number of containers or the size of the environment, and movement constraints, such as whether or not the containers block each other. We performed three sets of experiments. |
| Researcher Affiliation | Academia | Pascal Bachor, Rolf-David Bergdoll, Bernhard Nebel Albert-Ludwigs-Universit at Freiburg Freiburg im Breisgau, Germany {bachorp, bergdolr, nebel}@cs.uni-freiburg.de |
| Pseudocode | Yes | Algorithm 1 Exponential search for the optimal makespan |
| Open Source Code | Yes | We make the source code and all test results available online1. 1https://github.com/bachorp/mat |
| Open Datasets | No | The paper states that instances were "randomly generated" and describes the parameters for this generation, but it does not use or provide access to a pre-existing publicly available dataset. There is no specific link, DOI, or citation for a dataset that could be accessed by others. |
| Dataset Splits | No | The paper describes how problem instances were randomly generated for experiments, but it does not specify any training, validation, or test dataset splits (e.g., percentages, sample counts, or predefined splits) for reproducibility of data partitioning. |
| Hardware Specification | Yes | All tests presented in this paper were conducted using the solver s default configuration and 4 threads on Intel Xeon Gold 6242 processors. |
| Software Dependencies | No | The paper mentions using "the SAT solver Cryptominisat" and adapting "conflict-based search with optimal task assignment (CBS-TA)" and the "Hopcroft-Karp algorithm," but it does not specify any version numbers for these software components. |
| Experiment Setup | Yes | The program was allowed to run for at most 10 minutes in total per instance and to use at most 16 GB of memory. We generated 10 such solvable problem instances for each combination 4 g 12, b {10, 20} and 1 a, c 10, where we call a given (g, b, a, c)-tuple a parameter set. |