Economic dispatch of multi-agent network systems based on distributed finite-step consensus algorithm

In this paper, the economic dispatch problem of multi-agent network systems is investigated based on distributed finite-step consensus iteration algorithm. In the proposed consensus strategy, the finite iteration steps can be decided based on the numbers of distinct nonzero eigenvalues of constructed Laplacian matrix, and different network topologies own the same results once given the same initial values. Besides, the power constraints of each generator node are considered to ensure the demand-supply balance of the whole multi-agents network systems. Finally, several case studies with different multi-agents network topologies are provided to verify the validity and correctness of the proposed iteration algorithm.