Execution Semantics of Behavior Trees in Robotic Applications

• URL: http://arxiv.org/abs/2408.00090v2
• Date: Thu, 10 Apr 2025 15:46:48 GMT
• Title: Execution Semantics of Behavior Trees in Robotic Applications
• Authors: Enrico Ghiorzi, Christian Henkel, Matteo Palmas, Michaela Klauck, Armando Tacchella,
• Abstract summary: This paper aims at defining the execution semantics of behavior trees (BTs) as used in robotics applications.<n>We present an abstract data type that formalizes the structure and execution of BTs.
• Score: 0.8378438766517396
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Behavior Trees (BTs) have found a widespread adoption in robotics due to appealing features, their ease of use as a conceptual model of control policies and the availability of software tooling for BT-based design of control software. However, BTs don't have formal execution semantics and, furthermore, subtle differences among implementations can make the same model behave differently depending on the underlying software. This paper aims at defining the execution semantics of behavior trees (BTs) as used in robotics applications. To this purpose, we present an abstract data type that formalizes the structure and execution of BTs. While our formalization is inspired by existing contributions in the scientific literature and state-of-the art implementations, we strive to provide an unambiguous treatment of most features that find incomplete or inconsistent treatment across other works.

Related papers

• A Behavior Tree-inspired programming language for autonomous agents [1.5101132008238316]
  We propose a design for a functional programming language for autonomous agents, built off the ideas and motivations of Behavior Trees (BTs) BTs are a popular model for designing agents behavior in robotics and AI. We present a full specification for our BT-inspired language, and give an implementation in the functional programming language Haskell.
  arXiv  Detail & Related papers  (2024-11-26T22:47:06Z)
• Designing and Implementing a Generator Framework for a SIMD Abstraction Library [53.84310825081338]
  We present TSLGen, a novel end-to-end framework for generating an SIMD abstraction library. We show that our framework is comparable to existing libraries, and we achieve the same performance results.
  arXiv  Detail & Related papers  (2024-07-26T13:25:38Z)
• Situated Instruction Following [87.37244711380411]
  We propose situated instruction following, which embraces the inherent underspecification and ambiguity of real-world communication. The meaning of situated instructions naturally unfold through the past actions and the expected future behaviors of the human involved. Our experiments indicate that state-of-the-art Embodied Instruction Following (EIF) models lack holistic understanding of situated human intention.
  arXiv  Detail & Related papers  (2024-07-15T19:32:30Z)
• Integrating Intent Understanding and Optimal Behavior Planning for Behavior Tree Generation from Human Instructions [5.31484618181979]
  Behavior Tree (BT) is an appropriate control architecture for robots executing tasks following human instructions. This paper proposes a two-stage framework for BT generation, which first employs large language models to interpret goals from high-level instructions. We represent goals as well-formed formulas in first-order logic, effectively bridging intent understanding and optimal behavior planning.
  arXiv  Detail & Related papers  (2024-05-13T05:23:48Z)
• RoboScript: Code Generation for Free-Form Manipulation Tasks across Real and Simulation [77.41969287400977]
  This paper presents textbfRobotScript, a platform for a deployable robot manipulation pipeline powered by code generation. We also present a benchmark for a code generation benchmark for robot manipulation tasks in free-form natural language. We demonstrate the adaptability of our code generation framework across multiple robot embodiments, including the Franka and UR5 robot arms.
  arXiv  Detail & Related papers  (2024-02-22T15:12:00Z)
• ThinkBot: Embodied Instruction Following with Thought Chain Reasoning [66.09880459084901]
  Embodied Instruction Following (EIF) requires agents to complete human instruction by interacting objects in complicated surrounding environments. We propose ThinkBot that reasons the thought chain in human instruction to recover the missing action descriptions. Our ThinkBot outperforms the state-of-the-art EIF methods by a sizable margin in both success rate and execution efficiency.
  arXiv  Detail & Related papers  (2023-12-12T08:30:09Z)
• Unsupervised Mapping of Arguments of Deverbal Nouns to Their Corresponding Verbal Labels [52.940886615390106]
  Deverbal nouns are verbs commonly used in written English texts to describe events or actions, as well as their arguments. The solutions that do exist for handling arguments of nominalized constructions are based on semantic annotation. We propose to adopt a more syntactic approach, which maps the arguments of deverbal nouns to the corresponding verbal construction.
  arXiv  Detail & Related papers  (2023-06-24T10:07:01Z)
• Instruct2Act: Mapping Multi-modality Instructions to Robotic Actions with Large Language Model [63.66204449776262]
  Instruct2Act is a framework that maps multi-modal instructions to sequential actions for robotic manipulation tasks. Our approach is adjustable and flexible in accommodating various instruction modalities and input types. Our zero-shot method outperformed many state-of-the-art learning-based policies in several tasks.
  arXiv  Detail & Related papers  (2023-05-18T17:59:49Z)
• SEAL: Semantic Frame Execution And Localization for Perceiving Afforded Robot Actions [5.522839151632667]
  We extend the semantic frame representation for robot manipulation actions and introduce the problem of Semantic Frame Execution And Localization for Perceiving Afforded Robot Actions (SEAL) as a graphical model. For the SEAL problem, we describe our nonparametric Semantic Frame Mapping (SeFM) algorithm for maintaining belief over a finite set of semantic frames as the locations of actions afforded to the robot.
  arXiv  Detail & Related papers  (2023-03-24T15:25:41Z)
• Robot Behavior-Tree-Based Task Generation with Large Language Models [14.384843227828775]
  We propose a novel behavior-tree-based task generation approach that utilizes state-of-the-art large language models. We propose a Phase-Step prompt design that enables a hierarchical-structured robot task generation and further integrate it with behavior-tree-embedding-based search to set up the appropriate prompt. Our behavior-tree-based task generation approach does not require a set of pre-defined primitive tasks.
  arXiv  Detail & Related papers  (2023-02-24T22:53:10Z)
• Verifying Safety of Behaviour Trees in Event-B [0.0]
  Behavior Trees (BT) are becoming increasingly popular in the robotics community. We propose a formal specification of Behavior Trees and a methodology to prove invariants of already used trees.
  arXiv  Detail & Related papers  (2022-09-28T12:26:50Z)
• Procedures as Programs: Hierarchical Control of Situated Agents through Natural Language [81.73820295186727]
  We propose a formalism of procedures as programs, a powerful yet intuitive method of representing hierarchical procedural knowledge for agent command and control. We instantiate this framework on the IQA and ALFRED datasets for NL instruction following.
  arXiv  Detail & Related papers  (2021-09-16T20:36:21Z)
• A Persistent Spatial Semantic Representation for High-level Natural Language Instruction Execution [54.385344986265714]
  We propose a persistent spatial semantic representation method to bridge the gap between language and robot actions. We evaluate our approach on the ALFRED benchmark and achieve state-of-the-art results, despite completely avoiding the commonly used step-by-step instructions.
  arXiv  Detail & Related papers  (2021-07-12T17:47:19Z)
• An expressiveness hierarchy of Behavior Trees and related architectures [0.0]
  We provide a formal framework for comparing the expressive power of Behavior Trees (BTs) to other action selection architectures. This leads us to an hierarchy of control architectures, which includes BTs, Decision Trees (DTs), Teleo-reactive Programs (TRs) and Finite State Machines (FSMs)
  arXiv  Detail & Related papers  (2021-04-16T06:46:52Z)
• Infusing Finetuning with Semantic Dependencies [62.37697048781823]
  We show that, unlike syntax, semantics is not brought to the surface by today's pretrained models. We then use convolutional graph encoders to explicitly incorporate semantic parses into task-specific finetuning.
  arXiv  Detail & Related papers  (2020-12-10T01:27:24Z)
• Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics [2.040132783511305]
  We propose a hybrid combination of active inference and behavior trees (BTs) for reactive action planning and execution in dynamic environments. The proposed approach allows to handle partially observable initial states and improves the robustness of classical BTs against unexpected contingencies.
  arXiv  Detail & Related papers  (2020-11-19T10:24:41Z)
• A principled analysis of Behavior Trees and their generalisations [0.0]
  We analyse the principles behind Behavior Trees (BTs), an increasingly popular tree-structured control architecture. We show that reasoning via these principles leads to compatible solutions. We introduce a new class of control architectures we call generalised BTs or $k$-BTs.
  arXiv  Detail & Related papers  (2020-08-27T04:09:31Z)
• Semantics-Aware Inferential Network for Natural Language Understanding [79.70497178043368]
  We propose a Semantics-Aware Inferential Network (SAIN) to meet such a motivation. Taking explicit contextualized semantics as a complementary input, the inferential module of SAIN enables a series of reasoning steps over semantic clues. Our model achieves significant improvement on 11 tasks including machine reading comprehension and natural language inference.
  arXiv  Detail & Related papers  (2020-04-28T07:24:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.