Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
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 with respect to the optimal policy. HSVI gets its power by combining two well-known techniques: attention-focusing search heuristics and piecewise linear convex representations of the value function. HSVI's soundness and convergence have been proven. On some benchmark problems from the literature, HSVI displays speedups of greater than 100 with respect to other state-of-the-art POMDP value iteration algorithms. We also apply HSVI to a new rover exploration problem 10 times larger than most POMDP problems in the literature.
Pages: 520-527
PS Link:
PDF Link: /papers/04/p520-smith.pdf
AUTHOR = "Trey Smith and Reid Simmons",
TITLE = "Heuristic Search Value Iteration for POMDPs",
BOOKTITLE = "Proceedings of the Twentieth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-04)",
ADDRESS = "Arlington, Virginia",
YEAR = "2004",
PAGES = "520--527"

hosted by DSL   •   site info   •   help