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 open point,SOP)探测的配电线路永久性故障识别方法。首先,给出了配电线路相间永久性故障识别模型及其适用频带...不区分故障性质的配电线路自动重合闸在发生永久性故障时会造成二次冲击,为此在柔性互联配电网中提出了利用智能软开关(soft open point,SOP)探测的配电线路永久性故障识别方法。首先,给出了配电线路相间永久性故障识别模型及其适用频带,进一步分析了求解永久性故障模型的信号需求并设计了SOP的控制策略;然后,基于模型识别思想提出了利用电压结构相似性的配电线路永久性故障识别方法,构建了SOP协同的故障隔离及供电恢复方案;最后,基于PSCAD对所提方法进行了仿真,并进行了实验验证,结果表明所提方法能正确识别故障性质并定位故障区段。展开更多
基金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 open point,SOP)探测的配电线路永久性故障识别方法。首先,给出了配电线路相间永久性故障识别模型及其适用频带,进一步分析了求解永久性故障模型的信号需求并设计了SOP的控制策略;然后,基于模型识别思想提出了利用电压结构相似性的配电线路永久性故障识别方法,构建了SOP协同的故障隔离及供电恢复方案;最后,基于PSCAD对所提方法进行了仿真,并进行了实验验证,结果表明所提方法能正确识别故障性质并定位故障区段。
