欢迎访问《兵工学报》官方网站,今天是

兵工学报 ›› 2014, Vol. 35 ›› Issue (12): 2109-2115.doi: 10.3969/j.issn.1000-1093.2014.12.026

• 论文 • 上一篇    下一篇

基于贪婪算法的测试优化选择

刘建敏, 刘远宏, 冯辅周, 江鹏程   

  1. (装甲兵工程学院 机械工程系, 北京 100072)
  • 收稿日期:2014-03-13 修回日期:2014-03-13 上线日期:2015-02-06
  • 作者简介:刘建敏(1963—), 教授, 博士生导师
  • 基金资助:
    总装备部科技创新工程项目(ZYX1206006)

The Optimization Selection of Tests Based on Greedy Algorithm

LIU Jian-min, LIU Yuan-hong, FENG Fu-zhou, JIANG Peng-cheng   

  1. (Department of Mechanical Engineering, Academy of Armored Force Engineering, Beijing 100072, China)
  • Received:2014-03-13 Revised:2014-03-13 Online:2015-02-06

摘要: 针对传统测试优化选择算法存在的通用性较差等问题,提出了基于贪婪算法的测试优化选择方法,分别应用于面向故障检测和故障隔离的测试优化选择。其基本思想是以测试数量最少为目标,先选择必需的测试,即某一故障只能被单个测试检测或隔离,然后采用贪婪式搜索逐步选择最优测试。通过二值和多值测试优化选择案例验证了该算法的有效性,并从理论上分析了算法的时间复杂度。理论和案例分析结果表明,该算法能有效挖掘测试的故障检测和隔离能力,且适用于隔离到更换单元和具体故障模式的二值和多值测试优化选择,时间复杂度较传统算法明显降低。

关键词: 兵器科学与技术, 测试优化, 贪婪算法, 故障检测, 故障隔离

Abstract: A novel test selection method is proposed based on greedy algorithm, which is used for fault detection and isolation, to overcome the shortcomings of the traditional test optimization algorithms, such as poor universality. The method is used to select the required test with aim of the minimal number of tests. Then the optimal test is selected gradually by greedy search. Finally, the validity of the proposed method is verified by using the binary-value and multi-value test optimization cases. Theoretical and case studies show that the proposed method is not only effective to excavate the fault detection and isolation ability of tests with low time complexity, but also applicable to the binary-value and multi-value test optimization of isolating the fauts to replaceable unit and specific failure mode.

Key words: ordnance science and technology, test optimization, greedy algorithm, fault detection, fault isolation

中图分类号: