IEEE Trans Cybern. 2017 Jul;47(7):1604-1617. doi: 10.1109/TCYB.2016.2552979. Epub 2016 Apr 28.
The purpose of this paper is to propose a solution to an extremely pertinent problem, namely, that of identifying unreliable sensors (in a domain of reliable and unreliable ones) without any knowledge of the ground truth. This fascinating paradox can be formulated in simple terms as trying to identify stochastic liars without any additional information about the truth. Though apparently impossible, we will show that it is feasible to solve the problem, a claim that is counter-intuitive in and of itself. One aspect of our contribution is to show how redundancy can be introduced, and how it can be effectively utilized in resolving this paradox. Legacy work and the reported literature (for example, in the so-called weighted majority algorithm) have merely addressed assessing the reliability of a sensor by comparing its reading to the ground truth either in an online or an offline manner. Unfortunately, the fundamental assumption of revealing the ground truth cannot be always guaranteed (or even expected) in many real life scenarios. While some extensions of the Condorcet jury theorem [9] can lead to a probabilistic guarantee on the quality of the fused process, they do not provide a solution to the unreliable sensor identification problem. The essence of our approach involves studying the agreement of each sensor with the rest of the sensors, and not comparing the reading of the individual sensors with the ground truth-as advocated in the literature. Under some mild conditions on the reliability of the sensors, we can prove that we can, indeed, filter out the unreliable ones. Our approach leverages the power of the theory of learning automata (LA) so as to gradually learn the identity of the reliable and unreliable sensors. To achieve this, we resort to a team of LA, where a distinct automaton is associated with each sensor. The solution provided here has been subjected to rigorous experimental tests, and the results presented are, in our opinion, both novel and conclusive.
本文旨在提出一种解决方案,以解决一个极其重要的问题,即如何在完全不了解真实情况的情况下识别不可靠的传感器(在可靠和不可靠传感器的领域)。这个引人入胜的悖论可以简单地表述为,试图在没有任何关于事实的额外信息的情况下识别随机说谎者。虽然这似乎是不可能的,但我们将证明解决这个问题是可行的,这本身就是一个违反直觉的主张。我们贡献的一个方面是展示如何引入冗余,并展示如何有效地利用冗余来解决这个悖论。传统的工作和已报道的文献(例如,所谓的加权多数算法)仅仅通过在线或离线方式将传感器的读数与其真实值进行比较,从而评估传感器的可靠性。不幸的是,在许多现实场景中,无法始终保证(甚至期望)揭示真实值的基本假设。虽然 Condorcet 陪审团定理的一些扩展[9]可以导致融合过程质量的概率保证,但它们并没有为不可靠传感器识别问题提供解决方案。我们方法的本质涉及研究每个传感器与其余传感器的一致性,而不是像文献中所提倡的那样,将个别传感器的读数与真实值进行比较。在传感器可靠性的一些温和条件下,我们可以证明我们确实可以过滤掉不可靠的传感器。我们的方法利用了学习自动机(LA)理论的力量,以便逐步学习可靠和不可靠传感器的身份。为此,我们求助于一组 LA,其中每个传感器都与一个独特的自动机相关联。这里提供的解决方案已经经过了严格的实验测试,我们认为呈现的结果是新颖且结论性的。