46 search results - page 3 / 10 » A Sparse Sampling Algorithm for Near-Optimal Planning in Lar... |
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
ECML
2005
Springer
13 years 11 months ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
UAI
2000
13 years 6 months ago
2000
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
AAAI
2011
12 years 5 months ago
2011
In environmental and natural resource planning domains actions are taken at a large number of locations over multiple time periods. These problems have enormous state and action s...