Sciweavers

ECML
2004
Springer
13 years 9 months ago
Model Approximation for HEXQ Hierarchical Reinforcement Learning
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In ...
Bernhard Hengst
ATAL
2004
Springer
13 years 9 months ago
From Global Selective Perception to Local Selective Perception
This paper presents a reinforcement learning algorithm used to allocate tasks to agents in an uncertain real-time environment. In such environment, tasks have to be analyzed and a...
Sébastien Paquet, Nicolas Bernier, Brahim C...
CEEMAS
2005
Springer
13 years 10 months ago
Selection in Scale-Free Small World
Abstract. In this paper we compare our selection based learning algorithm with the reinforcement learning algorithm in Web crawlers. The task of the crawlers is to find new inform...
Zsolt Palotai, Csilla Farkas, András Lö...
SAC
2005
ACM
13 years 10 months ago
Reinforcement learning agents with primary knowledge designed by analytic hierarchy process
This paper presents a novel model of reinforcement learning agents. A feature of our learning agent model is to integrate analytic hierarchy process (AHP) into a standard reinforc...
Kengo Katayama, Takahiro Koshiishi, Hiroyuki Narih...
ICRA
2005
IEEE
140views Robotics» more  ICRA 2005»
13 years 10 months ago
Fast Reinforcement Learning for Vision-guided Mobile Robots
— This paper presents a new reinforcement learning algorithm for accelerating acquisition of new skills by real mobile robots, without requiring simulation. It speeds up Q-learni...
Tomás Martínez-Marín, Tom Duc...
ROBOCUP
2007
Springer
102views Robotics» more  ROBOCUP 2007»
13 years 10 months ago
Heuristic Reinforcement Learning Applied to RoboCup Simulation Agents
This paper describes the design and implementation of robotic agents for the RoboCup Simulation 2D category that learns using a recently proposed Heuristic Reinforcement Learning a...
Luiz A. Celiberto, Carlos H. C. Ribeiro, Anna Hele...
ICML
2003
IEEE
14 years 5 months ago
Q-Decomposition for Reinforcement Learning Agents
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
Stuart J. Russell, Andrew Zimdars
ICML
2005
IEEE
14 years 5 months ago
Learning to compete, compromise, and cooperate in repeated general-sum games
Learning algorithms often obtain relatively low average payoffs in repeated general-sum games between other learning agents due to a focus on myopic best-response and one-shot Nas...
Jacob W. Crandall, Michael A. Goodrich