Abstract
AbstractA weighted averaging consensus algorithm over a noisy network is considered for a distributed power dispatch with load balancing. The availability of the communication among dispatching agents is represented as a network that is assumed to be a directed, balanced, and a weakly connected graph with no self loop. A simple representation of the consensus algorithm is given by using its graph Laplacian. The convergence analysis of the algorithm reveals an explicit relation between the number of iterations and the closeness of the agreement in terms of the characteristic values of the graph Laplacian, which gives a stopping rule for the consensus algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
