Journal of Computer Applications ›› 2005, Vol. 25 ›› Issue (02): 417-419.DOI: 10.3724/SP.J.1087.2005.0417
• Typical applications • Previous Articles Next Articles
JING Xiao-ning1,2,LI Quan-tong2,CHEN Yun-xiang2,LV Zhen-zhong2
Online:
Published:
景小宁1,2,李全通2,陈云翔2,吕振中2
Abstract: Directed towards the test sequencing problem in the sequential fault diagnosis for large scale systems, an algorithm based on information entropy for design the fault diagnosis strategy with least test cost was presented. The algorithm requires less computation than the traditional methods, and uses the test results, test cost, and fault probabilities efficiently. This algorithm is suitable for on-line or off-line diagnosis and maintenance process. The design process of the algorithm was presented, and an example was used to illustrate the validity of the method.
Key words: information entropy, fault diagnosis strategy, test cost, diagnosis tree, test sequencing
摘要: 针对大系统顺序故障诊断中的测试排序问题,介绍一种基于信息熵的最少测试费用诊断树产生算法,这种算法比传统算法计算量少,又可有效利用测试结果、测试费用和故障概率等信息,该算法适合于在线和离线诊断维修过程。给出了算法的设计过程,并以实例说明算法的有效性。
关键词: 信息熵, 故障诊断策略, 测试费用, 诊断树, 测试排序
CLC Number:
TP277
JING Xiao-ning,LI Quan-tong,CHEN Yun-xiang,LV Zhen-zhong. [J]. Journal of Computer Applications, 2005, 25(02): 417-419.
景小宁,李全通,陈云翔,吕振中. 基于信息熵的最少测试费用故障诊断策略[J]. 计算机应用, 2005, 25(02): 417-419.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://www.joca.cn/EN/10.3724/SP.J.1087.2005.0417
http://www.joca.cn/EN/Y2005/V25/I02/417