用生成模型优化无人机群任务分配,降低延迟和能耗
DNN Task Assignment in UAV Networks: A Generative AI Enhanced Multi-Agent Reinforcement Learning Approach
- 融合生成扩散模型与多智能体强化学习,动态生成任务分配方案
- 相比基准方法,路径规划更优,时延、能耗和负载均衡均提升
- 适合需要低延迟响应的无人机物联网应用,如巡检与实时监控
无人飞行器(UAV)具有高机动性和灵活部署能力,广泛应用于物联网(IoT)场景。其在不确定且严苛环境中面临日益复杂的数据处理任务,需依赖深度神经网络(DNN)进行分析,但受限于计算资源。本文提出一种结合多智能体强化学习(MARL)与生成扩散模型(GDM)的联合任务分配方法,旨在减少从任务采集到结果输出的延迟。首先基于目标区域任务规模与最短飞行路径构建约束,采用贪心算法求解子问题,以最小化飞行路径与系统总成本。其次提出新型算法GDM-MADDPG,利用GDM的反向去噪过程替代MADDPG中的策略网络,在动态环境中根据智能体观测生成具体任务分配动作。仿真结果显示,该算法在路径规划、信息年龄(AoI)、能耗及任务负载均衡方面均优于基准方法。
原文摘要 · Abstract (English)
Unmanned Aerial Vehicles (UAVs) possess high mobility and flexible deployment capabilities, prompting the development of UAVs for various application scenarios within the Internet of Things (IoT). The unique capabilities of UAVs give rise to increasingly critical and complex tasks in uncertain and potentially harsh environments. The substantial amount of data generated from these applications necessitates processing and analysis through deep neural networks (DNNs). However, UAVs encounter challenges due to their limited computing resources when managing DNN models. This paper presents a joint approach that combines multiple-agent reinforcement learning (MARL) and generative diffusion models (GDM) for assigning DNN tasks to a UAV swarm, aimed at reducing latency from task capture to result output. To address these challenges, we first consider the task size of the target area to be inspected and the shortest flying path as optimization constraints, employing a greedy algorithm to resolve the subproblem with a focus on minimizing the UAV's flying path and the overall system cost. In the second stage, we introduce a novel DNN task assignment algorithm, termed GDM-MADDPG, which utilizes the reverse denoising process of GDM to replace the actor network in multi-agent deep deterministic policy gradient (MADDPG). This approach generates specific DNN task assignment actions based on agents' observations in a dynamic environment. Simulation results indicate that our algorithm performs favorably compared to benchmarks in terms of path planning, Age of Information (AoI), energy consumption, and task load balancing.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。