A Distributed Algorithm For Average Consensus On Strongly Connected Weighted Digraphs In Continuous-Time Conditions

In this work we propose a distributed algorithm to solve the continuous-time average consensus problem on strongly connected weighted digraphs(SCWDs). It bases on the thing coupling the computation of the average with the estimation of the left eigenvector associated with the zero eigenvalue of the Laplacian matrix.It solves continuous-time average consensus problem on unbalanced strongly connected weighted digraphs;Its another charactor is the removal of the requirement of the knowledge of the out-neighborhood of an agent.The paper uses some examples of simulation to verify its conclusion.