pith. sign in

arxiv: 2010.04978 · v1 · pith:YMQR63TVnew · submitted 2020-10-10 · 💻 cs.MA

Event-Triggered Multi-agent Reinforcement Learning with Communication under Limited-bandwidth Constraint

classification 💻 cs.MA
keywords communicationmulti-agentbandwidthevent-triggeredlearningreinforcementsystemsconstraint
0
0 comments X
read the original abstract

Communicating with each other in a distributed manner and behaving as a group are essential in multi-agent reinforcement learning. However, real-world multi-agent systems suffer from restrictions on limited-bandwidth communication. If the bandwidth is fully occupied, some agents are not able to send messages promptly to others, causing decision delay and impairing cooperative effects. Recent related work has started to address the problem but still fails in maximally reducing the consumption of communication resources. In this paper, we propose Event-Triggered Communication Network (ETCNet) to enhance the communication efficiency in multi-agent systems by sending messages only when necessary. According to the information theory, the limited bandwidth is translated to the penalty threshold of an event-triggered strategy, which determines whether an agent at each step sends a message or not. Then the design of the event-triggered strategy is formulated as a constrained Markov decision problem, and reinforcement learning finds the best communication protocol that satisfies the limited bandwidth constraint. Experiments on typical multi-agent tasks demonstrate that ETCNet outperforms other methods in terms of the reduction of bandwidth occupancy and still preserves the cooperative performance of multi-agent systems at the most.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Asynchronous Cooperative Multi-Agent Reinforcement Learning with Limited Communication

    cs.MA 2025-02 unverdicted novelty 6.0

    AsynCoMARL is a new asynchronous MARL algorithm that matches leading baselines on success and collision rates while using 26% fewer messages via graph transformers on dynamic communication graphs.