Symbolic Synthesis of Fault-Tolerance Ratios in Parameterised Multi-Agent Systems
Authors: Panagiotis Kouvaros, Alessio Lomuscio, Edoardo Pirovano
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We present an implementation and report the experimental results obtained on a number of protocols from swarm robotics. |
| Researcher Affiliation | Academia | 1 University of Cyprus, Department of Computer Science 2 Imperial College London, Department of Computing |
| Pseudocode | Yes | Algorithm 1 λ-synthesis Decision Procedure, Algorithm 2 Labelling Procedure, Algorithm 3 Parameterised λ-Synthesis Decision Procedure |
| Open Source Code | No | The paper states: 'We implemented our algorithms in MCMAS-PFTS, a toolkit constructed from MCMAS-P', but it does not provide concrete access to the source code for the work described in this paper. |
| Open Datasets | No | The paper describes using problem settings like 'train-gate-controller', 'collective transport', and 'Alpha algorithm' protocols, which are modelled scenarios rather than publicly available datasets with access information. |
| Dataset Splits | No | The paper does not provide specific dataset split information (exact percentages, sample counts, or detailed splitting methodology). |
| Hardware Specification | No | The paper does not provide specific hardware details (exact GPU/CPU models, processor types, or memory amounts) used for running its experiments. |
| Software Dependencies | No | The paper mentions implementing algorithms in 'MCMAS-PFTS, a toolkit constructed from MCMAS-P', but does not provide specific version numbers for these or other ancillary software components. |
| Experiment Setup | Yes | For 'Collective transport': 'discretised time, space and direction of movement and assumed that the robots are working on a finite 5 x 5 grid. ... We initialised the robots at coordinates either (1, 1) or (1, 2) or (2, 1) or (2, 2) and their goal located at (3, 5). ... each robot only receives broadcasts from 3 of its neighbours.' For 'Alpha algorithm': 'we fixed a 5 x 5 arena (once again wrapping around), assumed a communication range of 1, and let α = 2.' |