Sciweavers

166 search results - page 17 / 34
» Safe exploration for reinforcement learning
Sort
View
CIG
2006
IEEE
14 years 2 months ago
Monte-Carlo Go Reinforcement Learning Experiments
Abstract— This paper describes experiments using reinforcement learning techniques to compute pattern urgencies used during simulations performed in a Monte-Carlo Go architecture...
Bruno Bouzy, Guillaume Chaslot
ECAI
2008
Springer
13 years 10 months ago
Reinforcement Learning with the Use of Costly Features
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
Robby Goetschalckx, Scott Sanner, Kurt Driessens
NIPS
1996
13 years 10 months ago
Reinforcement Learning for Mixed Open-loop and Closed-loop Control
Closed-loop control relies on sensory feedback that is usually assumed to be free. But if sensing incurs a cost, it may be coste ective to take sequences of actions in open-loop m...
Eric A. Hansen, Andrew G. Barto, Shlomo Zilberstei...
IJCAI
2001
13 years 10 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
ATAL
2008
Springer
13 years 10 months ago
Efficient multi-agent reinforcement learning through automated supervision
Multi-Agent Reinforcement Learning (MARL) algorithms suffer from slow convergence and even divergence, especially in large-scale systems. In this work, we develop a supervision fr...
Chongjie Zhang, Sherief Abdallah, Victor R. Lesser