Abstract
High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the methodology that projects the belief state space to a low-dimensional one to alleviate the problem. In this paper, we propose a novel orthogonal non-negative matrix factorization (O-NMF) for the projection. The proposed O-NMF not only factors the belief state space by minimizing the reconstruction error, but also allows the compressed POMDP formulation to be efficiently computed (due to its orthogonality) in a value-directed manner so that the value function will take same values for corresponding belief states in the original and compressed state spaces. We have tested the proposed approach using a number of benchmark problems and the empirical results confirms its effectiveness in achieving substantial computational cost saving in policy computation.
Original language | English |
---|---|
Pages | 537-544 |
Number of pages | 8 |
DOIs | |
Publication status | Published - 2007 |
Event | 24th International Conference on Machine Learning, ICML 2007 - Corvalis, OR, United States Duration: 20 Jun 2007 → 24 Jun 2007 |
Conference
Conference | 24th International Conference on Machine Learning, ICML 2007 |
---|---|
Country/Territory | United States |
City | Corvalis, OR |
Period | 20/06/07 → 24/06/07 |
Scopus Subject Areas
- Software
- Human-Computer Interaction
- Computer Vision and Pattern Recognition
- Computer Networks and Communications