Sciweavers

448 search results - page 36 / 90
» Abstraction in Predictive State Representations
Sort
View
ECCV
2000
Springer
15 years 2 months ago
How Does CONDENSATION Behave with a Finite Number of Samples?
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
Oliver D. King, David A. Forsyth
UAI
1998
14 years 11 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
EWCBR
2008
Springer
14 years 11 months ago
Situation Assessment for Plan Retrieval in Real-Time Strategy Games
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
Kinshuk Mishra, Santiago Ontañón, As...
AAAI
2011
13 years 9 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
AIPS
2008
15 years 5 days ago
The Compression Power of Symbolic Pattern Databases
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
Marcel Ball, Robert C. Holte