Sciweavers

47 search results - page 2 / 10
» Average-Reward Decentralized Markov Decision Processes
Sort
View
ICML
2001
IEEE
14 years 5 months ago
Continuous-Time Hierarchical Reinforcement Learning
Hierarchical reinforcement learning (RL) is a general framework which studies how to exploit the structure of actions and tasks to accelerate policy learning in large domains. Pri...
Mohammad Ghavamzadeh, Sridhar Mahadevan
WSC
2008
13 years 7 months ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi
ATAL
2003
Springer
13 years 10 months ago
Transition-independent decentralized markov decision processes
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
UAI
2000
13 years 6 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
12 years 12 months ago
A dynamic programming algorithm for decentralized Markov decision processes with a broadcast structure
We give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov decision processes (MDPs). We consider problems with a broadcast informati...
Jeff Wu, Sanjay Lall