Artificial Intelligence
Decision-theoretic troubleshooting
Communications of the ACM
A comparison of decision alaysis and expert rules for sequential diagnosis
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
A Knowledge Acquisition Tool for Bayesian-Network Troubleshooters
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Troubleshooting with Simultaneous Models
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On the use of Bayesian Networks to develop behaviours for mobile robots
Robotics and Autonomous Systems
A Context-Aware Movie Preference Model Using a Bayesian Network for Recommendation and Promotion
UM '07 Proceedings of the 11th international conference on User Modeling
Automatic diagnosis of mobile communication networks under imprecise parameters
Expert Systems with Applications: An International Journal
Better Safe than SorryOptimal Troubleshooting through A* Search with Efficiency-based Pruning
Proceedings of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008
Troubleshooting with human-readable automated reasoning
LISA'10 Proceedings of the 24th international conference on Large installation system administration
When to test? Troubleshooting with postponed system test
Expert Systems with Applications: An International Journal
Extensions of decision-theoretic troubleshooting: cost clusters and precedence constraints
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Expert Systems with Applications: An International Journal
Probabilistic inference with noisy-threshold models based on a CP tensor decomposition
International Journal of Approximate Reasoning
Decision-theoretic troubleshooting: Hardness of approximation
International Journal of Approximate Reasoning
Hi-index | 0.00 |
The paper describes the task of performing efficient decision-theoretic troubleshooting of electromechanical devices. In general, this task is NP-complete, but under fairly strict assumptions, a greedy approach will yield an optimal sequence of actions, as discussed in the paper. This set of assumptions is weaker than the set proposed by Heckerman et al. (1995). However, the printing system domain, which motivated the research and which is described in detail in the paper, does not meet the requirements for the greedy approach, and a heuristic method is used. The method takes value of identification of the fault into account and it also performs a partial two-step look-ahead analysis. We compare the results of the heuristic method with optimal sequences of actions, and find only minor differences between the two.