kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Comparison between Behavior Trees and Finite State Machines
ABB Corporate Research, Västerås, Sweden.ORCID iD: 0000-0002-6119-6399
Autonomous Systems Laboratory, ETH Zürich, Zürich, Switzerland.
University of Padova, Department of Information Engineering, Padua, Italy.ORCID iD: 0000-0003-1133-0884
The University of Queensland, School of EECS, Brisbane, Australia, QLD 4072.ORCID iD: 0000-0001-7828-0741
Show others and affiliations
2025 (English)In: IEEE Transactions on Automation Science and Engineering, ISSN 1545-5955, E-ISSN 1558-3783, Vol. 22, p. 21098-21117Article in journal (Refereed) Published
Abstract [en]

Behavior Trees (BTs) were first conceived in the computer games industry as a tool to model agent behavior, but they received interest also in the robotics community as an alternative policy design to Finite State Machines (FSMs). The advantages of BTs over FSMs had been highlighted in many works, but there is no thorough practical comparison of the two designs. Such a comparison is particularly relevant in the robotic industry, where FSMs have been the state-of-The-Art policy representation for robot control for many years. In this work we shed light on this matter by comparing how BTs and FSMs behave when controlling a robot in a mobile manipulation task. The comparison is made in terms of reactivity, modularity, readability, and design. We propose metrics for each of these properties, being aware that while some are tangible and objective, others are more subjective and implementation dependent. The practical comparison is performed in a simulation environment with validation on a real robot. We find that although the robot's behavior during task solving is independent on the policy representation, maintaining a BT rather than an FSM becomes easier as the task increases in complexity.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2025. Vol. 22, p. 21098-21117
Keywords [en]
Behavior Trees, Collaborative Robotics, Finite State Machines, Mobile Manipulation, Robot Control
National Category
Robotics and automation
Identifiers
URN: urn:nbn:se:kth:diva-371275DOI: 10.1109/TASE.2025.3610090ISI: 001579020600013Scopus ID: 2-s2.0-105016561233OAI: oai:DiVA.org:kth-371275DiVA, id: diva2:2006085
Note

QC 20251013

Available from: 2025-10-13 Created: 2025-10-13 Last updated: 2025-10-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Smith, Christian

Search in DiVA

By author/editor
Iovino, MatteoFalco, PietroJen Chung, JenSiegwart, RolandSmith, Christian
By organisation
Robotics, Perception and Learning, RPL
In the same journal
IEEE Transactions on Automation Science and Engineering
Robotics and automation

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf