Perseus: Randomized point-based value iteration for POMDPs
Matthijs T. J. Spaan, Nikos Vlassis · UvA-DARE (University of Amsterdam) · 2005
Partially observable Markov decision processes (POMDPs) form an attractive and prin-cipled framework for agent planning under uncertainty. Point-based approximate tech-niques for POMDPs compute a policy based on a finite set of points collected in advance from the agent’s belief space. We present a randomized point-based value iteration algo-rithm called Perseus. The algorithm performs approximate value backup stages, ensuring that in each backup stage the value of each point in the belief set is improved; the key observation is that a single backup may improve the value of many belief points. Contrary to other point-based methods, Perseus backs up only a (randomly selected) subset of points in the belief set, sufficient for improving the value of each belief point in the set. We show how the same idea can be extended to dealing with continuous action spaces. Experimental results show the potential of Perseus in large scale POMDP problems. 1.