Improving Generalization of Multi-agent Reinforcement Learning through Domain-Invariant Feature Extraction
Xu YF(徐一凡); Pu ZQ(蒲志强); Cai QA(蔡奇昂); Li FM(李非墨); Chai XH(柴兴华)
2023-09
会议名称International Conference on Artificial Neural Networks
会议日期2023-5
会议地点Greece
摘要

The limited generalization ability of reinforcement learning
constrains its potential applications, particularly in complex scenarios
such as multi-agent systems. To overcome this limitation and enhance
the generalization capability of MARL algorithms, this paper proposes
a three-stage method that integrates domain randomization and domain
adaptation to extract effective features for policy learning. Specifically,
the first stage samples environments provided for training and testing
in the following stages using domain randomization. The second stage
pretrains a domain-invariant feature extractor (DIFE) which employs
cycle consistency to disentangle domain-invariant and domain-specific
features. The third stage utilizes DIFE for policy learning. Experimental
results in MPE tasks demonstrate that our approach yields better performance
and generalization ability. Meanwhile, the features captured by
DIFE are more interpretable for subsequent policy learning in visualization
analysis.

收录类别EI
七大方向——子方向分类多智能体系统
国重实验室规划方向分类多智能体决策
是否有论文关联数据集需要存交
文献类型会议论文
条目标识符http://ir.ia.ac.cn/handle/173211/57458
专题复杂系统认知与决策实验室_飞行器智能技术
作者单位Institute of Automation, Chinese Academy of Sciences
推荐引用方式
GB/T 7714
Xu YF,Pu ZQ,Cai QA,et al. Improving Generalization of Multi-agent Reinforcement Learning through Domain-Invariant Feature Extraction[C],2023.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Improving Generaliza(7610KB)会议论文 开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Xu YF(徐一凡)]的文章
[Pu ZQ(蒲志强)]的文章
[Cai QA(蔡奇昂)]的文章
百度学术
百度学术中相似的文章
[Xu YF(徐一凡)]的文章
[Pu ZQ(蒲志强)]的文章
[Cai QA(蔡奇昂)]的文章
必应学术
必应学术中相似的文章
[Xu YF(徐一凡)]的文章
[Pu ZQ(蒲志强)]的文章
[Cai QA(蔡奇昂)]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Improving Generalization of Multi-agent.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。