Proximal Operators for Multi-Agent Path Planning

Authors: Jose Bento, Nate Derbinsky, Charles Mathy, Jonathan Yedidia

AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental Finally, we report the performance of the new operators in several numerical experiments.
Researcher Affiliation Collaboration Jose Bento Boston College jose.bento@bc.edu Nate Derbinsky Wentworth Institute of Technology derbinskyn@wit.edu Charles Mathy Disney Research Boston cmathy@disneyresearch.com Jonathan S. Yedidia Disney Research Boston yedidia@disneyresearch.com
Pseudocode No No, the paper does not contain any clearly labeled pseudocode or algorithm blocks.
Open Source Code No No, the paper does not provide a direct link to open-source code or explicitly state that the code is publicly available.
Open Datasets No No, the paper describes a custom scenario setup for experiments but does not provide access information (link, DOI, etc.) for a publicly available or open dataset.
Dataset Splits No No, the paper does not provide specific training/validation/test dataset splits. It describes experimental scenarios and reports performance metrics but not data partitioning details.
Hardware Specification Yes We gathered all results with a Java implementation of the ADMM and the TWA as described in Bento et al. (2013; see Appendix ??) using JDK7 and Ubuntu v12.04 run on a desktop machine with 2.4GHz cores.
Software Dependencies Yes We gathered all results with a Java implementation of the ADMM and the TWA as described in Bento et al. (2013; see Appendix ??) using JDK7 and Ubuntu v12.04 run on a desktop machine with 2.4GHz cores.
Experiment Setup Yes We run the TWA using OLD on the 2D scenario called CONF1 in Bento et al. (2013) with p = 8 agents of radius r = 0.918, equally spaced around a circle of radius R = 3, each required to exchange position with the corresponding antipodal agent (cf. Fig. 1-(a)).