656 search results - page 73 / 132 » Complexity of finite-horizon Markov decision process problem... |
103
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
119
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
147
click to vote
FLAIRS
2008
15 years 4 months ago
2008
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
140
click to vote
NIPS
2007
15 years 3 months ago
2007
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
110
click to vote
JMLR
2006
15 years 1 months ago
2006
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...