Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
Abstract
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.
Cite
Text
Cassandra et al. "Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes." Conference on Uncertainty in Artificial Intelligence, 1997.Markdown
[Cassandra et al. "Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes." Conference on Uncertainty in Artificial Intelligence, 1997.](https://mlanthology.org/uai/1997/cassandra1997uai-incremental/)BibTeX
@inproceedings{cassandra1997uai-incremental,
title = {{Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes}},
author = {Cassandra, Anthony R. and Littman, Michael L. and Zhang, Nevin Lianwen},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1997},
pages = {54-61},
url = {https://mlanthology.org/uai/1997/cassandra1997uai-incremental/}
}