arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.3848cs.AI
收藏

基于贪婪随机搜索的近似模型诊断

Approximate Model-Based Diagnosis Using Greedy Stochastic Search

Delft University of Technology(代尔夫特理工大学);University College Cork(科克大学学院)

Alexander Feldman, Gregory Provan, Arjan van Gemund

摘要:

我们提出了一个随机故障诊断算法,称为SAFARI,它的交易保证计算最小的诊断计算效率。我们经验证明,使用74 XXX和ISCAS-85套件的基准组合电路,SAFARI实现了几个数量级的加速比两个著名的确定性算法,CDA* 和HA*,多故障诊断;此外,SAFARI可以计算一系列的多故障诊断,CDA* 和HA* 不能。我们还证明了SAFARI是最佳的命题故障模型的范围内,如广泛使用的弱故障模型(模型的异常行为的无知)。讨论了一类具有固定故障模式的强故障电路模型中SAFARI的最优性。通过建模的算法本身作为一个马尔可夫链,我们提供了精确的界限上的最小诊断计算。SAFARI还显示了强大的随时行为,并将在任何非平凡的推理时间之后返回诊断。

英文摘要:

We propose a StochAstic Fault diagnosis AlgoRIthm, called SAFARI, which trades off guarantees of computing minimal diagnoses for computational efficiency. We empirically demonstrate, using the 74XXX and ISCAS-85 suites of benchmark combinatorial circuits, that SAFARI achieves several orders-of-magnitude speedup over two well-known deterministic algorithms, CDA* and HA*, for multiple-fault diagnoses; further, SAFARI can compute a range of multiple-fault diagnoses that CDA* and HA* cannot. We also prove that SAFARI is optimal for a range of propositional fault models, such as the widely-used weak-fault models (models with ignorance of abnormal behavior). We discuss the optimality of SAFARI in a class of strong-fault circuit models with stuck-at failure modes. By modeling the algorithm itself as a Markov chain, we provide exact bounds on the minimality of the diagnosis computed. SAFARI also displays strong anytime behavior, and will return a diagnosis after any non-trivial inference time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑