Sciweavers

252 search results - page 9 / 51
» Learning Partially Observable Action Models: Efficient Algor...
Sort
View
AAAI
2008
15 years 1 months ago
Efficient Learning of Action Schemas and Web-Service Descriptions
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
Thomas J. Walsh, Michael L. Littman
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
15 years 6 months ago
Unsupervised learning of 3D object models from partial views
— We present an algorithm for learning 3D object models from partial object observations. The input to our algorithm is a sequence of 3D laser range scans. Models learned from th...
Michael Ruhnke, Bastian Steder, Giorgio Grisetti, ...
IJCAI
2001
15 years 1 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
IDEAL
2004
Springer
15 years 5 months ago
Generating and Applying Rules for Interval Valued Fuzzy Observations
Abstract. One of the objectives of intelligent data engineering and automated learning is to develop algorithms that learn the environment, generate rules, and take possible course...
André de Korvin, Chenyi Hu, Ping Chen
105
Voted
HRI
2007
ACM
15 years 3 months ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy