log in  |  register  |  feedback?  |  help  |  web accessibility
MS Defense: Distributed Swarm Formation Recognition via Local Features and Gossip-Averaged Graph Neural Networks
Samuel Badalov
IRB-5105
Wednesday, April 8, 2026, 12:00-1:30 pm
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

Distributed swarm formation recognition requires each robot to independently classify the global formation using only local peer-to-peer communication, without access to global position information or a centralized coordinator. We present a fully distributed pipeline in which each robot computes a local feature vector from its one-hop communication neighborhood, passes it through a shared-weight graph neural network, and accumulates a final embedding through fixed-round gossip averaging. We evaluate three feature vector representations across three communication radii. Results demonstrate that structural features inspired by graphlets outperform distance features at sparse connectivity, while distance features dominate at high connectivity. Their concatenated feature vector performs well at all stages, demonstrating their successes as complementary. To our knowledge this is the first fully distributed formation classification problem of such manner.

Bio

Samuel Badalov is a BS/MS student researching graph neural networks in multi-agent systems.

 

Examining Committee Chair:

Dr. Michael W. Otte

Members:

Dr. Aravind Srinivasan

Dr. David Mount

This talk is organized by Migo Gui