58 search results - page 3 / 12 » Approximate Solution Techniques for Factored First-Order MDP... |
AIPS
2004
13 years 6 months ago
2004
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
AAAI
2010
13 years 6 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
ATAL
2003
Springer
13 years 10 months ago
2003
Springer
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
AAAI
1998
13 years 6 months ago
1998
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
AAAI
2007
13 years 7 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...