Journal Article10.1109/TSG.2018.2833108
Distributed Consensus Based Algorithm for Economic Dispatch in a Microgrid
173
TL;DR: Using multi-parameter perturbation theory and graph theory, the convergence of the algorithm is proved and it is obtained that the algorithm converges to the optimal solution at a rate governed by the second largest eigenvalue of the system matrix.
read more
Abstract: Economic dispatch problem (EDP) is a fundamental optimization problem of power systems. With the penetration of renewable energy sources in microgrids, this paper proposes a distributed algorithm based on consensus theory to solve the EDP with a quadratic cost function. The method takes advantage of the fact that incremental costs need to be equal for all buses at optimal output power values. Thus, the incremental cost of each bus is selected as a consensus variable and the local mismatch between total demand and generation is assigned as a feedback variable to meet demand constraints. Unlike the existing related works, the feedback gains for the feedback variables are different and time-varying. Using multi-parameter perturbation theory and graph theory, the convergence of the algorithm is proved. Furthermore, the upper bounds of the feedback gains are given theoretically, and we obtain that the algorithm converges to the optimal solution at a rate governed by the second largest eigenvalue of the system matrix. Meanwhile, the algorithm is a fully distributed algorithm without a leader or a virtual command node. The simulation results illustrate the effectiveness of the algorithm even though there is a demand change and generator damage. Some simulation results intuitively illustrate how the convergence speed changes with the feedback gains.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Distributed Differentially Private Algorithm for Resource Allocation in Unboundedly Large Settings
Panayiotis Danassis,Aleksei Triastcyn,Boi Faltings +2 more
TL;DR: This paper introduces PALMA, a decentralized, on-device algorithm for resource allocation in unboundedly large settings, providing strong worst-case privacy guarantees and high-quality matchings, outperforming centralized baselines in mobility-on-demand and paper assignment scenarios.
Asynchronous Algorithms for Decentralized Resource Allocation Over Directed Networks
TL;DR: In this paper , the authors considered a class of decentralized resource allocation problems over directed networks, where each node only communicates with its in-neighbors and attempts to minimize its own cost when network-wide resource constraints as well as local capacity limits are satisfied.
A Distributed Dynamical System for Optimal Resource Allocation Over State-Dependent Networks
Xiaoxuan Wang,Shaofu Yang,Zhenyuan Guo,Mengke Lian,Tingwen Huang +4 more
TL;DR: It is shown that the connectivity of communication networks can be preserved under the proposed distributed differentiated projected dynamical system with a state-dependent gain and proved that the system converges to the optimal resource allocation with an $\mathcal {O}(1/t)$ convergence rate.
Autonomous Cooperative Method of Distributed Energy Resources for Integrating Renewable Energy
Jixing Zhou,Haijun Shen,Zhun Zhong,Jianwei Feng,Lianhang Fang,Fen Wang +5 more
TL;DR: This paper proposes an autonomous cooperative method for distributed energy resources to integrate renewable energy, utilizing customer directrix load and coalitions to maximize renewable energy integration, outperforming centralized optimization and independent response.
Disturbance-resilient Distributed Resource Allocation over Stochastic Networks using Uncoordinated Stepsizes
Tie Ding,Shanying Zhu,Cailian Chen,Xinping Guan +3 more
TL;DR: This paper proposes a disturbance-resilient distributed resource allocation algorithm for multi-agent systems over stochastic networks, achieving linear convergence with constant or uncoordinated stepsizes, and demonstrating resilience to disturbances and communication failures.
References
Consensus problems in networks of agents with switching topology and time-delays
TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
•Book
Power Generation, Operation, and Control
Allen J. Wood,Bruce Wollenberg +1 more
- 01 Jan 1984
TL;DR: In this paper, the authors present a graduate-level text in electric power engineering as regards to planning, operating, and controlling large scale power generation and transmission systems, including characteristics of power generation units, transmission losses, generation with limited energy supply, control of generation, and power system security.
9.3K
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Ali Jadbabaie,Jie Lin,A.S. Morse +2 more
TL;DR: A theoretical explanation for the observed behavior of the Vicsek model, which proves to be a graphic example of a switched linear system which is stable, but for which there does not exist a common quadratic Lyapunov function.
Distributed Consensus in Multi-vehicle Cooperative Control
Wei Ren,Randal W. Beard +1 more
- 01 Jan 2008
TL;DR: In this article, the authors present a survey of the use of consensus algorithms in multi-vehicle cooperative control, including single-and double-integrator dynamical systems, rigid-body attitude dynamics, rendezvous and axial alignment, formation control, deep-space formation flying, fire monitoring and surveillance.
3.3K