An Algorithm for Computing the Diagnoses with Minimal Cardinality in a Distributed System
In fault diagnosis, the set of minimal diagnoses is commonly
calculated. However, due to for example limited computation resources,
the search for the set of minimal diagnoses is in some applications
focused on to the smaller set of diagnoses with minimal
cardinality. The key contribution in this paper is an algorithm that
calculates the diagnoses with minimal cardinality in a distributed
system. The algorithm is constructed such that the computationally
intensive tasks are distributed to the different units in the
distributed system, and thereby reduces the need for a powerful
central diagnostic unit.
Jonas Biteus, Mattias Nyberg and Erik Frisk
Engineering Applications of Artificial Intelligence,
2008
Informationsansvarig: webmaster
Senast uppdaterad: 2021-11-10
LiU Homepage
