activity
20112014
most citedAnytime Heuristic Search

261 citations · 631 across the 10 of their papers we have counts for

collaborators

10 papers

cs.AI2014★ 91 cited

Policy Iteration for Decentralized Control of Markov Decision Processes

Daniel S. Bernstein, Christopher Amato, Eric A. Hansen +1

Coordination of distributed agents is required for problems arising in many areas, including multi-robot systems, networking and e-commerce. As a formal framework for such problems…

cs.AI2014★ 19 cited

A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains

Nicolas Meuleau, Emmanuel Benazera, Ronen I. Brafman +2

We consider the problem of optimal planning in stochastic domains with resource constraints, where the resources are continuous and the choice of action at each step depends on res…

cs.AI2013

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

Arindam Khaled, Eric A. Hansen, Changhe Yuan

A limited-memory influence diagram (LIMID) generalizes a traditional influence diagram by relaxing the assumptions of regularity and no-forgetting, allowing a wider range of decisi…

cs.AI2013★ 191 cited

Solving POMDPs by Searching in Policy Space

Eric A. Hansen

Most algorithms for solving POMDPs iteratively improve a value function that implicitly represents a policy and are said to search in value function space. This paper presents an a…

cs.AI2012★ 39 cited

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…

cs.AI2012★ 7 cited

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…