• Corpus ID: 4354459

A Resourceful Reframing of Behavior Trees

  title={A Resourceful Reframing of Behavior Trees},
  author={Chris Martens and Eric Butler and Joseph Carter Osborn},
Designers of autonomous agents, whether in physical or virtual environments, need to express nondeterminisim, failure, and parallelism in behaviors, as well as accounting for synchronous coordination between agents. Behavior Trees are a semi-formalism deployed widely for this purpose in the games industry, but with challenges to scalability, reasoning, and reuse of common sub-behaviors. We present an alternative formulation of behavior trees through a language design perspective, giving a… 

Figures from this paper

Learning and Executing Re-usable Behaviour Trees from Natural Language Instruction
This paper demonstrates how behaviour trees, a well established control architecture in the fields of gaming and robotics, can be used in conjunction with natural language instruction to provide a robust and modular control architecture for instructing autonomous agents to learn and perform novel complex tasks.
Intelligent Distributed Human Motion Simulation in Human-Robot Collaboration Environments
A framework for 3D simulation of hybrid teams in production scenarios based on an agent framework and motion generation which can be used for evaluating critical properties of the planned production setting and dynamical assignment of tasks to team members is presented.
Orchestrating Heterogeneous Devices and AI Services as Virtual Sensors for Secure Cloud-Based IoT Applications
A thing registry and an agent-based orchestration framework are presented, which are combined to support semantic orchestration of IoT use cases across several federated cloud environments and use the concept of virtual sensors based on machine learning services as abstraction, mediating between the instance level and the semantic level.
Answerable and Unanswerable Questions in Risk Analysis with Open‐World Novelty
  • L. A. Cox
  • Computer Science
    Risk analysis : an official publication of the Society for Risk Analysis
  • 2020
An AI/machine learning perspective on recent ideas for making decision and risk analysis (even) more useful is offered, which reviews undecidability results and recent principles and methods for enabling intelligent agents to learn what works and how to complete useful tasks, adjust plans as needed, and achieve multiple goals safely and reasonably efficiently when possible, despite open‐world uncertainties and unpredictable events.
On modularity in reactive control architectures, with an application to formal verification
This paper proposes a graph-structured control architecture called a decision structure, and shows how it generalises some reactive control architectures which are popular in Artificial Intelligence (AI) and robotics, specifically Teleo-Reactive programs (TRs), Decision Trees (DTs), Behavior Trees (BTs) and Generalised Behavior trees (k-BTs).


Generating Plans in Linear Logic I. Actions as Proofs
Ceptre: A Language for Modeling Generative Interactive Systems
Ceptre can be viewed as an explication of a new methodology for understanding games based on linear logic, a formal logic concerned with resource usage, intended to enable rapid prototyping for experimental game mechanics, especially in domains that depend on procedural generation and multi-agent simulation.
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
Celf is an implementation of the CLF type theory that extends the LF type theory by linear types toSupport representation of state and a monad to support representation of concurrency.
A concurrent logical framework I: Judgments and properties
The present report, the first of two technical reports describing CLF, presents the frame- work itself and its metatheory, and a novel, algorithmic formulation of the underlying type theory concentrating on canonical forms leads to a simple notion of definitional equality for concurrent computations in which the order of independent steps cannot be distinguished.
Linear logic propositions as session types
A type system for the π-calculus is proposed that corresponds to a standard sequent calculus presentation of intuitionistic linear logic, interpreting linear propositions as session types and thus providing a purely logical account of all key features and properties of session types.
Synthesis of correct-by-construction behavior trees
The proposed approach combines the modularity and reactivity of BTs with the formal guarantees of Linear Temporal Logic methods to synthesize a BT in polynomial time that is guaranteed to correctly execute the desired task.
Planning as Deductive Synthesis in Intuitionistic Linear Logic
A new formalisation in Isabelle/HOL of Intuitionistic Linear Logic is described and the support this provides for constructing plans using deductive synthesis of the proof terms is considered, to provide a flexible methodology for developing search strategies that is independent of soundness issues.
A Calculus of Communicating Systems
  • R. Milner
  • Computer Science
    Lecture Notes in Computer Science
  • 1980
A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
A judgmental analysis of linear logic
We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-L¨ of’s separation of judgments from propositions. Our construction yields a clean and elegant
Deductive Synthesis of Recursive Plans in Linear Logic
A recursively defined datatype and a corresponding induction rule are introduced, thereby allowing recursive plans to be synthesised and enhancing the linear logic deduction rules to handle plans as a form of proof term.