Publications

• Sorted by Date • Classified by Publication Type • Classified by Research Category •

Q-value functions for decentralized POMDPs

Frans A. Oliehoek and Nikos Vlassis. Q-value functions for decentralized POMDPs. In Proceedings of the Sixth International Conference on Autonomous Agents and Multiagent Systems, pp. 833–840, May 2007.

Download

pdf [171.2kB]  ps.gz [163.9kB]  

Abstract

Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by dynamic programming, and then a policy is extracted from this value function. In this paper we study whether similar Q-value functions can be defined in decentralized POMDP models (Dec-POMDPs), what the cost of computing such value functions is, and how policies can be extracted from such value functions. Using the framework of Bayesian games, we argue that searching for the optimal Q-value function may be as costly as exhaustive policy search. Then we analyze various approximate Q-value functions that allow efficient computation. Finally, we describe a family of algorithms for extracting policies from such Q-value functions.

BibTeX Entry

@InProceedings{Oliehoek07AAMAS,
    author =       {Frans A. Oliehoek and Nikos Vlassis},
    title =        {Q-value functions for decentralized {POMDP}s},
    booktitle =    aamas07,
    month =        may,
    year =         2007,
    pages =        {833--840},
    abstract = 	 {
    Planning in single-agent models like MDPs and POMDPs can be carried
    out by resorting to Q-value functions: a (near-) optimal Q-value 
    function is computed in a recursive manner by dynamic programming, 
    and then a policy is extracted from this value function. In this 
    paper we study whether similar Q-value functions can be defined 
    in decentralized POMDP models (Dec-POMDPs), what the cost of 
    computing such value functions is, and how policies can be 
    extracted from such value functions. Using the framework of 
    Bayesian games, we argue that searching for the optimal Q-value 
    function may be as costly as exhaustive policy search. Then we 
    analyze various approximate Q-value functions that allow efficient
    computation. Finally, we describe a family of algorithms for 
    extracting policies from such Q-value functions. 
    }
}

Generated by bib2html.pl (written by Patrick Riley) on Wed Nov 06, 2013 16:37:07 UTC