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

Generation of minimal candidate set for multiple fault diagnosisbased on binary particle swarm optimization

Lv Xiao-ming1, HUANG Kao-li2, LIAN Guang-yao2   

  1. 1. Ordnance Engineering College, Shijiazhuang 050003, China;
    2. Institute of Ordnance Technology, Shijiazhuang 050003, China
  • Online:2012-05-23 Published:2010-01-03

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.

[an error occurred while processing this directive]