Collaborative Information Dissemination with Graph-based Multi-Agent Reinforcement Learning
원문 초록
Efficient information dissemination is crucial for supporting critical operations across domains like disaster response, autonomous vehicles, and sensor networks. This paper introduces a Multi-Agent Reinforcement Learning (MARL) approach as a significant step forward in achieving more decentralized, efficient, and collaborative information dissemination. We propose a Partially Observable Stochastic Game (POSG) formulation for information dissemination empowering each agent to decide on message forwarding independently, based on the observation of their one-hop neighborhood. This constitutes a significant paradigm shift from heuristics currently employed in real-world broadcast protocols. Our novel approach harnesses Graph Convolutional Reinforcement Learning and Graph Attention Networks (GATs) with dynamic attention to capture essential network features. We propose two approaches, L-DyAN and HL-DyAN, which differ in terms of the information exchanged among agents. Our experimental results show that our trained policies outperform existing methods, including the state-of-the-art heuristic, in terms of network coverage as well as communication overhead on dynamic networks of varying density and behavior.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Biological Pathway Guided Gene Selection Through Collaborative Reinforcement Learning
Artificial Generals Intelligence: Mastering Generals.io with Reinforcement Learning
Multi-Agent Reinforcement Learning for Autonomous Multi-Satellite Earth Observation: A Realistic Case Study
Dynamic Reinsurance Treaty Bidding via Multi-Agent Reinforcement Learning
Wasserstein-Barycenter Consensus for Cooperative Multi-Agent Reinforcement Learning
Decentralizing Multi-Agent Reinforcement Learning with Temporal Causal Information
토론
이 논문과 연결된 포럼 글이 아직 없습니다.