SeqDQN:基于严格期限的Uplink URLLC的多智能体深度强化学习

Benoît-Marie Robaglia, M. Coupechoux, D. Tsilimantos, Apostolos Destounis
{"title":"SeqDQN:基于严格期限的Uplink URLLC的多智能体深度强化学习","authors":"Benoît-Marie Robaglia, M. Coupechoux, D. Tsilimantos, Apostolos Destounis","doi":"10.1109/EuCNC/6GSummit58263.2023.10188325","DOIUrl":null,"url":null,"abstract":"Recent studies suggest that Multi-Agent Reinforcement Learning (MARL) can be a promising approach to tackle wireless telecommunication problems and Multiple Access (MA) in particular. The most relevant MARL algorithms for distributed MA are those with “decentralized execution”, where an agent's actions are only functions of their own local observation history and agents cannot exchange any information. Centralized- Training-Decentralized-Execution (CTDE) and Independent Learning (IL) are the two main families in this category. However, while the former suffers from high communication overhead during the centralized training, the latter suffers from various theoretical shortcomings. In this paper, we first study the performance of these two MARL frameworks in the context of Ultra Reliable Low Latency Communication (URLLC), where MA is constrained by strict deadlines. Second, we propose a new distributed MARL framework, namely SeqDQN, leveraging the constraints of our URLLC problem to train agents in a more efficient way. We demonstrate that not only does our solution outperform the traditional random access baselines, but it also outperforms state-of-the-art MARL algorithms in terms of performance and convergence time.","PeriodicalId":65870,"journal":{"name":"公共管理高层论坛","volume":"31 1","pages":"623-628"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SeqDQN: Multi-Agent Deep Reinforcement Learning for Uplink URLLC with Strict Deadlines\",\"authors\":\"Benoît-Marie Robaglia, M. Coupechoux, D. Tsilimantos, Apostolos Destounis\",\"doi\":\"10.1109/EuCNC/6GSummit58263.2023.10188325\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent studies suggest that Multi-Agent Reinforcement Learning (MARL) can be a promising approach to tackle wireless telecommunication problems and Multiple Access (MA) in particular. The most relevant MARL algorithms for distributed MA are those with “decentralized execution”, where an agent's actions are only functions of their own local observation history and agents cannot exchange any information. Centralized- Training-Decentralized-Execution (CTDE) and Independent Learning (IL) are the two main families in this category. However, while the former suffers from high communication overhead during the centralized training, the latter suffers from various theoretical shortcomings. In this paper, we first study the performance of these two MARL frameworks in the context of Ultra Reliable Low Latency Communication (URLLC), where MA is constrained by strict deadlines. Second, we propose a new distributed MARL framework, namely SeqDQN, leveraging the constraints of our URLLC problem to train agents in a more efficient way. We demonstrate that not only does our solution outperform the traditional random access baselines, but it also outperforms state-of-the-art MARL algorithms in terms of performance and convergence time.\",\"PeriodicalId\":65870,\"journal\":{\"name\":\"公共管理高层论坛\",\"volume\":\"31 1\",\"pages\":\"623-628\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"公共管理高层论坛\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://doi.org/10.1109/EuCNC/6GSummit58263.2023.10188325\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"公共管理高层论坛","FirstCategoryId":"96","ListUrlMain":"https://doi.org/10.1109/EuCNC/6GSummit58263.2023.10188325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最近的研究表明,多智能体强化学习(MARL)可以成为解决无线通信问题特别是多址(MA)的一种有前途的方法。与分布式MA最相关的MARL算法是那些具有“分散执行”的算法,其中代理的行为仅是其本地观察历史的函数,并且代理不能交换任何信息。集中-训练-分散-执行(CTDE)和独立学习(IL)是这一类别中的两个主要家族。然而,前者在集中训练过程中存在较高的通信开销,而后者则存在各种理论缺陷。在本文中,我们首先研究了这两个MARL框架在超可靠低延迟通信(URLLC)环境下的性能,其中MA受到严格期限的约束。其次,我们提出了一个新的分布式MARL框架,即SeqDQN,利用我们的URLLC问题的约束以更有效的方式训练代理。我们证明,我们的解决方案不仅优于传统的随机访问基线,而且在性能和收敛时间方面也优于最先进的MARL算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SeqDQN: Multi-Agent Deep Reinforcement Learning for Uplink URLLC with Strict Deadlines
Recent studies suggest that Multi-Agent Reinforcement Learning (MARL) can be a promising approach to tackle wireless telecommunication problems and Multiple Access (MA) in particular. The most relevant MARL algorithms for distributed MA are those with “decentralized execution”, where an agent's actions are only functions of their own local observation history and agents cannot exchange any information. Centralized- Training-Decentralized-Execution (CTDE) and Independent Learning (IL) are the two main families in this category. However, while the former suffers from high communication overhead during the centralized training, the latter suffers from various theoretical shortcomings. In this paper, we first study the performance of these two MARL frameworks in the context of Ultra Reliable Low Latency Communication (URLLC), where MA is constrained by strict deadlines. Second, we propose a new distributed MARL framework, namely SeqDQN, leveraging the constraints of our URLLC problem to train agents in a more efficient way. We demonstrate that not only does our solution outperform the traditional random access baselines, but it also outperforms state-of-the-art MARL algorithms in terms of performance and convergence time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
385
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信