• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

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

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Yasin Yazicioǧlu, A.
    Egerstedt, Magnus
    Shamma, Jeff S. cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Electrical Engineering Program
    Date
    2015-11-25
    Online Publication Date
    2015-11-25
    Print Publication Date
    2015-10-01
    Permanent link to this record
    http://hdl.handle.net/10754/622550
    
    Metadata
    Show full item record
    Abstract
    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.
    Citation
    Yazicioglu 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.
    Sponsors
    This work was supported by AFOSR/MURI #FA9550-10-1-0573 and ONR Project #N00014-09-1-0751.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Transactions on Network Science and Engineering
    DOI
    10.1109/TNSE.2015.2503983
    arXiv
    1503.08131
    Additional Links
    http://ieeexplore.ieee.org/document/7337422/
    ae974a485f413a2113503eed53cd6c53
    10.1109/TNSE.2015.2503983
    Scopus Count
    Collections
    Articles; Electrical and Computer Engineering Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.