Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in Coakley et alK. L. Coakley, T. Snelleman, H. Hoos, and O. E. Gundersen, "The embrace of open science: An analysis of a decade of AI research and 56 800 conference papers," Under Review, 2026..
Distributed Decoupling of Multiagent Simple Temporal Problems
Authors: Jayanth Krishna Mogali, Stephen F. Smith, Zachary B. Rubinstein
IJCAI 2016 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We present experimental results for the proposed method on problems of varying sizes, and demonstrate its effectiveness in terms of solving quality and computational cost. |
| Researcher Affiliation | Academia | Jayanth Krishna Mogali, Stephen F. Smith, Zachary B. Rubinstein The Robotics Institute, Carnegie Mellon University 5000 Forbes Avenue, Pittsburgh, PA 15213 EMAIL |
| Pseudocode | Yes | Algorithm 1 Modified DC-ADMM For Decoupling |
| Open Source Code | No | The paper does not provide an explicit statement or link indicating that the source code for the described methodology is publicly available. |
| Open Datasets | Yes | To evaluate the effectiveness of our approach, we tested our algorithm on a set of reference problems called the BDH Problem Instances2, due to [Boerkoel and Durfee, 2013]. This dataset contains problems with varying numbers of agents... https://data.3tu.nl/repository/uuid:ce3ad00b-d905-4be3-8785-228ae19e371a |
| Dataset Splits | No | The paper mentions using a set of 'BDH Problem Instances' for evaluation but does not specify any training, validation, or test splits for these instances. |
| Hardware Specification | Yes | All experiments were carried out on an Intel 4 core i7-4790 processor at 3.6 GHz. |
| Software Dependencies | No | The paper mentions 'C++ with Message Passing Interface (MPI)' and 'Interior Point Solver IPOPT' but does not specify version numbers for any of these software dependencies. |
| Experiment Setup | Yes | The penalty multiplier c in Algorithm 1 was set to 1 on the assumption that the coupling constraints are fairly evenly distributed. The feasibility tolerance Inf was set to 0.1 based on the judgment that a maximum infeasibility with regard to any single DEC constraint of one tenth of a time tick would be insignificant from a practical perspective. |