656 search results - page 49 / 132 » Complexity of finite-horizon Markov decision process problem... |
130
click to vote
AAAI
1996
15 years 3 months ago
1996
Markov decision processes (MDPs) are a very popular tool for decision theoretic planning (DTP), partly because of the welldeveloped, expressive theory that includes effective solu...
119
click to vote
ICARCV
2008
IEEE
15 years 8 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
108
click to vote
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the st...
109
click to vote
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
120
click to vote
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
—We consider opportunistic communications over multiple channels where the state (“good” or “bad”) of each channel evolves as independent and identically distributed Mark...