D-CIS Publication Database

Publication

Type of publication:Inproceedings
Entered by:JOSM
TitleQ-value Heuristics for Approximate Solutions of Dec-POMDPs
Bibtex cite IDoliehoek2007gtdt
Booktitle Proceedings of the AAAI Spring Symposium on Game Theoretic and Decision Theoretic Agents (GTDT 2007)
Year published 2007
Month March
Pages 31-37
Location 26-28 March 2007, Standford University, California, USA
Keywords Q-value,solutions,Dec-POMDPs
Abstract
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.
Authors
Oliehoek, Frans
Vlassis, Nikos
Topics
=SEE CLASSIFICATION DIFFERENCE FROM OTHERS=
BibTeXBibTeX
RISRIS
Attachments
 
Total mark: 5