Partially Observable Mean Field Multi-agent Reinforcement Learning Based On Graph-attention

Abstract

Traditional multi-agent reinforcement learning algorithms are difficultly applied in a large-scale multi-agent environment. The introduction of mean field theory has enhanced the scalability of multi-agent reinforcement learning in recent years. This paper considers partially observable multi-agent reinforcement learning (MARL), where each agent can only observe other agents within a fixed range. This partial observability affects the agent's ability to assess the quality of the actions of surrounding agents. This paper focuses on developing a method to capture more effective information from local observations in order to select more effective actions. Previous work in this field employs probability distributions or weighted mean field to update the average actions of neighborhood agents, but it does not fully consider the feature information of surrounding neighbors and leads to a local optimum. In this paper, we propose a novel multi-agent reinforcement learning algorithm, Partially

Stats

• citations19
• S2 citations—
• github stars0
• HF likes0
• heat score9.76
• arxiv keyyang2023partially

Related papers

• Partially Observable Mean Field Reinforcement Learning (2020)0.00
• Mean Field Multi-agent Reinforcement Learning (2018)2.26
• Multi Type Mean Field Reinforcement Learning (2020)0.00
• Cooperative Multi-agent Reinforcement Learning With Partial Observations (2020)10.35
• Mean-field Multi-agent Reinforcement Learning: A Decentralized Network Approach (2021)0.00
• Major-minor Mean Field Multi-agent Reinforcement Learning (2023)0.00
• Graph Exploration For Effective Multi-agent Q-learning (2023)5.24
• Learning Large-scale Competitive Team Behaviors With Mean-field Interactions And Online Opponent Modeling (2025)0.00