Controllability of a class of swarm signalling networks
P. Sun (TU Delft - Quantum & Computer Engineering, TU Delft - Network Architectures and Services)
R.E. Kooij (TU Delft - Quantum & Computer Engineering, TU Delft - BUS/TNO STAFF)
Roland Bouffanais (University of Ottawa)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
In this article, we propose closed-form analytical expressions to determine the minimum number of driver nodes that is needed to control a specific class of networks. We consider swarm signalling networks with regular out-degree distribution where a fraction $p$ of the links is unavailable. We further apply our method to networks with bi-modal out-degree distributions. Our approximations are validated through intensive simulations. Results show that our approximations have high accuracy when compared with simulation results for both types of out-degree distribution.