Controllability of a Class of Swarm Signaling Networks

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.

References in corpus (12)

• The structure and function of complex networks
• Exact Controllability of Complex Networks
• Controlling edge dynamics in complex networks
• Spectrum of Controlling and Observing Complex Networks
• Nodal dynamics, not degree distributions, determine the structural controllability of complex networks
• Emergence of bimodality in controlling complex networks
• Optimal Network Topology for Effective Collective Response
• Resilience and Controllability of Dynamic Collective Behaviors
• Towards Optimal Robustness of Network Controllability: An Empirical Necessary Condition
• Decentralized Multi-Floor Exploration by a Swarm of Miniature Robots Teaming with Wall-Climbing Units
• The evolution of network controllability in growing networks
• Controllability of a swarm of topologically interacting autonomous agents