An algorithm for computing the diagnoses with minimal cardinality in a distributed system

Authors:
Jonas Biteus;Mattias Nyberg;Erik Frisk
Affiliations:
Department of Electrical Engineering, Linköpings universitet, se-581 83 Linköping, Sweden;Power-train division, Scania, se-151 87 Södertälje, Sweden;Department of Electrical Engineering, Linköpings universitet, se-581 83 Linköping, Sweden
Venue:
Engineering Applications of Artificial Intelligence
Year:
2008

Citing 4
Cited 1

A theory of diagnosis from first principles

Artificial Intelligence
Diagnosing multiple faults

Artificial Intelligence
Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence

Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence
A protocol for multi-agent diagnosis with spatially distributed knowledge

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems

A new strategy for automotive off-board diagnosis based on a meta-heuristic engine

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.