The DOI matches its Crossref record; 38 of the 39 references it cites were found in a registry or an index.
Towards Blended Reactive Planning and Acting using Behavior Trees
Open accessAbstract
In this paper, we show how a planning algorithm can be used to automatically create and update a Behavior Tree (BT), controlling a robot in a dynamic environment. The planning part of the algorithm is based on the idea of back chaining. Starting from a goal condition we iteratively select actions to achieve that goal, and if those actions have unmet preconditions, they are extended with actions to achieve them in the same way. The fact that BTs are inherently modular and reactive makes the proposed solution blend acting and planning in a way that enables the robot to effectively react to external disturbances. If an external agent undoes an action the robot reexecutes it without re-planning, and if an external agent helps the robot, it skips the corresponding actions, again without replanning. We illustrate our approach in two different robotics scenarios.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The cited source doesn’t support the claim as written.
In the citing paper
“Colledanchise et al.[4] comes with a fundamental theoretical limitation: adaptation cannot be selectively added only to specific parts of the tree.”
From Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics (2023) · cites this paper as [4]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The solution can compensate for unanticipated scenarios, but cannot handle partially observable environments and uncertain action outcomes.”
From Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics (2023) · cites this paper as [4]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Alternatively, adapting the region of attraction requires either replanning [6] or dynamic BT expansion [4].”
From Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics (2023) · cites this paper as [4]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“This is a compromise between a fully defined plan where the behavior of the robot is predefined in every part of the state space and a fully dynamic expansion of BTs which can result in a suboptimal action sequence [4].”
From Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics (2023) · cites this paper as [4]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“With our method, there is no need to explicitly detect a conflict and reordering a BT then, as was done in past work on the dynamic expansion of BTs [4].”
From Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics (2023) · cites this paper as [4]
1 more claim about this paper
Create a free account to see every claim other papers make about this one.
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
Automatic Planning of Manipulator Transfer Movements
Lozano-Perez, T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308589 · Cited by 692
Combined task and motion planning through an extensible planner-independent interface layer
Srivastava, S., Fang, E., Riano, L., Chitnis, R., Russell, S., & Abbeel, P. (2014) · 2014 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2014.6906922 · Cited by 459
Ghallab, M., Nau, D., & Traverso, P. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9781139583923 · Cited by 439
Integrated task and motion planning in belief space
Kaelbling, L. P., & Lozano-Pérez, T. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913484072 · Cited by 328
Artificial Intelligence for Games
Millington, I. (2009) · CRC Press eBooks · doi:10.1201/b13169 · Cited by 315
A behavior language for story-based believable agents
Mateas, M., & Stern, A. (2002) · IEEE Intelligent Systems · doi:10.1109/mis.2002.1024751 · Cited by 235
Colledanchise, M., & Ogren, P. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2633567 · Cited by 209
Self-citationBehavior Trees in Robotics and AI: An Introduction
Colledanchise, M., & Ögren, P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.00084 · Cited by 178
Self-citationRandomized multi-modal motion planning for a humanoid robot manipulation task
Hauser, K. K., & Ng‐Thow‐Hing, V. (2010) · The International Journal of Robotics Research · doi:10.1177/0278364910386985 · Cited by 161
Handey: A robot system that recognizes, plans, and manipulates
Lozano‐Pérez, T., Jones, J. L., Mazer, E., O'Donnell, P. A., Grimson, W. E. L., Tournassoud, P., & Lanusse, A. (2005) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1987.1087847 · Cited by 160
Research works printed but not linked: 4
- sprague, 2018, Adding neural network controllers to behavior trees without destroying performance guarantees, arXiv preprint arXiv 1809 10283
- isla, 2005, Handling Complexity in the Halo 2 AI, Game Developers Conference
- rabin, 2014, Game AI Pro
- latombe, 2012, Robot Motion Planning, 124
Cited by
Behavior Trees in Robotics and AI
Colledanchise, M., & Ögren, P. (2018) · CRC Press eBooks · doi:10.1201/9780429489105 · Cited by 526
Self-citationIntegrated Task and Motion Planning
Garrett, C. R., Chitnis, R., Holladay, R., Kim, B., Silver, T., Kaelbling, L. P., & Lozano-Pérez, T. (2021) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-091420-084139 · Cited by 409
A 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
AutoTAMP: Autoregressive Task and Motion Planning with LLMs as Translators and Checkers
Chen, Y., Arkin, J., Dawson, C., Zhang, Y., Roy, N., & Fan, C. (2024) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra57147.2024.10611163 · Cited by 241
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
Self-citation
Metadata
- Authors
- Colledanchise, M., Almeida, D., & Ogren, P.
- Affiliations
- Italian Institute of Technology (IT)
- KTH Royal Institute of Technology (SE)
- Venue
- 2019 International Conference on Robotics and Automation (ICRA)
- Publisher
- IEEE
- Published
- 2019-05
- Pages
- 8839-8845
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2548961765
- Cited by
- 133
- References
- 39
- Citations by year
- 2026: 9 · 2025: 21 · 2024: 20 · 2023: 22 · 2022: 19 · 2021: 21 · 2020: 12 · 2019: 4
- FWCI
- 5.36
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Proceedings - IEEE International Conference on Robotics and Automation/Proceedings (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- KTH Publication Database DiVA (KTH Royal Institute of Technology) (submittedVersion, other-oa)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Keywords
- behavior trees, reactive planning, robot control, dynamic environments, external disturbances, modular planning
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: Towards Blended Reactive Planning and Acting using Behavior Trees. https://app.cochat.ai/papers/10.1109/icra.2019.8794128
- The paper
- Colledanchise, M., Almeida, D., & Ogren, P. (2019). Towards Blended Reactive Planning and Acting using Behavior Trees. 2019 International Conference on Robotics and Automation (ICRA). https://doi.org/10.1109/icra.2019.8794128
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.