261 citations · 631 across the 10 of their papers we have counts for
5 papers · 2 filters
Symbolic Generalization for On-line Planning
Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of on-line pl…
Sparse Stochastic Finite-State Controllers for POMDPs
Eric A. Hansen
Bounded policy iteration is an approach to solving infinite-horizon POMDPs that represents policies as stochastic finite-state controllers and iteratively improves a controller by…
Solving Multistage Influence Diagrams using Branch-and-Bound Search
Changhe Yuan, Xiaojian Wu, Eric A. Hansen
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 du…
Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search
Brandon Malone, Changhe Yuan, Eric A. Hansen +1
Previous work has shown that the problem of learning the optimal structure of a Bayesian network can be formulated as a shortest path finding problem in a graph and solved using A*…
Suboptimality Bounds for Stochastic Shortest Path Problems
Eric A. Hansen
We consider how to use the Bellman residual of the dynamic programming operator to compute suboptimality bounds for solutions to stochastic shortest path problems. Such bounds have…