Solving Multistage Influence Diagrams using Branch-and-Bound Search
Artificial Intelligence
2012-03-19 v1
Abstract
A branch-and-bound approach to solving influ- ence diagrams has been previously proposed in the literature, but appears to have never been implemented and evaluated - apparently due to the difficulties of computing effective bounds for the branch-and-bound search. In this paper, we describe how to efficiently compute effective bounds, and we develop a practical implementa- tion of depth-first branch-and-bound search for influence diagram evaluation that outperforms existing methods for solving influence diagrams with multiple stages.
Keywords
Cite
@article{arxiv.1203.3531,
title = {Solving Multistage Influence Diagrams using Branch-and-Bound Search},
author = {Changhe Yuan and Xiaojian Wu and Eric A. Hansen},
journal= {arXiv preprint arXiv:1203.3531},
year = {2012}
}
Comments
Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)