Affordable Access

A distributed algorithm for average consensus on strongly connected weighted digraphs

Authors
Journal
Automatica
0005-1098
Publisher
Elsevier
Volume
50
Issue
3
Identifiers
DOI: 10.1016/j.automatica.2013.12.026
Keywords
  • Average Consensus
  • Directed Graphs
  • Broadcast Communication
Disciplines
  • Communication
  • Computer Science

Abstract

Abstract In this work we propose a distributed algorithm to solve the discrete-time average consensus problem on strongly connected weighted digraphs (SCWDs). The key idea is to couple the computation of the average with the estimation of the left eigenvector associated with the zero eigenvalue of the Laplacian matrix according to the protocol described in Qu et al. (2012). The major contribution is the removal of the requirement of the knowledge of the out-neighborhood of an agent, thus paving the way for a simple implementation based on a pure broadcast-based communication scheme.

There are no comments yet on this publication. Be the first to share your thoughts.