Sciweavers

85 search results - page 14 / 17
» Solving Stochastic Planning Problems with Large State and Ac...
Sort
View
CG
1998
Springer
13 years 11 months ago
Relevance Cuts: Localizing the Search
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
Andreas Junghanns, Jonathan Schaeffer
UAI
2008
13 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
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...
Richard S. Sutton, Csaba Szepesvári, Alborz...
AIPS
2006
13 years 8 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
14 years 29 days ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart
AIIA
2007
Springer
14 years 1 months ago
Reinforcement Learning in Complex Environments Through Multiple Adaptive Partitions
The application of Reinforcement Learning (RL) algorithms to learn tasks for robots is often limited by the large dimension of the state space, which may make prohibitive its appli...
Andrea Bonarini, Alessandro Lazaric, Marcello Rest...