Dynamic Size Message Scheduling for Multi-Agent Communication under Limited Bandwidth
Communication plays a vital role in multi-agent systems, fostering collaboration and coordination. However, in real-world scenarios where communication is bandwidth-limited, existing multi-agent reinforcement learning (MARL) algorithms often provide agents with a binary choice: either transmitting a fixed number of bytes or no information at all. This limitation hinders the ability to effectively utilize the available bandwidth. To overcome this challenge, we present the Dynamic Size Message Scheduling (DSMS) method, which introduces a finer-grained approach to scheduling by considering the actual size of the information to be exchanged. Our contribution lies in adaptively adjusting message sizes using Fourier transform-based compression techniques, enabling agents to tailor their messages to match the allocated bandwidth while striking a balance between information loss and transmission efficiency. Receiving agents can reliably decompress the messages using the inverse Fourier transform. Experimental results demonstrate that DSMS significantly improves performance in multi-agent cooperative tasks by optimizing the utilization of bandwidth and effectively balancing information value.
Code (0)
등록된 구현이 없습니다.
Tasks
Multi-agent Reinforcement LearningSchedulingSimilar Papers 제목 키워드 기반
QMNet: Importance-Aware Message Exchange for Decentralized Multi-Agent Reinforcement Learning
To improve the performance of multi-agent reinforcement learning under the constraint of wireless resources, we propose a message importance metric and design an importance-aware scheduling policy to effectively exchange…
Multi-agent Reinforcement Learningreinforcement-learningSchedulingLearning-based Measurement Scheduling for Loosely-Coupled Cooperative Localization
In cooperative localization, communicating mobile agents use inter-agent relative measurements to improve their dead-reckoning-based global localization. Measurement scheduling enables an agent to decide which subset of …
Combinatorial OptimizationSchedulingLearning to Schedule Communication in Multi-agent Reinforcement Learning
Many real-world reinforcement learning tasks require multiple agents to make sequential decisions under the agents' interaction, where well-coordinated actions among the agents are crucial to achieve the target goal bett…
Deep Reinforcement LearningMulti-agent Reinforcement Learningreinforcement-learningReinforcement Learning+2Hierarchically Structured Scheduling and Execution of Tasks in a Multi-Agent Environment
In a warehouse environment, tasks appear dynamically. Consequently, a task management system that matches them with the workforce too early (e.g., weeks in advance) is necessarily sub-optimal. Also, the rapidly increasin…
Deep Reinforcement LearningManagementreinforcement-learningReinforcement Learning+2Ripple Effect Protocol: Coordinating Agent Populations
Modern AI agents can exchange messages using protocols such as A2A and ACP, yet these mechanisms emphasize communication over coordination. As agent populations grow, this limitation produces brittle collective behavior,…