Journal of Systems Engineering and Electronics ›› 2012, Vol. 34 ›› Issue (5): 961-965.doi: 10.3969/j.issn.1001-506X.2012.05.19
Previous Articles Next Articles
Lv Xiao-ming1, HUANG Kao-li2, LIAN Guang-yao2
Online:
Published:
Abstract:
The generation of a multiple fault minimal candidates set is the first step in making the multiple fault diagnostic strategy. The binary particle swarm optimization (BPSO) algorithm is applied to generate the minimal candidates set. Firstly, the multiple fault ambiguity group in a certain OR node is described by using compact set notation, the minimal candidate set is a minimal hitting set. Then, by constructing both individual fitness function and swarm fitness function, the BPSO is applied in finding minimal hitting set successfully, and guarantees to find the hitting sets as many as possible. Finally, the experiment results of a certain real system verify the effectiveness of the algorithm, which proves that this method can be applied in solving the minimal hitting set of multiple fault diagnosis effectively.
Lv Xiao-ming, HUANG Kao-li, LIAN Guang-yao. Generation of minimal candidate set for multiple fault diagnosisbased on binary particle swarm optimization[J]. Journal of Systems Engineering and Electronics, 2012, 34(5): 961-965.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.sys-ele.com/EN/10.3969/j.issn.1001-506X.2012.05.19
https://www.sys-ele.com/EN/Y2012/V34/I5/961