29 search results - page 1 / 6 » Action Refinement in Reinforcement Learning by Probability S... |
ICML
2002
IEEE
14 years 5 months ago
2002
IEEE
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
FLAIRS
2004
13 years 6 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
ICML
2003
IEEE
14 years 5 months ago
2003
IEEE
We consider incorporating action elimination procedures in reinforcement learning algorithms. We suggest a framework that is based on learning an upper and a lower estimates of th...
ICRA
2009
IEEE
13 years 11 months ago
2009
IEEE
— Our goal in this work is to make high level decisions for mobile robots. In particular, given a queue of prioritized object delivery tasks, we wish to find a sequence of actio...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
We introduce flexible algorithms that can automatically learn mappings from images to actions by interacting with their environment. They work by introducing an image classifier i...