Sciweavers

4 search results - page 1 / 1
» Forward Search Value Iteration for POMDPs
Sort
View
IJCAI
2007
13 years 5 months ago
Forward Search Value Iteration for POMDPs
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods which quickly converge to an approximate solution for medium-sized problems...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
UAI
2004
13 years 5 months ago
Heuristic Search Value Iteration for POMDPs
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 w...
Trey Smith, Reid G. Simmons
NIPS
2007
13 years 5 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
AAAI
1996
13 years 5 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace