Multi-Agent Path Finding on Strongly Biconnected Digraphs
Authors: Adi Botea, Pavel Surynek
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our work may be the first formal study of multi-agent path finding on directed graphs. and We contribute the first tractability analysis of multi-agent path finding on directed graphs (digraphs)... We introduce di BOX, a sub-optimal algorithm, and formally discuss its completeness, correctness, and complexity. and In future work, we plan to extend our analysis to other classes of digraphs, or to instances where rotations in a cycle do not require using a blank. We are also interested in implementing and evaluating the performance of our method. |
| Researcher Affiliation | Collaboration | Adi Botea IBM Research Dublin, Ireland Pavel Surynek Faculty of Mathematics and Physics Charles University Prague |
| Pseudocode | Yes | Algorithm 1 di BOX in pseudocode. |
| Open Source Code | No | In future work, we plan to extend our analysis to other classes of digraphs, or to instances where rotations in a cycle do not require using a blank. We are also interested in implementing and evaluating the performance of our method. |
| Open Datasets | No | This paper is a theoretical study focusing on algorithm design and complexity analysis; it does not involve the use of empirical datasets for training or evaluation. |
| Dataset Splits | No | This paper is a theoretical study; it does not involve empirical experiments with dataset splits for validation. |
| Hardware Specification | No | This is a theoretical paper focused on algorithm design and complexity analysis, thus it does not mention any specific hardware used for experiments. |
| Software Dependencies | No | This paper presents a theoretical algorithm (di BOX) and its complexity analysis, including pseudocode. However, it does not provide specific software dependencies or version numbers, as it is not an implementation paper. |
| Experiment Setup | No | This paper is a theoretical study focusing on algorithm design and analysis. It does not describe any empirical experiments, and therefore, no experimental setup details or hyperparameters are provided. |