大规模异构无人机群的协作任务分配:一种分层联盟形成博弈方法

IF 8.9 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yuwen Yan;Wenhao Bi;Gaoyue Ma;An Zhang
{"title":"大规模异构无人机群的协作任务分配:一种分层联盟形成博弈方法","authors":"Yuwen Yan;Wenhao Bi;Gaoyue Ma;An Zhang","doi":"10.1109/JIOT.2025.3562692","DOIUrl":null,"url":null,"abstract":"With the increasing complexity and volume of task demands in high-concurrency IoT applications, autonomous aerial vehicles (AAV) swarm systems must scale up to meet these requirements, inevitably introduces challenges related to computational efficiency and performance, as well as a lack of theoretical analysis on solution convergence and optimality. To address these issues, this article proposes a novel optimization model for coalition formation and a hierarchical task allocation method. The approach combines a semi-centralized clustering with distributed coalition formation scheme, where multidimensional contribution clustering decomposes tasks and platforms for complexity reduction. Moreover, by modeling subcluster allocation as an overlapping coalition formation (OCF) game, our approach integrates marginal utility criteria with search algorithms featuring adaptive resource matching and random exit mechanisms to accelerate the search and avoid suboptimal solutions. Theoretical proof confirms the Nash equilibrium attainment through iterative coalition adjustments while ensuring low complexity. Simulation results show that the method significantly reduces decision-making complexity while ensuring task utility and overall coalition efficiency, demonstrating its effectiveness in AAV swarm-based civilian disaster relief systems.","PeriodicalId":54347,"journal":{"name":"IEEE Internet of Things Journal","volume":"12 14","pages":"27237-27254"},"PeriodicalIF":8.9000,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collaborative Task Allocation for Large-Scale Heterogeneous AAV Swarm: A Hierarchical Coalition Formation Game Method\",\"authors\":\"Yuwen Yan;Wenhao Bi;Gaoyue Ma;An Zhang\",\"doi\":\"10.1109/JIOT.2025.3562692\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increasing complexity and volume of task demands in high-concurrency IoT applications, autonomous aerial vehicles (AAV) swarm systems must scale up to meet these requirements, inevitably introduces challenges related to computational efficiency and performance, as well as a lack of theoretical analysis on solution convergence and optimality. To address these issues, this article proposes a novel optimization model for coalition formation and a hierarchical task allocation method. The approach combines a semi-centralized clustering with distributed coalition formation scheme, where multidimensional contribution clustering decomposes tasks and platforms for complexity reduction. Moreover, by modeling subcluster allocation as an overlapping coalition formation (OCF) game, our approach integrates marginal utility criteria with search algorithms featuring adaptive resource matching and random exit mechanisms to accelerate the search and avoid suboptimal solutions. Theoretical proof confirms the Nash equilibrium attainment through iterative coalition adjustments while ensuring low complexity. Simulation results show that the method significantly reduces decision-making complexity while ensuring task utility and overall coalition efficiency, demonstrating its effectiveness in AAV swarm-based civilian disaster relief systems.\",\"PeriodicalId\":54347,\"journal\":{\"name\":\"IEEE Internet of Things Journal\",\"volume\":\"12 14\",\"pages\":\"27237-27254\"},\"PeriodicalIF\":8.9000,\"publicationDate\":\"2025-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Internet of Things Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10970730/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Internet of Things Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10970730/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

随着高并发物联网应用中任务需求的复杂性和数量的增加,自主飞行器(AAV)群系统必须扩大规模以满足这些要求,这不可避免地带来了与计算效率和性能相关的挑战,以及缺乏对解决方案收敛和最优性的理论分析。为了解决这些问题,本文提出了一种新的联盟形成优化模型和分层任务分配方法。该方法将半集中式聚类与分布式联盟形成方案相结合,其中多维贡献聚类对任务和平台进行分解以降低复杂性。此外,通过将子集群分配建模为重叠联盟形成(OCF)博弈,我们的方法将边际效用标准与具有自适应资源匹配和随机退出机制的搜索算法相结合,以加速搜索并避免次优解。理论证明在保证低复杂度的前提下,通过迭代的联盟调整实现纳什均衡。仿真结果表明,该方法在保证任务效用和整体联盟效率的前提下,显著降低了决策复杂度,证明了该方法在基于AAV群的民用救灾系统中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Collaborative Task Allocation for Large-Scale Heterogeneous AAV Swarm: A Hierarchical Coalition Formation Game Method
With the increasing complexity and volume of task demands in high-concurrency IoT applications, autonomous aerial vehicles (AAV) swarm systems must scale up to meet these requirements, inevitably introduces challenges related to computational efficiency and performance, as well as a lack of theoretical analysis on solution convergence and optimality. To address these issues, this article proposes a novel optimization model for coalition formation and a hierarchical task allocation method. The approach combines a semi-centralized clustering with distributed coalition formation scheme, where multidimensional contribution clustering decomposes tasks and platforms for complexity reduction. Moreover, by modeling subcluster allocation as an overlapping coalition formation (OCF) game, our approach integrates marginal utility criteria with search algorithms featuring adaptive resource matching and random exit mechanisms to accelerate the search and avoid suboptimal solutions. Theoretical proof confirms the Nash equilibrium attainment through iterative coalition adjustments while ensuring low complexity. Simulation results show that the method significantly reduces decision-making complexity while ensuring task utility and overall coalition efficiency, demonstrating its effectiveness in AAV swarm-based civilian disaster relief systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Internet of Things Journal
IEEE Internet of Things Journal Computer Science-Information Systems
CiteScore
17.60
自引率
13.20%
发文量
1982
期刊介绍: The EEE Internet of Things (IoT) Journal publishes articles and review articles covering various aspects of IoT, including IoT system architecture, IoT enabling technologies, IoT communication and networking protocols such as network coding, and IoT services and applications. Topics encompass IoT's impacts on sensor technologies, big data management, and future internet design for applications like smart cities and smart homes. Fields of interest include IoT architecture such as things-centric, data-centric, service-oriented IoT architecture; IoT enabling technologies and systematic integration such as sensor technologies, big sensor data management, and future Internet design for IoT; IoT services, applications, and test-beds such as IoT service middleware, IoT application programming interface (API), IoT application design, and IoT trials/experiments; IoT standardization activities and technology development in different standard development organizations (SDO) such as IEEE, IETF, ITU, 3GPP, ETSI, etc.
×
引用
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学术官方微信