CoChat

How Behavior Trees Modularize Hybrid Control Systems and Generalize Sequential Behavior Compositions, the Subsumption Architecture, and Decision Trees

Open access
Colledanchise, Michele, Ogren, Petter · 2017 · IEEE Transactions on Robotics

The DOI matches its Crossref record; 22 of the 23 references it cites were found in a registry or an index.

Abstract

Behavior trees (BTs) are a way of organizing the switching structure of a hybrid dynamical system (HDS), which was originally introduced in the computer game programming community. In this paper, we analyze how the BT representation increases the modularity of an HDS and how key system properties are preserved over compositions of such systems, in terms of combining two BTs into a larger one. We also show how BTs can be seen as a generalization of sequential behavior compositions, the subsumption architecture, and decisions trees. These three tools are powerful but quite different, and the fact that they are unified in a natural way in BTs might be a reason for their popularity in the gaming community. We conclude the paper by giving a set of examples illustrating how the proposed analysis tools can be applied to robot control BTs.

Overview

Integrity signals

Registry

Crossref · 10.1109/tro.2016.2633567

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

The text we found for this paper looks like another document, so its claims and self-check weren’t run. The registry and citation checks still apply.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The text we found for this paper looks like another document, so the self-check wasn’t run.

Citations

Cites

Show all 22 references

Research works printed but not linked: 3

  1. isla, 2008, Halo 3-building a better battle, Proc Game Developers Conf
  2. rabin, 2014, The behavior tree starter kit in Game AI Pro, 73
  3. isla, 2005, Handling complexity in the Halo 2 AI, Proc Game Developers Conf

Cited by

Items 201–270 of 270

Metadata

Authors
Colledanchise, M., & Ogren, P.
Affiliations
KTH Royal Institute of Technology (SE)
Venue
IEEE Transactions on Robotics
Published
2017-04
Volume
33
Issue
2
Pages
372-389
ISSN
  • 1552-3098 (ISSN-L)
  • 1941-0468
OpenAlex
W2567075875
Cited by
209
References
23
Citations by year
2026: 22 · 2025: 14 · 2024: 28 · 2023: 23 · 2022: 25 · 2021: 30 · 2020: 27 · 2019: 15 · 2018: 21 · 2017: 4
FWCI
10.98
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Robotics (publishedVersion)
  • KTH Publication Database DiVA (KTH Royal Institute of Technology) (submittedVersion, other-oa)
Funders
  • SARAFun project
  • EU (H2020, H2020-ICT-2014/H2020-ICT-2014-1, 644938)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
Keywords
behavior trees, hybrid dynamical systems, modularity, behavior composition, subsumption architecture, decision tree, robot control, switching structure, game AI

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

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.