Prediction-Directed Compression of POMDPs

Boularias, A; Izadi, M; Chaib-Draa, B

doi:10.1109/ICMLA.2008.115

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Prediction-Directed Compression of POMDPs

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4724961
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Boularias, A., Izadi, M., & Chaib-Draa, B. (2008). Prediction-Directed Compression of POMDPs. In A. Wani, X.-W. Chen, D. Casasent, L. Kurgan, T. Hu, & K. Hafeez (Eds.), 2008 Seventh International Conference on Machine Learning and Applications (pp. 99-105). Piscataway, NJ, USA: IEEE.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-C639-8

Abstract

High dimensionality of belief space in partially observable Markov decision processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. Previous studies have demonstrated that the dimensionality of a POMDP can eventually be reduced by transforming it into an equivalent predictive state representation (PSR). In this paper, we address the problem of finding an approximate and compact PSR model corresponding to a given POMDP model. We formulate this problem in an optimization framework. Our algorithm tries to minimize the potential error that missing some core tests may cause. We also present an empirical evaluation on benchmark problems, illustrating the performance of this approach.