A Finite-time Distributed Protocol for Link Prediction in Networked Multi-Agent Systems
Martina Lippi, Matteo Santilli, Gabriele Oliva, Andrea Gasparri · 2021 60th IEEE Conference on Decision and Control (CDC) · 2021
In this paper we address the finite-time distributed link prediction problem in networked multi-agent systems which consists in estimating the likelihood of existence of neighboring links in the network, exploiting only local information. Notably, this setting extends the framework introduced by Pech et al., which considered a complete network topology and was based on a centralized architecture, to the case of sparse graphs and distributed computation. Briefly, first we derive an optimality condition for the problem and then we develop a distributed protocol which drives the agents to satisfy in finite-time the optimality condition by relying on a state-of-the-art distributed k-hop observer. Numerical simulations demonstrate the effectiveness of the proposed distributed protocol.