Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Online Publication Date2015-11-25
Print Publication Date2015-10-01
Permanent link to this recordhttp://hdl.handle.net/10754/622550
MetadataShow full item record
AbstractMulti-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.
CitationYazicioglu AY, Egerstedt M, Shamma JS (2015) Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs. IEEE Transactions on Network Science and Engineering 2: 139–151. Available: http://dx.doi.org/10.1109/TNSE.2015.2503983.
SponsorsThis work was supported by AFOSR/MURI #FA9550-10-1-0573 and ONR Project #N00014-09-1-0751.