摘要
传统的基于矩阵法的拓扑分析处理流程都是从形成初始邻接矩阵开始,经由大量逻辑运算获得全连通矩阵,存在在线运算量大、跟踪开关变位效率差等问题。本文在总结现有厂站主接线图形特征的基础上,得到了可将主接线所映射的点-边图分为单串式、两串式以及多串式三种形式的结论,进一步总结提出了形成节点间的连通路径集合的统一方法。以连通路径获取为前提,考虑到全连通矩阵中的非对角元素可以表示成开关状态为自变量的函数形式,则通过代入实时开关状态到连通路径函数求值即可确定全连通矩阵的值。新方法避免了传统邻接矩阵法的反复求解,并可将函数表达式离线形成以节省在线拓扑计算时间。实验结果表明,新方法可以准确、方便、快速地实现厂站内初始拓扑分析和开关变位跟踪。
The traditional matrix-based typical process of substation configuration needs to gain the complete adjacent matrix from the original one by a plenty of logical calculation. However, there are some disadvantages in this process, such as large logical calculation in online analysis and low efficiency in tracking the state status change of the switches. In this paper, having taken into consideration of the graphic characteristics of all kinds of the main electrical connections in substations, the mapped node-branch graphs from main connections are classified into three types： single branch, two branches in-parallel and multi-branches in-parallel. Furthermore, a unified approach is proposed to obtain the connected routes sets between the arbitrary two nodes of main connections. As to the value of the non-diagonal element in complete connected matrix, the set of connected routes is used as the function formation with the branches statues as independent variables. In this way, the element value could be determined by the connected routes functions with substituting the real time open-close status of the branches. The repeated solving process of the traditional matrix methods is avoided by the novel way, and the connected functions set could be formed off-line to save the online topology analysis time. The example result shows that the new method is able to finish the original topology analysis and track the state status of switches accurately and rapidly.
出处
《电工技术学报》
EI
CSCD
北大核心
2012年第2期255-260,共6页
Transactions of China Electrotechnical Society
基金
国家自然科学基金(50837002
50907021)
中央高校基本科研业务费专项资金(11MG37)
华北电力大学"211工程"拔尖博士培养计划资助项目
关键词
厂站内拓扑分析
电气主接线
邻接矩阵
连通路径
Substation configuration, electrical main connections, adjacent matrix, connected routes
