Sciweavers

Share
IJCAI
2007

Forward Search Value Iteration for POMDPs

8 years 8 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. Of this family HSVI, which uses trial-based asynchronous value iteration, can handle the largest domains. In this paper we suggest a new algorithm, FSVI, that uses the underlying MDP to traverse the belief space towards rewards, finding sequences of useful backups, and show how it scales up better than HSVI on larger benchmarks.
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where IJCAI
Authors Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
Comments (0)
books