检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Zheyuan Cheng Mo-Yuen Chow
机构地区:[1]IEEE [2]Department of Electrical and Computer Engineering,North Carolina State University
出 处:《Journal of Modern Power Systems and Clean Energy》2021年第6期1414-1423,共10页现代电力系统与清洁能源学报(英文)
基 金:supported by the National Science Foundation (No. CNS-1505633)。
摘 要:We propose a dual decomposition based algorithm that solves the AC optimal power flow(ACOPF) problem in the radial distribution systems and microgrids in a collaborative and distributed manner. The proposed algorithm adopts the second-order cone program(SOCP) relaxed branch flow ACOPF model. In the proposed algorithm, bus-level agents collaboratively solve the global ACOPF problem by iteratively sharing partial variables with its 1-hop neighbors as well as carrying out local scalar computations that are derived using augmented Lagrangian and primal-dual subgradient methods. We also propose two distributed computing platforms, i. e., high-performance computing(HPC) based platform and hardware-in-theloop(HIL) testbed, to validate and evaluate the proposed algorithm. The computation and communication performances of the proposed algorithm are quantified and analyzed on typical IEEE test systems. Experimental results indicate that the proposed algorithm can be executed on a fully distributed computing structure and yields accurate ACOPF solution. Besides, the proposed algorithm has a low communication overhead.
关 键 词:Distributed convex optimization distributed en-ergy management system optimal power flow primal-dual de-composition
分 类 号:TM744[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.107.132