检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华北电力大学电气工程学院,河北省保定市071003 [2]华北电力大学数理学院,河北省保定市071003
出 处:《电力系统自动化》2007年第2期65-69,共5页Automation of Electric Power Systems
基 金:国家自然科学基金资助项目(50477038);教育部新世纪优秀人才支持计划资助项目(NCET-04-0249)~~
摘 要:将保护断点集的求取问题转换为寻找有向图中反馈边集问题。通过对反馈边集特性的研究,提出一种快速寻找反馈边集的实用方法,并论证了该方法的理论依据,进而采用该方法启发式搜索电网中保护之间的主/后备配合的依赖关系集,可去除无效的搜索起点和重复的搜索回路,快速得到环网保护整定的断点集。该方法可在电网拓扑发生变化时,通过修改相关保护间的依赖关系,就可在原有搜索结果的基础上,快速得到新的断点集。最后通过算例证明了新方法的正确性。The determination of the break point set (BPS) of a relay is the key to directional protective relays coordination in a large-scale multi-loop power network. This paper transforms the determination of BPS to seek the feedback are set (FAS) into a directed graph. Through a study of the characteristics of FAS, a new practical method for fast acquisition of FAS is developed and adopted to heuristically search for the functional dependency set of the relays that have primary/backup coordinative relations in a power network. In this way, the irrational searching start points and repeated loops can be removed, and the BPS of any relay is quickly determined. When the topology of power network changed, only the functional dependencies of a relative relay need to be modified and the new BPS can be quickly determined based on the original search results. The test results of an illustrative multi-loop network show that the new method is valid.
分 类 号:TM771[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.168