14 search results - page 1 / 3 » On-Line Search for Solving Markov Decision Processes via Heu... |
121
Voted
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
113
Voted
JAIR
2000
15 years 28 days ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
105
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
107
Voted
AIPS
2000
15 years 2 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
106
Voted
JAIR
2006
15 years 1 months ago
2006
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...