Cited by 15Reinforcement Learning in RoboticsAI-based Problem Solving and PlanningMachine Learning and Algorithms

The DOI matches its Crossref record.

Horde: a scalable real-time architecture for learning knowledge from unsupervised sensorimotor interaction

Sutton, Richard S., Modayil, Joseph, Delp, Michael, Degris, Thomas, Pilarski, Patrick M., White, Adam, Precup, Doina·2011·International Joint Conference on Autonomous Agents and Multiagent Systems

Abstract

Maintaining accurate world knowledge in a complex and changing environment is a perennial problem for robots and other artificial intelligence systems. Our architecture for addressing this problem, called Horde, consists of a large number of independent reinforcement learning sub-agents, or demons. Each demon is responsible for answering a single predictive or goal-oriented question about the world, thereby contributing in a factored, modular way to the system's overall knowledge. The questions are in the form of a value function, but each demon has its own policy, reward function, termination function, and terminal-reward function unrelated to those of the base problem. Learning proceeds in parallel by all demons simultaneously so as to extract the maximal training information from whatever actions are taken by the system as a whole. Gradient-based temporal-difference learning methods are used to learn efficiently and reliably with function approximation in this off-policy setting. Horde runs in constant time and memory per time step, and is thus suitable for learning online in real-time applications such as robotics. We present results using Horde on a multi-sensored mobile robot to successfully learn goal-oriented behaviors and long-term predictions from off-policy experience. Horde is a significant incremental step towards a real-time architecture for efficient learning of general knowledge from unsupervised sensorimotor interaction.

Overview

Integrity signals

Registry

Crossref · 10.65109/qdhn7183

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Several formal frameworks capture aspects of action-perception coupling by enabling agents to anticipate how sensory inputs evolve under their actions, including General Value Functions, Predictive State Representations, Partially Observable Markov Decision Processes, and world models.

    “Complementing these approaches, several formal frameworks capture aspects of action-perception coupling by enabling agents to anticipate how sensory inputs evolve under their actions, and by treating action, observation, and internal state as mutually dependent. This includes General Value Functions (Sutton et al., 2011), Predictive State Representations (Littman et al., 2002), Partially Observa”

    From Toward Enactive Artificial Intelligence (2026) · cites this paper as Sutton et al., 2011

Citations

Cited by

Sorted by citations

Metadata

Authors
Sutton, R. S., Modayil, J., Delp, M., Degris, T., Pilarski, P. M., White, A., & Precup, D.
Affiliations
  • University of Alberta (CA)
  • McGill University (CA)
Venue
International Joint Conference on Autonomous Agents and Multiagent Systems
Published
2011-05-02
Pages
761-768
ISSN
  • 1548-8403 (ISSN-L)
  • 1558-2914
OpenAlex
W7124150245
Cited by
15
References
0
Citations by year
2026: 7 · 2024: 2 · 2023: 2 · 2021: 2 · 2019: 2
FWCI
0.00
Type
conference paper
Language
en
Open access
closed
Locations
Adaptive Agents and Multi-Agents Systems (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
Keywords
real-time learning, multi-agent reinforcement learning, demons, off-policy learning, temporal difference learning, function approximation, goal-directed behavior, long-term forecasting, mobile robot learning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review