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

顺序诊断优化模型的可扩展计算

Scalable Computation of Optimized Queries for Sequential Diagnosis

Alpen-Adria Universität(阿尔卑斯-亚得里亚大学)

Patrick Rodler, Wolfgang Schmid, Kostyantyn Shchekotykhin

摘要:

在许多基于模型的诊断应用中,不可能提供允许识别故障的真正原因的这样一组观察和/或测量。因此,诊断系统通常返回许多可能的候选,将选择正确诊断的负担留给用户。顺序诊断技术通过自动生成对某个预言机的查询序列来解决这个问题。这些查询的答案提供了通过去除与答案不一致的诊断候选来逐渐限制搜索空间所需的附加信息。在查询计算过程中,现有的顺序诊断方法往往需要生成许多不必要的查询候选,并强烈依赖于昂贵的逻辑推理机。我们通过设计高效的启发式查询搜索方法来解决这个问题。所提出的方法使第一次完全无推理机的查询生成,而在同一时间,保证最优条件,例如最小基数或最佳可理解性,返回的查询,现有的方法无法实现。因此,这种方法的性能是独立的诊断系统(的复杂性)。使用真实世界的问题进行的实验表明,新方法是高度可扩展的,并优于现有的方法的数量级。

英文摘要:

In many model-based diagnosis applications it is impossible to provide such a set of observations and/or measurements that allow to identify the real cause of a fault. Therefore, diagnosis systems often return many possible candidates, leaving the burden of selecting the correct diagnosis to a user. Sequential diagnosis techniques solve this problem by automatically generating a sequence of queries to some oracle. The answers to these queries provide additional information necessary to gradually restrict the search space by removing diagnosis candidates inconsistent with the answers. During query computation, existing sequential diagnosis methods often require the generation of many unnecessary query candidates and strongly rely on expensive logical reasoners. We tackle this issue by devising efficient heuristic query search methods. The proposed methods enable for the first time a completely reasoner-free query generation while at the same time guaranteeing optimality conditions, e.g. minimal cardinality or best understandability, of the returned query that existing methods cannot realize. Hence, the performance of this approach is independent of the (complexity of the) diagnosed system. Experiments conducted using real-world problems show that the new approach is highly scalable and outperforms existing methods by orders of magnitude.

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

↑