TY - JOUR

T1 - Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

AU - Yasin Yazicioǧlu, A.

AU - Egerstedt, Magnus

AU - Shamma, Jeff S.

N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This work was supported by AFOSR/MURI #FA9550-10-1-0573 and ONR Project #N00014-09-1-0751.

PY - 2015/11/25

Y1 - 2015/11/25

N2 - Multi-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.

AB - Multi-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.

UR - http://hdl.handle.net/10754/622550

UR - http://ieeexplore.ieee.org/document/7337422/

UR - http://www.scopus.com/inward/record.url?scp=84990946960&partnerID=8YFLogxK

U2 - 10.1109/TNSE.2015.2503983

DO - 10.1109/TNSE.2015.2503983

M3 - Article

VL - 2

SP - 139

EP - 151

JO - IEEE Transactions on Network Science and Engineering

JF - IEEE Transactions on Network Science and Engineering

SN - 2327-4697

IS - 4

ER -