A New Search Algorithm of MBD Based on Spider Web and Its Application in Power Distribution Network Fault Diagnosis

Abstract

To reduce the spatial complexity and search time of minimum hitting sets in model-based diagnosis (MBD), a new algorithm for searching minimum hitting sets of MBD is proposed in this paper, which can use the characteristics of minimum hitting sets and the idea of spider prey in biology. We call it cobweb search algorithm. In the algorithm, the generation of visit spiders and search strategy are proposed, and the visit spider that can find the visit path of cobweb to search all minimum hitting sets within a cobweb is constructed. Based on the experiment comparisons, Cobweb search algorithm has better performance than other algorithms of searching minimum hitting sets. As an example, a 14-node power distribution network model is constructed. The diagnosis process with MBD is introduced and analyzed in detail, at the same time the cobweb search algorithm is applied in power distribution network fault diagnosis. The experiment results verify the effectiveness and superiority of the proposed algorithm.