3 papers
cs.AI2013
High Level Path Planning with Uncertainty
Runping Qi, David L. Poole
For high level path planning, environments are usually modeled as distance graphs, and path planning problems are reduced to computing the shortest path in distance graphs. One maj…
cs.AI2013
Incremental computation of the value of perfect information in stepwise-decomposable influence diagrams
Nevin Lianwen Zhang, Runping Qi, David L. Poole
To determine the value of perfect information in an influence diagram, one needs first to modify the diagram to reflect the change in information availability, and then to compute…
cs.AI2013
Solving Asymmetric Decision Problems with Influence Diagrams
Runping Qi, Nevin Lianwen Zhang, David L. Poole
While influence diagrams have many advantages as a representation framework for Bayesian decision problems, they have a serious drawback in handling asymmetric decision problems. T…