A Network Connectivity-Aware Reinforcement Learning Method for Task Exploration and Allocation

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xingyu He;Xiankai Li;Guisong Yang;Shi Chang;Jiehan Zhou
{"title":"A Network Connectivity-Aware Reinforcement Learning Method for Task Exploration and Allocation","authors":"Xingyu He;Xiankai Li;Guisong Yang;Shi Chang;Jiehan Zhou","doi":"10.1109/TNSM.2024.3514894","DOIUrl":null,"url":null,"abstract":"For a limited scale self-organized multi-agent system operating in environments with unknown task distributions, one challenge is to reduce the task response time via efficiently combining task exploration and allocation, another challenge is to improve the task completion rate via unlocking the potential of network cooperation in task allocation. However, in the existing studies, task allocation is generally regarded as an independent issue for known task distribution environments, rarely combined with task exploration, also hardly solving the conflict between the multi-hop network cooperation and mobility flexibility of agents. In view of this, this paper proposes a network connectivity-aware deep reinforcement learning method for task exploration and allocation in limited scale multi-agent systems (NCADRL4TEA). This method divides the task environment into regions and integrates task exploration with task allocation via two policies: a leaving policy to guide global task exploration among regions according to the distribution of agents and tasks, and a stay policy to guide local task allocation within each region according to the multi-hop network cooperation performance between agents. Further, in the stay policy, a network connectivity-aware task allocation optimization model is provided, which leads agents in the same region to cooperate with each other via multi-hop intermittent network connectivity and flexibly adjust their locations until the optimal multi-hop network cooperation performance is achieved. The experimental results verify that NCADRL4TEA can reduce the task response time in combination of task exploration and allocation, and improve the task completion rate in network cooperation.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1160-1173"},"PeriodicalIF":4.7000,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10806843/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

For a limited scale self-organized multi-agent system operating in environments with unknown task distributions, one challenge is to reduce the task response time via efficiently combining task exploration and allocation, another challenge is to improve the task completion rate via unlocking the potential of network cooperation in task allocation. However, in the existing studies, task allocation is generally regarded as an independent issue for known task distribution environments, rarely combined with task exploration, also hardly solving the conflict between the multi-hop network cooperation and mobility flexibility of agents. In view of this, this paper proposes a network connectivity-aware deep reinforcement learning method for task exploration and allocation in limited scale multi-agent systems (NCADRL4TEA). This method divides the task environment into regions and integrates task exploration with task allocation via two policies: a leaving policy to guide global task exploration among regions according to the distribution of agents and tasks, and a stay policy to guide local task allocation within each region according to the multi-hop network cooperation performance between agents. Further, in the stay policy, a network connectivity-aware task allocation optimization model is provided, which leads agents in the same region to cooperate with each other via multi-hop intermittent network connectivity and flexibly adjust their locations until the optimal multi-hop network cooperation performance is achieved. The experimental results verify that NCADRL4TEA can reduce the task response time in combination of task exploration and allocation, and improve the task completion rate in network cooperation.
用于任务探索和分配的网络连接感知强化学习方法
对于在未知任务分布环境下运行的有限规模自组织多智能体系统,如何有效地将任务探索与任务分配相结合来缩短任务响应时间是一个挑战,如何通过释放任务分配中网络协作的潜力来提高任务完成率是另一个挑战。然而,在现有的研究中,任务分配通常被认为是已知任务分布环境下的一个独立问题,很少与任务探索相结合,也很难解决多跳网络协作与智能体移动灵活性之间的冲突。鉴于此,本文提出了一种用于有限规模多智能体系统(NCADRL4TEA)任务探索与分配的网络连接感知深度强化学习方法。该方法将任务环境划分为多个区域,并通过两个策略将任务探索与任务分配结合起来:一个是根据agent和任务的分布情况引导区域间全局任务探索的离开策略,一个是根据agent间多跳网络协作性能引导区域内局部任务分配的停留策略。在停留策略中,提出了网络连通性感知的任务分配优化模型,使得同一区域内的agent通过多跳间歇网络连通性相互协作,并灵活调整位置,直至达到最优的多跳网络合作性能。实验结果验证了NCADRL4TEA可以将任务探索和任务分配相结合,缩短任务响应时间,提高网络协作中的任务完成率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信