DeepAI
Log In Sign Up

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

02/06/2013
by   Anthony R. Cassandra, et al.
0

Most exact algorithms for general partially observable Markov decision processes (POMDPs) use a form of dynamic programming in which a piecewise-linear and convex representation of one value function is transformed into another. We examine variations of the "incremental pruning" method for solving this problem and compare them to earlier algorithms from theoretical and empirical perspectives. We find that incremental pruning is presently the most efficient exact method for solving POMDPs.

READ FULL TEXT
01/30/2013

Planning with Partially Observable Markov Decision Processes: Advances in Exact Solution Method

There is much interest in using partially observable Markov decision pro...
07/11/2012

Region-Based Incremental Pruning for POMDPs

We present a major improvement to the incremental pruning algorithm for ...
01/16/2014

An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs

Decentralized planning in uncertain environments is a complex task gener...
02/04/2014

Incremental Clustering and Expansion for Faster Optimal Planning in Dec-POMDPs

This article presents the state-of-the-art in optimal solution methods f...
02/14/2012

Symbolic Dynamic Programming for Discrete and Continuous State MDPs

Many real-world decision-theoretic planning problems can be naturally mo...
11/01/1997

A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains

Partially observable Markov decision processes (POMDPs) are a natural mo...
11/05/2020

Mixed Nondeterministic-Probabilistic Interfaces

Interface theories are powerful frameworks supporting incremental and co...