Behavior Tree: How a Robot Picks a Plan B
A behavior tree organises a robot's choices as branches of small tasks. When one option fails, the tree simply tries the next, so a Plan B is built in.
The robot repeats this loop many times a second. Tap a step to pause on it.
A behavior tree is a set of small tasks arranged like branches. A signal called a tick is sent through the tree again and again, and every task it reaches answers with one of three words: success, failure, or running (still working on it).
Parent nodes decide what to do with those answers. A fallback node tries its children one by one until one succeeds, which is how a robot gets a Plan B. The idea was developed in the video game industry and later spread to robotics.
Complicated behaviour is built from small, reusable pieces, and a robot that hits a problem has a clear list of things to try next.
Every possible situation would need its own hand-written rule, and a robot that met something unexpected would simply stop or loop.
A big tree can still be hard to read and tune, and a tree only knows the fixes someone gave it. If every branch fails, the robot gives up.
In a behavior tree, what does a fallback node do when its first option fails?
Go deeper in the Atlas
Control and Balance
- Feedback Control Explained
- Line Follower Robot
- Why You Don't Fall in a Moving Bus (And Robots Do)
- How Boston Dynamics Robots Keep Their Balance
- How Drones Stay Level in Strong Wind
- PID Controller in 60 Seconds
- ROS 2
- How Robots Learn to Walk
- A* Pathfinding
- State Machine
- Robot Latency
- Reward Hacking
- Sim to Real
- How Humanoid Robots Walk Without Falling (ZMP Explained)
- Gain and Damping
- How Self-Driving Cars Think
- Swarm Robotics
- Robot Dog (Quadruped) Explained
- How a Drone Hovers
- Behavior Tree