针对零、线模速度差和时间差行波定位原理中零模波速度难以确定的问题,提出了在无需时间同步的情况下,利用线路两端信息融合在线实时求取零模波速度的算法和一种配电网单相接地故障行波定位新方法。分析了行波分量在线路上的传播特性,...针对零、线模速度差和时间差行波定位原理中零模波速度难以确定的问题,提出了在无需时间同步的情况下,利用线路两端信息融合在线实时求取零模波速度的算法和一种配电网单相接地故障行波定位新方法。分析了行波分量在线路上的传播特性,将零、线模行波通过S变换后,发现在零、线模行波频率分别为50 k Hz和500 k Hz的分量下标定初始波头的到达时间,具有较高的灵敏度和稳定性。根据零模波速度与定位公式之间的关系,找出故障点所在最小区域,将该最小区域包含的线路区段分解成多组T型线路进行了故障定位。通过PSCAD/EMTDC进行了全面系统的仿真验证,结果表明所求得的零模波速度和定位方法具有较高的准确度,具有一定工程价值。展开更多
A new fault location method based on six-sequence fault components was developed for parallel lines based on the fault analysis of a joint parallel transmission line. In the six-sequence fault network, the ratio of ...A new fault location method based on six-sequence fault components was developed for parallel lines based on the fault analysis of a joint parallel transmission line. In the six-sequence fault network, the ratio of the root-mean square value of the fault current from two terminals is the function of the line imped- ance, the system impedance, and the fault distance away from the buses. A fault location equation is given to relate these factors. For extremely long transmission lines, the distributed capacitance is divided by the fault point and allocated to the two terminals of the transmission line in a lumped parameter to eliminate the influence of the distributed capacitance on the location accuracy. There is no limit on fault type and syn- chronization of the sampling data. Simulation results show that the location accuracy is high with an average error about 2%, and it is not influenced by factors such as the load current, the operating mode of the power system, or the fault resistance.展开更多
This paper discusses the inverse center location problem restricted on a tree with different costs and bound constraints. The authors first show that the problem can be formulated as a series of combinatorial linear p...This paper discusses the inverse center location problem restricted on a tree with different costs and bound constraints. The authors first show that the problem can be formulated as a series of combinatorial linear programs, then an O（｜V｜^2 log ｜V｜） time algorithm to solve the problem is presented. For the equal cost case, the authors further give an O（｜V｜） time algorithm.展开更多
文摘针对零、线模速度差和时间差行波定位原理中零模波速度难以确定的问题,提出了在无需时间同步的情况下,利用线路两端信息融合在线实时求取零模波速度的算法和一种配电网单相接地故障行波定位新方法。分析了行波分量在线路上的传播特性,将零、线模行波通过S变换后,发现在零、线模行波频率分别为50 k Hz和500 k Hz的分量下标定初始波头的到达时间,具有较高的灵敏度和稳定性。根据零模波速度与定位公式之间的关系,找出故障点所在最小区域,将该最小区域包含的线路区段分解成多组T型线路进行了故障定位。通过PSCAD/EMTDC进行了全面系统的仿真验证,结果表明所求得的零模波速度和定位方法具有较高的准确度,具有一定工程价值。
文摘A new fault location method based on six-sequence fault components was developed for parallel lines based on the fault analysis of a joint parallel transmission line. In the six-sequence fault network, the ratio of the root-mean square value of the fault current from two terminals is the function of the line imped- ance, the system impedance, and the fault distance away from the buses. A fault location equation is given to relate these factors. For extremely long transmission lines, the distributed capacitance is divided by the fault point and allocated to the two terminals of the transmission line in a lumped parameter to eliminate the influence of the distributed capacitance on the location accuracy. There is no limit on fault type and syn- chronization of the sampling data. Simulation results show that the location accuracy is high with an average error about 2%, and it is not influenced by factors such as the load current, the operating mode of the power system, or the fault resistance.
基金The research is supported by the National Natural Science Foundation of China under Grant Nos.70425004,70221001the National Key Research and Development Program of China under Grant No.2002CB312004
文摘This paper discusses the inverse center location problem restricted on a tree with different costs and bound constraints. The authors first show that the problem can be formulated as a series of combinatorial linear programs, then an O（｜V｜^2 log ｜V｜） time algorithm to solve the problem is presented. For the equal cost case, the authors further give an O（｜V｜） time algorithm.
