电力系统及其自动化学报2025，Vol.37Issue(9)：24-33,10.DOI:10.19635/j.cnki.csu-epsa.001661
考虑网络约束可行集合表征的虚拟电厂调度指令分解
Decomposition of Virtual Power Plant Dispatching Instructions Considering Feasible Set Representation of Network Constraints
葛少云 1程汉桐 1刘洪1
作者信息
- 1. 智能电网教育部重点实验室(天津大学),天津 300072
- 折叠
摘要
Abstract
Aimed at the problem that the existing resource dispatching instruction decomposition of virtual power plants(VPPs)is difficult to strike a balance between network security and the interests of multiple agents in an environment of limited network information,a VPP dispatching instruction decomposition method considering the representation of feasible sets of network constraints is proposed.First,a two-stage instruction decomposition framework of"VPP-prosum-er-distribution network operator"is constructed.Second,a representation method for the feasible solution set of network constraints based on the vertex projection of the feasible domain is put forward,so as to describe all the prosumer dis-patching schemes that satisfy the network constraints under limited information.On this basis,a VPP-prosumer master-slave game model based on Wasserstein distance-based distributionally robust chance constraints is built,which is fur-ther transformed into a solvable single-layer mathematical programming problem by applying the duality theory and the KKT condition.Experimental results show that with the consideration of network security constraints,the dispatching cost of the VPP increases by 15.8%,but the voltage at all nodes and the line power remain within the security limits.The proposed method can effectively improve the economy and feasibility of the decomposition of VPP dispatching in-structions while ensuring the network security.关键词
指令分解/网络约束/顶点投影/主从博弈/分布鲁棒优化Key words
instruction decomposition/network constraint/vertex projection/master-slave game/distributionally ro-bust optimization分类
信息技术与安全科学引用本文复制引用
葛少云,程汉桐,刘洪..考虑网络约束可行集合表征的虚拟电厂调度指令分解[J].电力系统及其自动化学报,2025,37(9):24-33,10.
