Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of t...Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.展开更多
Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In ...Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.展开更多
由于柔性多状态开关(soft normal open point,SNOP)复杂的控制策略及其弱馈特性,传统配电网故障定位方法难以适用于柔性互联配电网(flexible distribution network,FDN)。因此,文中提出一种利用电流正序分量波形相似性进行FDN故障区段...由于柔性多状态开关(soft normal open point,SNOP)复杂的控制策略及其弱馈特性,传统配电网故障定位方法难以适用于柔性互联配电网(flexible distribution network,FDN)。因此,文中提出一种利用电流正序分量波形相似性进行FDN故障区段定位的方法。首先,针对SNOP的典型控制策略,分析FDN的短路故障特征。其次,计算配电网中不同故障位置电流正序分量的Tanimoto系数,通过对比不同位置的电流正序分量波形相似性,构建FDN短路故障定位判据,并通过Teager能量算子(Teager energy operation,TEO)实现故障时刻的精确定位,利用智能配电终端(smart terminal unit,STU)传递信息。最后,通过建模仿真对所提方法进行分析验证,结果表明该方法能够对故障区段进行准确定位,不受故障位置、故障类型、过渡电阻、采样频率及通信延时等因素的影响,验证了该方法的可行性与有效性。展开更多
基金supported by National Natural Science Foundation of China under Grant No.60934002General Armament Department under Grant No.51317040102
文摘Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.
基金supported by Commission of Science Technology and Industry for National Defence of China under Grant No.A1420061264National Natural Science Foundation of China under Grant No.60934002General Armament Department under Grand No.51317040102)
文摘Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.
文摘由于柔性多状态开关(soft normal open point,SNOP)复杂的控制策略及其弱馈特性,传统配电网故障定位方法难以适用于柔性互联配电网(flexible distribution network,FDN)。因此,文中提出一种利用电流正序分量波形相似性进行FDN故障区段定位的方法。首先,针对SNOP的典型控制策略,分析FDN的短路故障特征。其次,计算配电网中不同故障位置电流正序分量的Tanimoto系数,通过对比不同位置的电流正序分量波形相似性,构建FDN短路故障定位判据,并通过Teager能量算子(Teager energy operation,TEO)实现故障时刻的精确定位,利用智能配电终端(smart terminal unit,STU)传递信息。最后,通过建模仿真对所提方法进行分析验证,结果表明该方法能够对故障区段进行准确定位,不受故障位置、故障类型、过渡电阻、采样频率及通信延时等因素的影响,验证了该方法的可行性与有效性。
