202 search results - page 19 / 41 » Comments on the Origin and Application of Markov Decision Pr... |
117
click to vote
AAAI
2008
15 years 4 months ago
2008
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
109
click to vote
ICML
2003
IEEE
16 years 2 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...
118
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...
140
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
163
click to vote
ICTAI
2006
IEEE
15 years 8 months ago
2006
IEEE
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...