Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

72

UAI
1997

favoriteEmaildiscussreport

84views Artificial Intelligence» more UAI 1997»

Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes

15 years 10 days ago

Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes

Download www.sci.brooklyn.cuny.edu

Anthony R. Cassandra, Michael L. Littman, Nevin Li

Real-time Traffic

UAI 1997 | UAI 2008 |

claim paper

Related Content

» Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes

» ValueFunction Approximations for Partially Observable Markov Decision Processes

» TreeBased Solution Methods for Multiagent POMDPs with Delayed Communication

» Pointbased incremental pruning heuristic for solving finitehorizon DECPOMDPs

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1997
Where	UAI
Authors	Anthony R. Cassandra, Michael L. Littman, Nevin Lianwen Zhang

Comments (0)