用分簇多智能体算法优化空天地网络中无人机任务调度。
Cluster-Based Multi-Agent Task Scheduling for Space-Air-Ground Integrated Networks
- 将无人机分簇,由簇头统一决策,降低通信开销。
- 系统利润提升至少25%,延迟更低,负载更均衡。
- 适合研究空天地一体化网络与智能调度的读者。
空-天-地一体化网络(SAGIN)是未来网络的关键基础,其中卫星和空中节点协助计算任务卸载。低空经济利用无人机在SAGIN中的灵活性和多功能性,在通信与感知等领域具有巨大发展潜力。然而,有效协调对信息交换与资源分配至关重要。本文提出基于聚类的多智能体深度确定性策略梯度(CMADDPG)算法,解决SAGIN中多无人机协同任务调度问题。该算法通过动态聚类将无人机划分为若干簇,每簇由簇头(CH)无人机管理,实现分布式-集中式控制。簇内无人机将卸载决策交由簇头处理,减少簇内通信成本与决策冲突,提升调度效率。同时,借助多智能体强化学习框架,利用卫星广覆盖特性实现集中训练、分布式执行,通过优化任务卸载决策最大化系统总收益。仿真结果表明,该算法有效优化资源分配,显著降低队列延迟,保持负载均衡,相比现有方法系统利润提升至少25%,展现出良好鲁棒性与场景适应性。
原文摘要 · Abstract (English)
The Space-Air-Ground Integrated Network (SAGIN) framework is a crucial foundation for future networks, where satellites and aerial nodes assist in computational task offloading. The low-altitude economy, leveraging the flexibility and multifunctionality of Unmanned Aerial Vehicles (UAVs) in SAGIN, holds significant potential for development in areas such as communication and sensing. However, effective coordination is needed to streamline information exchange and enable efficient system resource allocation. In this paper, we propose a Clustering-based Multi-agent Deep Deterministic Policy Gradient (CMADDPG) algorithm to address the multi-UAV cooperative task scheduling challenges in SAGIN. The CMADDPG algorithm leverages dynamic UAV clustering to partition UAVs into clusters, each managed by a Cluster Head (CH) UAV, facilitating a distributed-centralized control approach. Within each cluster, UAVs delegate offloading decisions to the CH UAV, reducing intra-cluster communication costs and decision conflicts, thereby enhancing task scheduling efficiency. Additionally, by employing a multi-agent reinforcement learning framework, the algorithm leverages the extensive coverage of satellites to achieve centralized training and distributed execution of multi-agent tasks, while maximizing overall system profit through optimized task offloading decision-making. Simulation results reveal that the CMADDPG algorithm effectively optimizes resource allocation, minimizes queue delays, maintains balanced load distribution, and surpasses existing methods by achieving at least a 25\% improvement in system profit, showcasing its robustness and adaptability across diverse scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。