A branch-decomposition approach to power network design
A branch-decomposition approach to power network design
复制标题
电力网络设计的分支分解方法
DOI：
10.1109/acc.2016.7526690
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
K. C. Sou
中科院分区：
文献类型：
--
作者：
K. C. Sou
本文提出了一种方法来解决组合电力网络设计问题，如相量测量单元（PMU）的位置和保护分配免受网络物理攻击。该方法通过求解电力网络图上的支配集问题来解决设计问题。结合分支分解和动态规划程序来解决控制集问题。相反，标准的整数规划和启发式/进化方法的电力网络设计，所提出的方法是准确的，只需要多项式计算时间，如果图是平面的，有小的分支宽度。一个平面化技术探讨了问题的实例与非平面图。本文通过对基准电网的案例研究，验证了平面性和小分支宽度在实际中并不罕见。算例分析也表明，该方法在计算效率上有一定的优势。
This paper proposes a procedure to solve combinatorial power network design problems such as phasor measurement unit (PMU) placement and protection assignment against cyber-physical attacks. The proposed approach tackles the design problems through solving a dominating set problem on the power network graph. A combined branch-decomposition and dynamic programming procedure is applied to solve the dominating set problem. Contrary to standard integer programming and heuristic/evolutionary approaches for power network design, the proposed approach is exact and requires only polynomial computation time if the graph is planar and has small branchwidth. A planarization technique is explored for problem instances with nonplanar graphs. A case study in this paper with benchmark power networks verifies that planarity and small branchwidth are not uncommon in practice. The case study also indicates that the proposed method shows promise in computation efficiency.