Skip to main content

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

Author(s): Hu, Ye; Chen, Mingzhe; Saad, Walid; Poor, H Vincent; Cui, Shuguang

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr14b2x507
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHu, Ye-
dc.contributor.authorChen, Mingzhe-
dc.contributor.authorSaad, Walid-
dc.contributor.authorPoor, H Vincent-
dc.contributor.authorCui, Shuguang-
dc.date.accessioned2024-02-04T02:00:59Z-
dc.date.available2024-02-04T02:00:59Z-
dc.date.issued2021-06-16en_US
dc.identifier.citationHu, Ye, Chen, Mingzhe, Saad, Walid, Poor, H Vincent, Cui, Shuguang. (2021). Distributed Multi-Agent Meta Learning for Trajectory Design in Wireless Drone Networks. IEEE Journal on Selected Areas in Communications, 39 (10), 3177 - 3192. doi:10.1109/jsac.2021.3088689en_US
dc.identifier.issn0733-8716-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr14b2x507-
dc.description.abstractIn 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 (VD-RL) 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 locally 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 the meta-training mechanism improves the convergence speed of the VD-RL algorithm by up to 53.8% when the DBSs must deal with a previously unseen task.en_US
dc.format.extent3177 - 3192en_US
dc.language.isoen_USen_US
dc.relation.ispartofIEEE Journal on Selected Areas in Communicationsen_US
dc.rightsAuthor's manuscripten_US
dc.titleDistributed Multi-Agent Meta Learning for Trajectory Design in Wireless Drone Networksen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1109/jsac.2021.3088689-
dc.identifier.eissn1558-0008-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
2012.03158.pdf1.47 MBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.