185 citations · 334 across the 6 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2012★ 18 cited
Heuristic Search Value Iteration for POMDPs
Trey Smith, Reid Simmons
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI).HSVI is an anytime algorithm that returns a policy and a provable bound on its regret wit…
cs.AI2012★ 93 cited
Point-Based POMDP Algorithms: Improved Analysis and Implementation
Trey Smith, Reid Simmons
Existing complexity bounds for point-based POMDP value iteration algorithms focus either on the curse of dimensionality or the curse of history. We derive a new bound that relies o…
cs.AI2011★ 185 cited
VHPOP: Versatile Heuristic Partial Order Planner
R. G. Simmons, H. L. S. Younes
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experience gained in the early to mid 1990's on flaw selection strategies for POCL pla…