Proceedings

An Improved Grid-Based Approximation Algorithm for POMDPs

Download BibTeX Cite

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 707-715.

Abstract

Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable. This motivates work on approximation algorithms, and grid-based approximation is a widely-used approach. We describe a novel approach to grid-based approximation that uses a variable-resolution regular grid, and show that it outperforms previous grid-based approaches to approximation.

Rong Zhou, and Eric A. Hansen. 2001. An Improved Grid-Based Approximation Algorithm for POMDPs. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 707–715. https://ijcai.org/proceedings/2001/97
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards