283 search results - page 7 / 57 » Abstracting Reusable Cases from Reinforcement Learning |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
-- Mobile agents research is clearly aiming towards imposing agent based development as the next generation of tools for writing software. This paper comes with its own contributio...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— The goal of developing algorithms for programming robots by demonstration is to create an easy way of programming robots that can be accomplished by everyone. When a de...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...
AAAI
1993
13 years 10 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
ICML
1998
IEEE
14 years 9 months ago
1998
IEEE
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...