Skip navigation
Skip navigation

Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds

Araguesa, Rosario; Shi, Guodong; Dimarogonas, Dimos V; Sagüés, Carlos; Johansson , Karl Henrik; Mezouara, Youcef

Description

The algebraic connectivity of the graph Laplacian plays an essential role in various multi-agent control systems. In many cases a lower bound of this algebraic connectivity is necessary in order to achieve a certain performance. Lately, several methods based on distributed Power Iteration have been proposed for computing the algebraic connectivity of a symmetric Laplacian matrix. However, these methods cannot give any lower bound of the algebraic connectivity and their convergence rates are...[Show more]

CollectionsANU Research Publications
Date published: 2014
Type: Journal article
URI: http://hdl.handle.net/1885/36448
Source: Automatica
DOI: 10.1016/j.automatica.2014.10.051

Download

File Description SizeFormat Image
01_Araguesa_Distributed_algebraic_2014.pdf666.55 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator