Sciweavers

252 search results - page 26 / 51
» Learning Partially Observable Action Models: Efficient Algor...
Sort
View
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
15 years 8 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
133
Voted
JAIR
2002
120views more  JAIR 2002»
15 years 2 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling
118
Voted
ICML
2010
IEEE
15 years 3 months ago
Generalizing Apprenticeship Learning across Hypothesis Classes
This paper develops a generalized apprenticeship learning protocol for reinforcementlearning agents with access to a teacher who provides policy traces (transition and reward obse...
Thomas J. Walsh, Kaushik Subramanian, Michael L. L...
111
Voted
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 15 days ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
AAAI
2010
15 years 4 months ago
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
Miquel Ramírez, Hector Geffner