Complexity of decision‐theoretic troubleshooting

The goal of troubleshooting is to find an optimal solution strategy consisting of actions and observations for repairing a device. We assume a probabilistic model of dependence between possible faults, actions, and observations; the goal is to minimize the expected cost of repair (ECR). We show that the task of finding an optimal solution strategy is NP hard for various troubleshooting models; therefore, approximate algorithms are necessary. © 2003 Wiley Periodicals, Inc.

[1]  David Heckerman,et al.  Decision-Theoretic Troubleshooting: A Framework for Repair and Experiment , 1996, UAI.

[2]  David Heckerman,et al.  Decision-theoretic troubleshooting , 1995, CACM.

[3]  Jayant Kalagnanam,et al.  A comparison of decision alaysis and expert rules for sequential diagnosis , 2013, UAI.

[4]  Claus Skaanning,et al.  Printer Troubleshooting Using Bayesian Networks , 2000, IEA/AIE.

[5]  Mark A. Shayman,et al.  Risk-sensitive decision-theoretic diagnosis , 2001, IEEE Trans. Autom. Control..

[6]  Jirí Vomlel,et al.  Troubleshooting: NP-hardness and solution methods , 2003, Soft Comput..

[7]  Aurel A. Lazar,et al.  Fault Isolation Based on Decision-theoretic Troubleshooting Fault Isolation Based on Decision-theoretic Troubleshooting , 1996 .

[8]  Helge Langseth,et al.  Heuristics for Two Extensions of Basic Troubleshooting , 2001, SCAI.

[9]  George Papageorgiou,et al.  The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..

[10]  Sampath Srinivas.  A polynomial algorithm for computing the optimal repair strategy in a system with independent component failures , 1995, UAI.

[11]  Mihalis Yannakakis,et al.  Searching a Fixed Graph , 1996, ICALP.

[12]  Jirí Vomlel,et al.  The SACSO methodology for troubleshooting complex systems , 2001, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[13]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.