Premium
Multi‐agent consensus for distributed power dispatch with load balancing
Author(s) -
Hanada Kenta,
Wada Takayuki,
Masubuchi Izumi,
Asai Toru,
Fujisaki Yasumasa
Publication year - 2021
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.2257
Subject(s) - convergence (economics) , graph , computer science , closeness , consensus , laplacian matrix , directed graph , distributed algorithm , multi agent system , mathematical optimization , strongly connected component , mathematics , algorithm , theoretical computer science , distributed computing , artificial intelligence , mathematical analysis , economics , economic growth
A 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.