Controllability of a Class of Swarm Signaling Networks
Lists
Only you see this
Abstract
In this paper, 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 signaling 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.
BibTeX
@misc{sun2022controllability,
author = {Peng Sun and Robert E. Kooij and Roland Bouffanais},
title = {{Controllability of a Class of Swarm Signaling Networks}},
year = {2022},
eprint = {2209.12992},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2209.12992},
}Loading related content...