Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 1, 2003 | public
Report Open

Agreement Problems in Networks with Directed Graphs and Switching Topology

Abstract

In this paper, we provide tools for convergence and performance analysis of an agreement protocol for a network of integrator agents with directed information flow. Moreover, we analyze algorithmic robustness of this consensus protocol for the case of a network with mobile nodes and switching topology. We establish a connection between the Fiedler eigenvalue of the graph Laplacian and the performance of this agreement protocol. We demostrate that a class of directed graphs, called balanced graphs, have a crucial role in solving average-consensus problems. Based on the properties of balanced graphs, a group disagreement function (i.e. Lyapunov function) is proposed for convergence analysis of this agreement protocol for networks with directed graphs. This group disagreement function is later used for convergence analysis for the agreement problem in networks with switching topology. We provide simulation results that are consistent with our theoretical results and demonstrate the effectiveness of the proposed analytical tools.

Files

cdstr-ros-03-005.pdf
Files (217.0 kB)
Name Size Download all
md5:f5bf655a5061f81f6b0406f8b1655058
217.0 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023