Solutions and Heuristics for Troubleshooting with Dependent Actions and Conditional Costs

[1]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Steffen L. Lauritzen,et al.  Representing and Solving Decision Problems with Limited Information , 2001, Manag. Sci..

[3]  Michael P. Wellman,et al.  Explaining 'Explaining Away' , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Edward J. Sondik,et al.  The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..

[5]  Finn V. Jensen,et al.  Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.

[6]  Solomon Eyal Shimony,et al.  Finding MAPs for Belief Networks is NP-Hard , 1994, Artif. Intell..

[7]  Thomas D. Nielsen,et al.  An anytime algorithm for evaluating unconstrained influence diagrams , 2008 .

[8]  A. N. Kolmogorov,et al.  Foundations of the theory of probability , 1960 .

[9]  Judea Pearl,et al.  What Counterfactuals Can Be Tested , 2007, UAI.

[10]  Adnan Darwiche,et al.  Modeling and Reasoning with Bayesian Networks , 2009 .

[11]  Sheng Ma,et al.  Adaptive diagnosis in distributed systems , 2005, IEEE Transactions on Neural Networks.

[12]  Wilson X. Wen,et al.  Optimal decomposition of belief networks , 1990, UAI.

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

[14]  Nathan R. Sturtevant,et al.  Inconsistent Heuristics , 2007, AAAI.

[15]  Thomas D. Nielsen,et al.  A comparison of two approaches for solving unconstrained influence diagrams , 2009, Int. J. Approx. Reason..

[16]  David J. Spiegelhalter,et al.  Probabilistic Networks and Expert Systems , 1999, Information Science and Statistics.

[17]  Hermann Kaindl,et al.  Bidirectional Heuristic Search Reconsidered , 1997, J. Artif. Intell. Res..

[18]  Finn Verner Jensen,et al.  Better Safe than Sorry - Optimal Troubleshooting through A* Search with Efficiency-based Pruning , 2008, SCAI.

[19]  Helge Langseth,et al.  Decision theoretic troubleshooting of coherent systems , 2003, Reliab. Eng. Syst. Saf..

[20]  László Méro,et al.  A Heuristic Search Algorithm with Modifiable Estimate , 1984, Artif. Intell..

[21]  Krishna R. Pattipati,et al.  Test sequencing problems arising in test planning and design for testability , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[22]  Uffe Kjærulff,et al.  Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis , 2007, Information Science and Statistics.

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

[24]  Krishna R. Pattipati,et al.  Optimal and near-optimal test sequencing algorithms with realistic test models , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[25]  Krishna R. Pattipati,et al.  Sequential testing algorithms for multiple fault diagnosis , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[26]  Changhe Yuan,et al.  Solving Multistage Influence Diagrams using Branch-and-Bound Search , 2010, UAI.

[27]  Changhe Yuan,et al.  Most Relevant Explanation: Properties, Algorithms, and Evaluations , 2009, UAI.

[28]  Finn Verner Jensen,et al.  Unconstrained Influence Diagrams , 2002, UAI.

[29]  H. Simon,et al.  Optimal Strategies for a Class of Constrained Sequential Problems , 1977 .

[30]  Mattias Nyberg,et al.  Troubleshooting when Action Costs are Dependent with Application to a Truck Engine , 2008, SCAI.

[31]  Claus Skaanning,et al.  Acquisition and Transformation of Likelihoods to Conditional Probabilities for Bayesian Networks , 1999 .

[32]  J. Pearl.  Causality: Models, Reasoning and Inference , 2000 .

[33]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

[34]  Michael Luby,et al.  Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..

[35]  Krishna R. Pattipati,et al.  Test sequencing algorithms with unreliable tests , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[36]  Finn V. Jensen,et al.  When to test? Troubleshooting with postponed system test , 2011, Expert Syst. Appl..

[37]  Thorsten J. Ottosen,et al.  All Roads Lead To Rome—New Search Methods for Optimal Triangulation , 2010 .

[38]  Finn Verner Jensen,et al.  Cautious Propagation in Bayesian Networks , 1995, UAI.

[39]  Krishna R. Pattipati,et al.  Computationally efficient algorithms for multiple fault diagnosis in large graph-based systems , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[40]  Jirí Vomlel,et al.  Building adaptive tests using Bayesian networks , 2004, Kybernetika.

[41]  Václav Lín.  Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints , 2011, ECSQARU.

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

[43]  Jirí Vomlel,et al.  Troubleshooting with Simultaneous Models , 2001, ECSQARU.

[44]  D. J. H. Garling,et al.  The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities by J. Michael Steele , 2005, Am. Math. Mon..

[45]  Ira Pohl,et al.  The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.

[46]  Ashraf M. Abdelbar,et al.  Approximating MAPs for Belief Networks is NP-Hard and Other Theorems , 1998, Artif. Intell..

[47]  M. Tribus,et al.  Probability theory: the logic of science , 2003 .

[48]  Po-An Chen,et al.  Simple optimization techniques for A*-based search , 2009, AAMAS.

[49]  David Poole,et al.  Adding Local Constraints to Bayesian Networks , 2007, Canadian Conference on AI.

[50]  Peter C. Cheeseman,et al.  In Defense of Probability , 1985, IJCAI.

[51]  Ching-Fang Liaw,et al.  A Bibliography of Heuristic Search Research Through 1992 , 1994, IEEE Trans. Syst. Man Cybern. Syst..

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

[53]  A. Mahanti,et al.  Heuristic search in networks with modifiable estimate , 1987, CSC '87.

[54]  Yang Xiang.  Acquisition and Computation Issues with NIN-AND Tree Models , .

[55]  A. Dawid.  Conditional Independence in Statistical Theory , 1979 .

[56]  Marta Vomlelová,et al.  Complexity of decision‐theoretic troubleshooting , 2003, Int. J. Intell. Syst..

[57]  Rina Dechter,et al.  Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space , 2004, UAI.

[58]  Krishna R. Pattipati,et al.  Rollout strategies for sequential fault diagnosis , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[59]  Thorsten J. Ottosen,et al.  Honour Thy Neighbour: Clique Maintenance in Dynamic Graphs , 2010 .

[60]  Roni Stern,et al.  Using Lookaheads with Optimal Best-First Search , 2010, AAAI.

[61]  Jayanta K. Ghosh.  Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis by Uffe B. Kjaerulff, Anders L. Madsen , 2008 .

[62]  Marek J. Druzdzel,et al.  SMILE: Structural Modeling, Inference, and Learning Engine and GeNIE: A Development Environment for Graphical Decision-Theoretic Models , 1999, AAAI/IAAI.

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

[64]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[65]  Eylem Koca,et al.  Troubleshooting with Questions and Conditional Costs , 2004 .

[66]  Nils J. Nilsson,et al.  Artificial Intelligence: A New Synthesis , 1997 .

[67]  Anna Pernestål,et al.  Probabilistic Fault Diagnosis with Automotive Applications , 2009 .

[68]  Mattias Nyberg,et al.  A Heuristic for Near-Optimal Troubleshooting Using AO* , 2008 .

[69]  Silja Renooij,et al.  Bayesian Network Sensitivity to Arc-Removal , 2010 .

[70]  Sebastian Thrun,et al.  ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.

[71]  Eylem Koca,et al.  A Troubleshooting Approach with Dependent Actions , 2004, ECAI.

[72]  E. Rowland.  Theory of Games and Economic Behavior , 1946, Nature.

[73]  Luiz Chaimowicz,et al.  A Survey and Classification of A* Based Best-First Heuristic Search Algorithms , 2010, SBIA.

[74]  Ronald A. Howard,et al.  Influence Diagrams , 2005, Decis. Anal..

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

[76]  Teruhisa Miura,et al.  A* with Partial Expansion for Large Branching Factor Problems , 2000, AAAI/IAAI.

[77]  Taner Bilgiç,et al.  Troubleshooting using probabilistic networks and value of information , 2002, Int. J. Approx. Reason..

[78]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[79]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[80]  Finn Verner Jensen,et al.  The Cost of Troubleshooting Cost Clusters with Inside Information , 2010, UAI.

[81]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[82]  Jayanta K. Ghosh,et al.  Bayesian Networks and Decision Graphs, 2nd Edition by Finn V. Jensen, Thomas D. Nielsen , 2008 .

[83]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[84]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[85]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[86]  M. Yannakakis.  Computing the Minimum Fill-in is NP^Complete , 1981 .

[87]  Lise Getoor,et al.  VOILA: Efficient Feature-value Acquisition for Classification , 2007, AAAI.

[88]  J. Schmidhuber,et al.  Frontier Search , 2009 .

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

[90]  Finn Verner Jensen,et al.  A* Wars: The Fight for Improving A* Search for Troubleshooting with Dependent Actions , 2008 .

[91]  Sampath Srinivas,et al.  A Generalization of the Noisy-Or Model , 1993, UAI.

[92]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[93]  Krishna R. Pattipati,et al.  On a multimode test sequencing problem , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[95]  Prakash P. Shenoy,et al.  Sequential influence diagrams: A unified asymmetry framework , 2006, Int. J. Approx. Reason..

[96]  Søren Holbech Nielsen,et al.  Multi-currency Influence Diagrams , 2007 .