mlsanityData to 7 Oct 2026

Learning Optimal Topology for Ad-hoc Robot Networks

arXiv 2201.12900 ↗First posted 30 Jan 2022cs.RO cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we synthesize a data-driven method to predict the optimal topology of an ad-hoc robot network. This problem is technically a multi-task classification problem. However, we divide it into a class of multi-class classification problems that can be more efficiently solved. For this purpose, we first compose an algorithm to create ground-truth optimal topologies associated with various configurations of a robot network. This algorithm incorporates a complex collection of optimality criteria that our learning model successfully manages to learn. This model is an stacked ensemble whose output is the topology prediction for a particular robot. Each stacked ensemble instance constitutes three low-level estimators whose outputs will be aggregated by a high-level boosting blender. Applying our model to a network of 10 robots displays over 80% accuracy in the prediction of optimal topologies corresponding to various configurations of the cited network.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 24 references that are in the map. First posted on arXiv 30 Jan 2022.

Builds on

4 of 24 references.

References · 4

  1. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
  2. 2020GPT-GNN: Generative Pre-Training of Graph Neural Networkscited by 302
  3. 2020Learning Graph Normalization for Graph Neural Networkscited by 16
  4. 2020Data-Driven Convergence Prediction of Astrobots Swarmscited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.