mlsanityData to 14 Oct 2026

Resilient UAV Swarm Communications with Graph Convolutional Neural Network

arXiv 2106.16048 ↗First posted 30 Jun 2021eess.SP cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

In this paper, we study the self-healing problem of unmanned aerial vehicle (UAV) swarm network (USNET) that is required to quickly rebuild the communication connectivity under unpredictable external disruptions (UEDs). Firstly, to cope with the one-off UEDs, we propose a graph convolutional neural network (GCN) and find the recovery topology of the USNET in an on-line manner. Secondly, to cope with general UEDs, we develop a GCN based trajectory planning algorithm that can make UAVs rebuild the communication connectivity during the self-healing process. We also design a meta learning scheme to facilitate the on-line executions of the GCN. Numerical results show that the proposed algorithms can rebuild the communication connectivity of the USNET more quickly than the existing algorithms under both one-off UEDs and general UEDs. The simulation results also show that the meta learning scheme can not only enhance the performance of the GCN but also reduce the time complexity of the on-line executions.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 6 of its 41 references that are in the map. First posted on arXiv 30 Jun 2021.

Builds on

6 of 41 references.

References · 6

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  3. 2014DeepWalk: Online Learning of Social Representationscited by 1,547
  4. 2019Simplifying Graph Convolutional Networkscited by 1,477
  5. 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
  6. 2018Unmanned Aerial Vehicles: A Survey on Civil Applications and Key Research Challengescited by 54

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 1.

3 papers.