Sciweavers

111 search results - page 13 / 23
» A Planning Algorithm for Predictive State Representations
Sort
View
SIGIR
2012
ACM
11 years 10 months ago
Search, interrupted: understanding and predicting search task continuation
Many important search tasks require multiple search sessions to complete. Tasks such as travel planning, large purchases, or job searches can span hours, days, or even weeks. Inev...
Eugene Agichtein, Ryen W. White, Susan T. Dumais, ...
AAAI
2011
12 years 7 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
AAAI
1997
13 years 8 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
14 years 2 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
RSS
2007
176views Robotics» more  RSS 2007»
13 years 9 months ago
Active Policy Learning for Robot Planning and Exploration under Uncertainty
Abstract— This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes. The algorithm is tested i...
Ruben Martinez-Cantin, Nando de Freitas, Arnaud Do...