Reference : The cross-entropy method for policy search in decentralized POMDPs
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/3365
The cross-entropy method for policy search in decentralized POMDPs
English
Oliehoek, F. A. [> >]
Kooij, J. F. P. [> >]
Vlassis, Nikos mailto [Technical University of Crete > Dept. of Production Engineering and Management]
2008
Informatica
IOS Press
32
4
341-357
Yes (verified by ORBilu)
0868-4952
[en] multiagent planning ; decentralized POMDPs ; combinatorial optimization
[en] Decentralized POMDPs (Dec-POMDPs) are becoming increasingly popular as models for multiagent planning under uncertainty, but solving a Dec-POMDP exactly is known to be an intractable combinatorial optimization problem. In this paper we apply the Cross-Entropy (CE) method, a recently introduced method for combinatorial optimization, to Dec-POMDPs, resulting in a randomized (sampling-based) algorithm for approximately solving Dec-POMDPs. This algorithm operates by sampling pure policies from an appropriately parametrized stochastic policy, and then evaluates these policies either exactly or approximately in order to define the next stochastic policy to sample from, and so on until convergence. Experimental results demonstrate that the CE method can search huge spaces efficiently, supporting our claim that combinatorial optimization methods can bring leverage to the approximate solution of Dec-POMDPs.
http://hdl.handle.net/10993/3365
also: http://hdl.handle.net/10993/11035
http://www.informatica.si/index.php/informatica/article/view/208

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
download.pdfAuthor postprint322.15 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.