arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.06010cs.NIcs.SYeess.SY
收藏

当学习遇上动力学:基于无人机的通信网络中的分布式用户连接最大化

When Learning Meets Dynamics: Distributed User Connectivity Maximization in UAV-Based Communication Networks

Bowei Li, Saugat Tripathi, Salman Hosain, Ran Zhang, Jiang, Xie, Miao Wang

AI总结:

针对无人机通信网络中用户连接最大化的动态分布式优化问题,提出基于MA-DQL的DUCM-1/DUCM-2算法,验证信息交换设计的收敛优势及应对无人机进出的鲁棒性。

摘要:

对基于无人机(UAV)的通信网络(UCN)进行分布式管理已吸引越来越多的研究关注。在本工作中,我们研究UCN中的一个分布式用户连接最大化问题。该工作的特点是对分布式迭代过程中不同层级的信息交换进行横向研究,并考虑无人机集合和用户分布中的动力学,而这些在现有工作中尚未得到很好解决。具体而言,所研究的问题首先被表述为一个时间耦合的混合整数非凸优化问题。为更快确定用户连接,提出了一种启发式两阶段无人机-用户关联策略。为以可扩展方式应对该NP难问题,在多智能体深度Q学习(MA-DQL)框架下提出了分布式用户连接最大化算法1(DUCM-1)。DUCM-1强调设计不同的信息交换层级,并评估它们在静态和动态用户分布下如何影响学习收敛。为顺应无人机动力学,开发了DUCM-2算法,该算法致力于在所考虑的时间范围内自主处理无人机的任意退出和加入。开展了大量仿真:i)得出结论:交换状态信息并配合精心设计的特定任务奖励函数可产生最佳收敛性能;ii)展示DUCM-2针对动力学的有效性和鲁棒性。

英文摘要:

Distributed management over Unmanned Aerial Vehicle (UAV) based communication networks (UCNs) has attracted increasing research attention. In this work, we study a distributed user connectivity maximization problem in a UCN. The work features a horizontal study over different levels of information exchange during the distributed iteration and a consideration of dynamics in UAV set and user distribution, which are not well addressed in the existing works. Specifically, the studied problem is first formulated into a time-coupled mixed-integer non-convex optimization problem. A heuristic two-stage UAV-user association policy is proposed to faster determine the user connectivity. To tackle the NP-hard problem in scalable manner, the distributed user connectivity maximization algorithm 1 (DUCM-1) is proposed under the multi-agent deep Q learning (MA-DQL) framework. DUCM-1 emphasizes on designing different information exchange levels and evaluating how they impact the learning convergence with stationary and dynamic user distribution. To comply with the UAV dynamics, DUCM-2 algorithm is developed which is devoted to autonomously handling arbitrary quit's and join-in's of UAVs in a considered time horizon. Extensive simulations are conducted i) to conclude that exchanging state information with a deliberated task-specific reward function design yields the best convergence performance, and ii) to show the efficacy and robustness of DUCM-2 against the dynamics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑