Sciweavers

11 search results - page 2 / 3
» Finding State Similarities for Faster Planning
Sort
View
ICTAI
2000
IEEE
14 years 2 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
IJCAI
2003
14 years 6 days ago
A Planning Algorithm for Predictive State Representations
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
Masoumeh T. Izadi, Doina Precup
FLAIRS
2001
14 years 7 days ago
Probabilistic Planning for Behavior-Based Robots
Partially Observable Markov Decision Process models (POMDPs) have been applied to low-level robot control. We show how to use POMDPs differently, namely for sensorplanning in the ...
Amin Atrash, Sven Koenig
ICIP
2001
IEEE
15 years 13 days ago
EM algorithms of Gaussian mixture model and hidden Markov model
The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Mo...
Guorong Xuan, Wei Zhang, Peiqi Chai
CHI
2005
ACM
14 years 11 months ago
Stencils-based tutorials: design and evaluation
Users of traditional tutorials and help systems often have difficulty finding the components described or pictured in the procedural instructions. Users also unintentionally miss ...
Caitlin Kelleher, Randy Pausch