Using core beliefs for point-based value iteration
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1751-1752.
Abstract
Recent research on point-based approximation algorithms for POMDPs demonstrated that good solutions to POMDP problems can be obtained without considering the entire belief simplex. For instance, the Point Based Value Iteration (PBVI) algorithm [Pineau et al., 2003] computes the value function only for a small set of belief states and iteratively adds more points to the set as needed. A key component of the algorithm is the strategy for selecting belief points, such that the space of reachable beliefs is well covered. This paper presents a new method for selecting an initial set of representative belief points, which relies on finding first the basis for the reachable belief simplex. Our approach has better worst-case performance than the original PBVI heuristic, and performs well in several standard POMDP tasks.
@inproceedings{ijcai2005p310,
title = {Using core beliefs for point-based value iteration},
author = {Izadi, Masoumeh T. and Rajwade, Ajit V. and Precup, Doina},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1751--1752},
year = {2005},
url = {https://ijcai.org/proceedings/2005/310},
}
TY - CPAPER TI - Using core beliefs for point-based value iteration AU - Izadi, Masoumeh T. AU - Rajwade, Ajit V. AU - Precup, Doina T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1751 EP - 1752 UR - https://ijcai.org/proceedings/2005/310 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
