17 search results - page 1 / 4 » Linear Time Near-Optimal Planning in the Blocks World |
AAAI
1996
13 years 5 months ago
1996
ML
2002
ACM
13 years 4 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
AIPS
2009
13 years 5 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
UAI
2008
13 years 5 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...