arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.03158cs.LGcs.MAcs.RO
收藏

Distributed Multi-agent Meta Learning for Trajectory Design in Wireless Drone Networks

Virginia Tech(弗吉尼亚理工学院);Princeton University(普林斯顿大学);Future Network of Intelligence Institute, Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)未来智联网络研究院);Shenzhen Research Institute of Big Data(深圳大数据研究院);Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳))

Ye Hu, Mingzhe Chen, Walid Saad, H. Vincent Poor, Shuguang Cui

英文摘要:

In this paper, the problem of the trajectory design for a group of energy-constrained drones operating in dynamic wireless network environments is studied. In the considered model, a team of drone base stations (DBSs) is dispatched to cooperatively serve clusters of ground users that have dynamic and unpredictable uplink access demands. In this scenario, the DBSs must cooperatively navigate in the considered area to maximize coverage of the dynamic requests of the ground users. This trajectory design problem is posed as an optimization framework whose goal is to find optimal trajectories that maximize the fraction of users served by all DBSs. To find an optimal solution for this non-convex optimization problem under unpredictable environments, a value decomposition based reinforcement learning (VDRL) solution coupled with a meta-training mechanism is proposed. This algorithm allows the DBSs to dynamically learn their trajectories while generalizing their learning to unseen environments. Analytical results show that, the proposed VD-RL algorithm is guaranteed to converge to a local optimal solution of the non-convex optimization problem. Simulation results show that, even without meta-training, the proposed VD-RL algorithm can achieve a 53.2% improvement of the service coverage and a 30.6% improvement in terms of the convergence speed, compared to baseline multi-agent algorithms. Meanwhile, the use of meta-learning improves the convergence speed of the VD-RL algorithm by up to 53.8% when the DBSs must deal with a previously unseen task.

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

↑