Scaling up: solving POMDPs through value based clustering

Authors:
Yan Virin;Guy Shani;Solomon E. Shimony;Ronen I. Brafman
Affiliations:
-;-;-;-
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Year:
2007

Citing 4
Cited 1

Heuristic search value iteration for POMDPs

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Perseus: randomized point-based value iteration for POMDPs

Journal of Artificial Intelligence Research
Point-based value iteration: an anytime algorithm for POMDPs

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Prioritizing point-based POMDP solvers

ECML'06 Proceedings of the 17th European conference on Machine Learning

Value-based observation compression for DEC-POMDPs

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present here a point-based value iteration algorithm for solving POMDPs, that orders belief state backups smartly based on a clustering of the underlying MDP states. We show our SCVI algorithm to converge faster than state of the art point-based algorithms.