656 search results - page 14 / 132 » Complexity of finite-horizon Markov decision process problem... |
109
Voted
UAI
2000
15 years 3 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
124
click to vote
ICTAI
2000
IEEE
15 years 5 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
113
click to vote
IJCAI
2007
15 years 3 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
121
Voted
FLAIRS
2008
15 years 4 months ago
2008
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— We consider decision making in a Markovian setup where the reward parameters are not known in advance. Our performance criterion is the gap between the performance of the best ...