In this chapter, we address the average-consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, possibly directed, communication topology (digraph). Specifically, we discuss how the nodes can asymptotically obtain the average of their initial values by describing two different types of algorithms: one based on weight adaptation and one based on ratio consensus.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Distributed Average Consensus in Digraphs


    Additional title:

    Lect. Notes Control




    Publication date :

    2014-09-26


    Size :

    8 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Consensus Seeking over Random Digraphs

    Porfiri, Maurizio / Stilwell, Daniel | AIAA | 2006


    AIAA-2006-6204 Consensus Seeking over Random Digraphs

    Porfiri, M. / Stilwell, D. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2006


    Composite Weighted Average Consensus Filtering

    Chen, Hao / Wang, Jianan / Jun, Zhang et al. | IEEE | 2018


    Distributed Strategies for Generating Weight-Balanced and Doubly Stochastic Digraphs

    Gharesifard, B. / Cortes, J. | British Library Online Contents | 2012


    DISTRIBUTED TRAFFIC SAFETY CONSENSUS

    ALVAREZ IGNACIO J / MISOCZKI RAFAEL / MIELE ANDREA | European Patent Office | 2021

    Free access