返回
Decentralized graph-based multi-agent reinforcement learning using reward machines
DOI:10.1016/j.neucom.2023.126974.png)
摘要
En 中文
In multi-agent reinforcement learning (MARL), it is challenging for a collection of agents to learn complex temporally extended tasks. The difficulties lie in computational complexity and how to learn the high-level ideas behind reward functions. We study the graph-based Markov Decision Process (MDP), where the dynamics of neighboring agents are coupled. To learn complex temporally extended tasks, we use a reward machine (RM) to encode each agent's task and expose reward function internal structures. RM has the capacity to describe high-level knowledge and encode non-Markovian reward functions. We propose a decentralized learning algorithm to tackle computational complexity, called decentralized graph-based reinforcement learning using reward machines (DGRM), that equips each agent with a localized policy, allowing agents to make decisions independently based on the information available to the agents. DGRM uses the actor-critic structure, and we introduce the tabular Q-function for discrete state problems. We show that the dependency of the Q-function on other agents decreases exponentially as the distance between them increases. To further improve efficiency, we also propose the deep DGRM algorithm, using deep neural networks to approximate the Q-function and policy function to solve large-scale or continuous state problems. The effectiveness of the proposed DGRM algorithm is evaluated by three case studies, two wireless communication case studies with independent and dependent reward functions, respectively, and COVID-19 pandemic mitigation. Experimental results show that local information is sufficient for DGRM and agents can accomplish complex tasks with the help of RM. DGRM improves the global accumulated reward by 119% compared to the baseline in the case of COVID-19 pandemic mitigation.
Keyword:
Decentralized
Multi-agent
Reinforcement learning
Reward machine
Efficiency
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Maximum likelihood estimation of a log-concave density and its distribution function: Basic properties and uniform consistency
Bernoulli
IF0
Electrochemical Aptasensor Based on Topological Material Bi2Se3 Sheets for Sensitive Detection of Interferon-γ基于拓扑材料Bi₂Se₃片状结构的电化学适体传感器用于干扰素-γ的敏感检测
Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning在mdp和半mdp之间: 强化学习中的时间抽象框架
Electrical Impedance Correlated to Flow Rate in Elastomeric Valves: An Analog Material Memory弹性阀门中与流量相关的电阻抗:一种模拟材料记忆

