Distribution over Beliefs for Memory Bounded Dec-POMDP Planning
classification
💻 cs.AI
keywords
beliefsboundeddec-pomdpplanningapproachesapproximatechoicechoose
read the original abstract
We propose a new point-based method for approximate planning in Dec-POMDP which outperforms the state-of-the-art approaches in terms of solution quality. It uses a heuristic estimation of the prior probability of beliefs to choose a bounded number of policy trees: this choice is formulated as a combinatorial optimisation problem minimising the error induced by pruning.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.