23 search results - page 2 / 5 » The Cross-Entropy Method for Policy Search in Decentralized ... |
UAI
2000
13 years 6 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
IJCAI
2003
13 years 6 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
AIPS
2008
13 years 7 months ago
2008
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
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 ...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...