Hybrid Centralized-Decentralized Economic Dispatch Based on a Distributed Finite-Step Consensus Algorithm with Divided Regional Incremental Costs

The economic dispatch problem of power systems, which is typically based on multi-agent networks, often necessitates conditions like full graph connectivity. However, as the scale of power systems expands, maintaining full graph connectivity in communication systems could result in increased costs and communication burdens. Consequently, this paper investigates a distributed finite-step c o nsensus m e thod t h at incorporates geographical region division, aiming to achieve economical power allocation without the need for full graph connectivity. In this method, we initially derive a Laplace matrix from the distributed topology of generators in multi-agent power systems. Subsequently, we construct another Laplace matrix by geographically dividing regions, thereby illustrating the communication relationships between these regions. Subsequently, we calculate the incremental cost of each region, taking into account the power constraints of the generators. Moreover, to expedite convergence, we employ a distributed finite-step c o nsensus algorithm to address the economic dispatch problem, leveraging the divided regional incremental costs. Finally, we validate the effectiveness and accuracy of the proposed method through results on various multi-agent topologies and comparisons with other iterative algorithms.