A Gated Graph Neural Network Approach to Fast-Convergent Dynamic Average Estimation
Not on the map. Why?
Abstract (arXiv)
Dynamic average estimation is a critical problem in multi-agent systems, enabling agents to collaboratively estimate time-varying signals using only local information exchange. Traditional model-based approaches often face challenges related to convergence speed and sensitivity to network topology changes. This paper introduces a novel learning-based solution leveraging Gated Graph Neural Networks (GGNNs) for fast-convergent dynamic average estimation in a fully distributed manner. Taking advantage of the inherent structure of GGNNs, the proposed method models the estimation process as a distributed autoregressor, ensuring rapid convergence while maintaining stability. We incorporate a regularization term during training to enforce convergence guarantees and introduce an encoding-decoding mechanism to reduce communication overhead without sacrificing accuracy compared to standard GGNNs. Extensive numerical experiments demonstrate that our approach significantly outperforms conventional model-based estimators in terms of both convergence speed and precision, making it a promising alternative for multi-agent applications that require dynamic average estimation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 29 references that are in the map. First posted on arXiv 18 Jun 2026.
Builds on
5 of 29 references.
References · 5
- 2020Gated Graph Recurrent Neural Networkscited by 57
- 2020Message-Aware Graph Attention Networks for Large-Scale Multi-Robot Path Planningcited by 41
- 2020Multi-Robot Coverage and Exploration using Spatial Graph Neural Networkscited by 18
- 2020Graph Neural Networks for Decentralized Controllerscited by 14
- 2018Tutorial on dynamic average consensus: the problem, its applications, and the algorithmscited by 8
Built on by
Not cited yet.