The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Behavior Trees in Robotics and AI
Abstract
Behavior Trees (BTs) provide a way to structure the behavior of an artificial agent such as a robot or a non-player character in a computer game. Traditional design methods, such as finite state machines, are known to produce brittle behaviors when complexity increases, making it very hard to add features without breaking existing functionality. BTs were created to address this very problem, and enables the creation of systems that are both modular and reactive. Behavior Trees in Robotics and AI: An Introduction provides a broad introduction as well as an in-depth exploration of the topic, and is the first comprehensive book on the use of BTs. This book introduces the subject of BTs from simple topics, such as semantics and design principles, to complex topics, such as learning and task planning. For each topic, the authors provide a set of examples, ranging from simple illustrations to realistic complex behaviors, to enable the reader to successfully combine theory with practice. Starting with an introduction to BTs, the book then describes how BTs relate to, and in many cases, generalize earlier switching structures, or control architectures. These ideas are then used as a foundation for a set of efficient and easy to use design principles. The book then presents a set of important extensions and provides a set of tools for formally analyzing these extensions using a state space formulation of BTs. With the new analysis tools, the book then formalizes the descriptions of how BTs generalize earlier approaches and shows how BTs can be automatically generated using planning and learning. The final part of the book provides an extended set of tools to capture the behavior of Stochastic BTs, where the outcomes of actions are described by probabilities. These tools enable the computation of both success probabilities and time to completion. This book targets a broad audience, including both students and professionals interested in modeling complex behaviors for robots, game characters, or other AI agents. Readers can choose at which depth and pace they want to learn the subject, depending on their needs and background.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
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
Statecharts: a visual formalism for complex systems
Harel, D. (1987) · Science of Computer Programming · doi:10.1016/0167-6423(87)90035-9 · Cited by 6,751
Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
Sutton, R. S., Precup, D., & Singh, S. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00052-1 · Cited by 3,119
Convergence analysis of canonical genetic algorithms
Rudolph, G. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265964 · Cited by 1,484
Gedanken-Experiments on Sequential Machines
Moore, E. F. (1956) · Automata Studies. (AM-34) · doi:10.1515/9781400882618-006 · Cited by 1,387
Brooks, R. A. (1990) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(05)80025-9 · Cited by 1,354
Junior: The Stanford entry in the Urban Challenge
Montemerlo, M., Becker, J., Bhat, S., Dahlkamp, H., Dolgov, D., Ettinger, S., Haehnel, D., Hilden, T., Hoffmann, G., Huhnke, B., et al. (2008) · Journal of Field Robotics · doi:10.1002/rob.20258 · Cited by 1,027
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
Cited by
Principles and Guidelines for Evaluating Social Robot Navigation Algorithms
Francis, A., Pérez-D’Arpino, C., Li, C., Xia, F., Alahi, A., Alami, R., Bera, A., Biswas, A., Biswas, J., Chandra, R., et al. (2025) · ACM Transactions on Human-Robot Interaction · doi:10.1145/3700599 · Cited by 107
AgentAI: A comprehensive survey on autonomous agents in distributed AI for industry 4.0
Piccialli, F., Chiaro, D., Sarwar, S., Cerciello, D., Qi, P., & Mele, V. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.128404 · Cited by 77
Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics
Pezzato, C., Corbato, C. H., Bonhof, S., & Wisse, M. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3226144 · Cited by 44
“We now describe the high level concepts at the basis of Behavior Trees according to previous work such as [3], [24].”
BackgroundMethodCommunicating Missing Causal Information to Explain a Robot’s Past Behavior
Han, Z., & Yanco, H. (2023) · ACM Transactions on Human-Robot Interaction · doi:10.1145/3568024 · Cited by 11
Metadata
- Authors
- Colledanchise, M., & Ögren, P.
- Venue
- CRC Press eBooks
- Publisher
- CRC Press
- Published
- 2018-07-20
- OpenAlex
- W3145123113
- Cited by
- 526
- References
- 47
- Type
- reference entry
- Language
- en
- Open access
- closed
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: Behavior Trees in Robotics and AI. https://app.cochat.ai/papers/10.1201/9780429489105
- The paper
- Colledanchise, M., & Ögren, P. (2018). Behavior Trees in Robotics and AI. CRC Press eBooks. https://doi.org/10.1201/9780429489105
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.