Olfati-Saber, Reza and Murray, Richard M. (2003) Agreement Problems in Networks with Directed Graphs and Switching Topology. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCDSTR:2003.005
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCDSTR:2003.005
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.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Control and Dynamical Systems Technical Reports|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.|
|Deposited By:||Imported from CaltechCDSTR|
|Deposited On:||08 Sep 2003|
|Last Modified:||18 Mar 2015 23:13|
Repository Staff Only: item control page