Aliased from Behavior Trees

From the description of Behaviour Trees on BehaviorTree.CPP:

A Behavior Tree (BT) is a way to structure the switching between different tasks in an autonomous agent, such as a robot or a virtual entity in a computer game.

BTs are a very efficient way of creating complex systems that are both modular and reactive. These properties are crucial in many applications, which has led to the spread of BT from computer game programming to many branches of AI and Robotics.

From the description of Behaviour Trees on Wikipedia:

A behavior tree is a mathematical model of plan execution used in computer science , robotics , control systems and video games. They describe switchings between a finite set of tasks in a modular fashion. Their strength comes from their ability to create very complex tasks composed of simple tasks, without worrying how the simple tasks are implemented. Behavior trees present some similarities to hierarchical state machines with the key difference that the main building block of a behavior is a task rather than a state. Its ease of human understanding make behavior trees less error prone and very popular in the game developer community. Behavior trees have been shown to generalize several other control architectures. Mathematically, they are directed acyclic graphs .


  • Behavior Trees by Rud Merriam (C++)
    • BehaviorTree
      "The Behavior Tree code uses a logging library of my own which isn't in a repo. I think if you globally replace mys::tout with std::cout and remove the #include <Trace.h> references it will compile."
    • BT Test (requires a C++ unit testing library, TUT, that isn't widely available)