.png){kind=icon}
返回
FMRQ-A Multiagent Reinforcement Learning Algorithm for Fully Cooperative Tasks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2016.2544866.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a multiagent reinforcement learning algorithm dealing with fully cooperative tasks. The algorithm is called frequency of the maximum reward Q-learning (FMRQ). FMRQ aims to achieve one of the optimal Nash equilibria so as to optimize the performance index in multiagent systems. The frequency of obtaining the highest global immediate reward instead of immediate reward is used as the reinforcement signal. With FMRQ each agent does not need the observation of the other agents' actions and only shares its state and reward at each step. We validate FMRQ through case studies of repeated games: four cases of two-player two-action and one case of three-player two-action. It is demonstrated that FMRQ can converge to one of the optimal Nash equilibria in these cases. Moreover, comparison experiments on tasks with multiple states and finite steps are conducted. One is box-pushing and the other one is distributed sensor network problem. Experimental results show that the proposed algorithm outperforms others with higher performance.
Keyword:
Multiagent reinforcement learning (MARL)
Nash equilibrium
Q-learning
repeated game
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Model Learning and Knowledge Sharing for a Multiagent System With Dyna-Q Learning具有dyna-q学习的多智能体系统的模型学习和知识共享
PREAI
分享收藏分享收藏
A Clustering-Based Graph Laplacian Framework for Value Function Approximation in Reinforcement Learning基于聚类的图拉普拉斯框架，用于强化学习中的值函数逼近
PREAI
分享收藏
查看更多内容