Frans A. Oliehoek, Nikos Vlassis
The Dec-POMDP is a model for multi-agent planning under uncertainty that has received increasingly more attention over the recent years. In this work we propose a new heuristic QBG that can be used in various algorithms for Dec-POMDPs and describe differences and similarities with QMDP and QPOMDP. An experimental evaluation shows that, at the price of some computation, QBG gives a consistently tighter upper bound to the maximum value obtainable.
Subjects: 7.1 Multi-Agent Systems; 1.11 Planning
Submitted: Jan 26, 2007