A fast consensus-based distributed economic dispatch algorithm
WANG Yi-nan
SHI Xia-sheng
LIN Zhi-yun
Abstract:Along with the implementation of the"double carbon"goal,the proportion of new energy power generation units in the power system has gradually increased.Distributed smart grids achieve coordinated operation between source,grid,load,storage,and charging by integrating intelligent sensing,communication,decision-making,and control tech-niques.This will form a more efficient,stable,and reliable power system.Under the new power system,economic dispatch problems show strong distributed characteristics.Distributed economic dispatch seeks to balance supply and demand con-straints,and distribute power by facilitating information exchange among power generation units.It focuses on achieving a cost-efficient allocation of power generation under specified constraints.This paper employs a precise first-order con-sensus tracking method with momentum acceleration to quickly obtain dual variables for the equality constraints.It then utilizes projection operators for mapping these dual variables to power allocation to attain the lowest power generation cost-s while adhering to system coupling constraints and local inequality restrictions.Convex optimization theory and matrix contraction mapping are adopted to demonstrate the convergence of the proposed algorithm.Unlike existing methods,our developed approach requires each agent to exchange only a single dual variable with its neighboring agents,and moreover,the choice of control parameter depends solely on the strongly convex coefficient.Two simulation scenarios are presented to validate the efficiency and convergence rate of the algorithm developed in this study.
Keywords:consensusmomentum accelerationeconomic dispatchcoupled constraint
Publication Date:2025-10-30
Online Publishing Date:2025-11-13(First online date of this platform, not the publication date of the document)
Pages:10( 2028-2037 )
Control Theory & Applications

Control Theory & Applications

ISTICPKUEICSCD
ISSN:1000-8152
Year, Vol.(Issue):2025,42(10)