How Behavior Trees Modularize Hybrid Control Systems and Generalize Sequential Behavior Compositions, the Subsumption Architecture, and Decision Trees
Open accessThe 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
Cites
Statistics
Verification
Claims the paper makes
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
Petri nets: Properties, analysis and applications
Murata, T. (1989) · Proceedings of the IEEE · doi:10.1109/5.24143 · Cited by 10,606
A robust layered control system for a mobile robot
Brooks, R. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087032 · Cited by 7,799
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Letters to the editor: go to statement considered harmful
Dijkstra, E. W. (1968) · Communications of the ACM · doi:10.1145/362929.362947 · Cited by 1,026
Imitation in Animals and Artifacts
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/3676.001.0001 · Cited by 708
Sequential Composition of Dynamically Dexterous Robot Behaviors
Burridge, R. R., Rizzi, A. A., & Koditschek, D. E. (1999) · The International Journal of Robotics Research · doi:10.1177/02783649922066385 · Cited by 446
Artificial Intelligence for Games
Millington, I. (2009) · CRC Press eBooks · doi:10.1201/b13169 · Cited by 315
Sammut, C., Hurst, S., Kedzier, D., & Michie, D. (1992) · Machine Learning Proceedings 1992 · doi:10.1016/b978-1-55860-247-2.50055-3 · Cited by 275
Evolving Behaviour Trees for the Commercial Game DEFCON
Lim, C.-U., Baumgarten, R., & Colton, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12239-2_11 · Cited by 164
Increasing Modularity of UAV Control Systems using Computer Game Behavior Trees
Ögren, P. (2012) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2012-4458 · Cited by 157
Research works printed but not linked: 3
- isla, 2008, Halo 3-building a better battle, Proc Game Developers Conf
- rabin, 2014, The behavior tree starter kit in Game AI Pro, 73
- isla, 2005, Handling complexity in the Halo 2 AI, Proc Game Developers Conf
Cited by
Behavior Trees in Robotics and AI
Colledanchise, M., & Ögren, P. (2018) · CRC Press eBooks · doi:10.1201/9780429489105 · Cited by 526
Self-citationA survey of Behavior Trees in robotics and AI
Iovino, M., Scukins, E., Styrud, J., Ögren, P., & Smith, C. (2022) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2022.104096 · Cited by 306
Behavior Trees in Robotics and AI: An Introduction
Colledanchise, M., & Ögren, P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.00084 · Cited by 178
“Some of the results of this chapter were previously published in the journal paper [13].”
ResultSelf-citationTranzatto, M., Mascarich, F., Bernreiter, L., Godinho, C., Camurri, M., Khattak, S., Dang, T., Reijgwart, V., Loeje, J., Wisth, D., et al. (2022) · Field Robotics · doi:10.55417/fr.2022011 · Cited by 162
Learning of Behavior Trees for Autonomous Agents
Colledanchise, M., Parasuraman, R. N., & Ögren, P. (2018) · IEEE Transactions on Games · doi:10.1109/tg.2018.2816806 · Cited by 162
Self-citation
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
- green
- urn.kb.se
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: How Behavior Trees Modularize Hybrid Control Systems and Generalize Sequential Behavior Compositions, the Subsumption Architecture, and Decision Trees. https://app.cochat.ai/papers/10.1109/tro.2016.2633567
- The paper
- Colledanchise, M., & Ogren, P. (2017). How Behavior Trees Modularize Hybrid Control Systems and Generalize Sequential Behavior Compositions, the Subsumption Architecture, and Decision Trees. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2016.2633567
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.