基于全局连通性图的空中基站快速在线移动优化
Fast Online Movement Optimization of Aerial Base Stations Based on Global Connectivity Map
AI总结:
本文针对动态环境中多空中基站移动优化问题,提出基于全局连通性图(GCM)的快速在线算法,将问题分解为二元整数线性规划子问题并利用投影随机次梯度下降求解,实现了接近最优的覆盖率且显著提升了时间效率。
摘要:
搭载在无人机(UAV)上的空中基站(ABS)能够在多种场景下将无线连接扩展到地面用户(GU)。然而,为了通过联合放置N个覆盖范围有限的ABS来最大化M个GU的覆盖率(CR),这是一个在M和N上具有指数复杂度的NP-hard问题。在信号传播受到建筑物等局部障碍物阻碍的环境中,该问题的复杂性会进一步加剧,而动态的GU位置则使问题更加复杂。针对这些挑战,本文聚焦于多ABS移动问题的优化,旨在改善特定场景环境中移动GU的平均CR。我们的方案包括:1)引入全局连通性图(GCM)的概念,其中包含给定ABS/GU位置对之间的连通性信息;2)将ABS移动问题划分为ABS放置子问题,并基于GCM将每个子问题表述为二元整数线性规划(BILP)问题;3)提出一种快速在线算法,在对偶空间内执行(单遍)投影随机次梯度下降,以快速求解BILP问题并获得近似最优性能。数值结果表明,我们提出的方法实现了接近开源求解器(SCIP)所得上界的高CR性能,且运行时间显著减少。此外,在CR性能和/或时间效率方面,我们的方法也优于文献中的常见基准,如K-means初始化的进化算法或基于深度强化学习(DRL)的方法。
英文摘要:
Aerial base stations (ABSs) mounted on unmanned aerial vehicles (UAVs) are capable of extending wireless connectivity to ground users (GUs) across a variety of scenarios. However, it is an NP-hard problem with exponential complexity in $M$ and $N$, in order to maximize the coverage rate (CR) of $M$ GUs by jointly placing $N$ ABSs with limited coverage range. The complexity of the problem escalates in environments where the signal propagation is obstructed by localized obstacles such as buildings, and is further compounded by the dynamic GU positions. In response to these challenges, this paper focuses on the optimization of a multi-ABS movement problem, aiming to improve the mean CR for mobile GUs within a site-specific environment. Our proposals include 1) introducing the concept of global connectivity map (GCM) which contains the connectivity information between given pairs of ABS/GU locations; 2) partitioning the ABS movement problem into ABS placement sub-problems and formulate each sub-problem into a binary integer linear programming (BILP) problem based on GCM; 3) and proposing a fast online algorithm to execute (one-pass) projected stochastic subgradient descent within the dual space to rapidly solve the BILP problem with near-optimal performance. Numerical results demonstrate that our proposed method achieves a high CR performance close to the upper bound obtained by the open-source solver (SCIP), yet with significantly reduced running time. Moreover, our method also outperforms common benchmarks in the literature such as the K-means initiated evolutionary algorithm or the ones based on deep reinforcement learning (DRL), in terms of CR performance and/or time efficiency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。