Q-value Heuristics for Approximate Solutions of Dec-POMDPs

Game Theoretic and Decision Theoretic Agents

Volume

Papers from the 2007 AAAI Spring Symposium

Contents

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.