58 search results - page 1 / 12 » Approximate Solution Techniques for Factored First-Order MDP... |
89
Voted
AIPS
2007
15 years 16 days ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
IJCAI
2001
14 years 11 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
AIPS
2009
14 years 11 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
89
Voted
AMAI
2006
Springer
14 years 10 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
93
Voted
SIAMNUM
2011
14 years 5 months ago
2011
We introduce a new mixed method for the biharmonic problem. The method is based on a formulation where the biharmonic problem is re-written as a system of four first-order equatio...