Spaan, M.T.J. and Vlassis, N. (2005)
"Perseus: Randomized Point-based Value Iteration for POMDPs",
Volume 24, pages 195-220.
For quick access via your WWW browser, use this URL:
http://www.jair.org/abstracts/spaan05a.html
Abstract:
Partially observable Markov decision processes (POMDPs) form an
attractive and principled framework for agent planning under
uncertainty. Point-based approximate techniques 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 algorithm 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.
The article is available via:
-- comp.ai.jair.papers (also see comp.ai.jair.announce)
-- World Wide Web: The URL for our World Wide Web server is
http://www.jair.org/
For direct access to this article and related files try:
http://www.jair.org/abstracts/spaan05a.html
-- Anonymous FTP from Carnegie-Mellon University (USA):
ftp://ftp.cs.cmu.edu/project/jair/volume24/spaan05a.ps
The compressed PostScript file is named spaan05a.ps.Z
For more information about JAIR, visit our WWW or FTP sites, or
contact jai...@isi.edu
--
Steven Minton
JAIR Managing Editor