Abstract
A technique called Time Hopping is proposed for speeding up reinforcement learning algorithms. It is applicable to continuous optimization problems running in computer simulations. Making shortcuts in time by hopping between distant states combined with off-policy reinforcement learning allows the technique to maintain higher learning rate. Experiments on a simulated biped crawling robot confirm that Time Hopping can accelerate the learning process more than seven times.
| Original language | English |
|---|---|
| Pages (from-to) | 42-59 |
| Number of pages | 18 |
| Journal | Cybernetics and Information Technologies |
| Volume | 11 |
| Issue number | 3 |
| Publication status | Published - 2011 |
| Externally published | Yes |
Keywords
- Biped robot
- Computer simulation
- Discrete time systems
- Optimization methods
- Reinforcement learning
Fingerprint
Dive into the research topics of 'Time hopping technique for faster reinforcement learning in simulations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver