CoChat

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

Hu, Ye, Chen, Mingzhe, Saad, Walid, Poor, H. Vincent, Cui, Shuguang · 2021 · IEEE Journal on Selected Areas in Communications

The DOI matches its Crossref record; 32 of the 34 references it cites were found in a registry or an index, and 1 are not checked yet.

Abstract

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 (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 a…

Overview

Integrity signals

Registry

Crossref · 10.1109/jsac.2021.3088689

Cites

32 of 33 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Research works printed but not linked: 1

  1. sunehag, 2017, Value-decomposition networks for cooperative multi-agent learning, arXiv 1706 05296

Cited by

See all 180

Metadata

Authors
Hu, Y., Chen, M., Saad, W., Poor, H. V., & Cui, S.
Affiliations
  • Virginia Tech (US)
  • Princeton University (US)
  • Kyung Hee University (KR)
  • Shenzhen Research Institute of Big Data (CN)
Venue
IEEE Journal on Selected Areas in Communications
Published
2021-10
Volume
39
Issue
10
Pages
3177-3192
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W3172394904
Cited by
152
References
34
Citations by year
2026: 16 · 2025: 29 · 2024: 27 · 2023: 33 · 2022: 32 · 2021: 15
FWCI
13.78
Type
journal article
Language
en
Open access
closed
Locations
IEEE Journal on Selected Areas in Communications (publishedVersion)
Funders
  • National Key Research and Development Program of China (2018YFB1800800l)
  • U.S. National Science Foundation (CNS-1909372, CNS-1836802, CCF-1908308)
  • Special Project for Research and Development in Key areas of Guangdong Province (2018B030338001)
  • Shenzhen Outstanding Talents Training Fund; and the Guangdong Research Project (2017ZT07 × 152)
Topics
  • Physical Sciences › Engineering › Aerospace Engineering › UAV Applications and Optimization
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
Keywords
drone base stations, trajectory design, multi-agent reinforcement learning, value decomposition networks, meta-learning, uplink coverage, non-convex optimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.