Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.04978 v1 pith:YMQR63TV submitted 2020-10-10 cs.MA

classification cs.MA
keywords communicationmulti-agentbandwidthevent-triggeredlearningreinforcementsystemsconstraint
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Learning To Communicate Over An Unknown Shared Network

    cs.MA 2025-07 conditional novelty 6.0 of 10

    A DRL-based querying policy trained only on a single-parameter queue simulation transfers zero-shot to real WiFi (5-50 agents) and cellular networks and adapts its query rate to congestion.

Pith tools