Distributed interference cancellation in multi-agent scenarios
arXiv:1910.10109
Abstract
This paper considers the problem of detecting impaired and noisy nodes over network. In a distributed algorithm, lots of processing units are incorporating and communicating with each other to reach a global goal. Due to each one's state in the shared environment, they can help the other nodes or mislead them (due to noise or a deliberate attempt). Previous works mainly focused on proper locating agents and weight assignment based on initial environment state to minimize malfunctioning of noisy nodes. We propose an algorithm to be able to adapt sharing weights according to behavior of the agents. Applying the introduced algorithm to a multi-agent RL scenario and the well-known diffusion LMS demonstrates its capability and generality.
References in corpus (8)
- Discrete Signal Processing on Graphs: Sampling Theory
- Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation over Adaptive Networks
- Counterfactual Multi-Agent Policy Gradients
- Diffusion LMS over Multitask Networks
- Stationary signal processing on graphs
- Sensor Selection for Estimation with Correlated Measurement Noise
- Deep Exploration via Randomized Value Functions
- Diffusion LMS Strategies in Sensor Networks with Noisy Input Data