用生成式AI增强无人机与地面站协同计算,提升无人船任务执行效率。
Generative AI-Enhanced Cooperative MEC of UAVs and Ground Stations for Unmanned Surface Vehicles
- 融合生成式AI的多智能体强化学习算法,动态应对任务与轨迹不确定性。
- 相比基准方法,总执行时间显著降低,验证了在复杂场景下的优越性。
- 适合研究智能协同计算、无人系统调度的学者和工程师参考。
随着无人水面艇(USVs)部署增多,其在海上搜救等应用中亟需计算支持与覆盖。无人机(UAVs)可提供低成本、灵活的空中服务,地面站(GSs)则具备强大算力,二者协同可帮助USVs应对复杂环境。然而,该协同面临任务不确定性、USV轨迹不确定、异构性及计算资源有限等挑战。为此,本文提出一种基于无人机与地面站协作的鲁棒多接入边缘计算框架,以支持USVs完成计算任务。具体地,构建联合任务卸载与无人机轨迹优化的数学模型,目标是最小化总执行时间,该问题为混合整数非线性规划且属于NP难。为此,提出生成式人工智能增强的异构智能体近端策略优化算法(GAI-HAPPO)。该算法通过引入生成式AI模型增强演员网络对复杂环境的建模能力与高层特征提取能力,从而预测不确定性并适应动态变化;同时,生成式AI稳定了评论家网络,缓解多智能体强化学习的不稳定性。大量仿真结果表明,所提算法优于现有基准方法,凸显其在跨域复杂场景中的潜力。
原文摘要 · Abstract (English)
The increasing deployment of unmanned surface vehicles (USVs) require computational support and coverage in applications such as maritime search and rescue. Unmanned aerial vehicles (UAVs) can offer low-cost, flexible aerial services, and ground stations (GSs) can provide powerful supports, which can cooperate to help the USVs in complex scenarios. However, the collaboration between UAVs and GSs for USVs faces challenges of task uncertainties, USVs trajectory uncertainties, heterogeneities, and limited computational resources. To address these issues, we propose a cooperative UAV and GS based robust multi-access edge computing framework to assist USVs in completing computational tasks. Specifically, we formulate the optimization problem of joint task offloading and UAV trajectory to minimize the total execution time, which is in the form of mixed integer nonlinear programming and NP-hard to tackle. Therefore, we propose the algorithm of generative artificial intelligence-enhanced heterogeneous agent proximal policy optimization (GAI-HAPPO). The proposed algorithm integrates GAI models to enhance the actor network ability to model complex environments and extract high-level features, thereby allowing the algorithm to predict uncertainties and adapt to dynamic conditions. Additionally, GAI stabilizes the critic network, addressing the instability of multi-agent reinforcement learning approaches. Finally, extensive simulations demonstrate that the proposed algorithm outperforms the existing benchmark methods, thus highlighting the potentials in tackling intricate, cross-domain issues in the considered scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。