Solving Influence Diagrams using HUGIN, Shafer-Shenoy and Lazy Propagation

by   Anders L. Madsen, et al.

In this paper we compare three different architectures for the evaluation of influence diagrams: HUGIN, Shafer-Shenoy, and Lazy Evaluation architecture. The computational complexity of the architectures are compared on the LImited Memory Influence Diagram (LIMID): a diagram where only the requiste information for the computation of the optimal policies are depicted. Because the requsite information is explicitly represented in the LIMID the evaluation can take advantage of it, and significant savings in computational can be obtained. In this paper we show how the obtained savings is considerably increased when the computations performed on the LIMID is according to the Lazy Evaluation scheme.


page 1

page 2

page 8

page 9


Evaluating Influence Diagrams using LIMIDs

We present a new approach to the solution of decision problems formulate...

Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search

A limited-memory influence diagram (LIMID) generalizes a traditional inf...

Incremental computation of the value of perfect information in stepwise-decomposable influence diagrams

To determine the value of perfect information in an influence diagram, o...

Constraining Influence Diagram Structure by Generative Planning: An Application to the Optimization of Oil Spill Response

This paper works through the optimization of a real world planning probl...

IDEAL: A Software Package for Analysis of Influence Diagrams

IDEAL (Influence Diagram Evaluation and Analysis in Lisp) is a software ...

Solving Hybrid Influence Diagrams with Deterministic Variables

We describe a framework and an algorithm for solving hybrid influence di...

Solving Multistage Influence Diagrams using Branch-and-Bound Search

A branch-and-bound approach to solving influ- ence diagrams has been pre...