28 search results - page 2 / 6 » Partitioned Linear Programming Approximations for MDPs |
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 ...
NIPS
2001
13 years 6 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
IJCAI
2003
13 years 6 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
ICML
2002
IEEE
14 years 6 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...