The Behaviour Tree Starter Kit (BTSK) on GameAI Pro suggests utilizing a scheduler for an occasion pushed behaviour tree.

To recap: A behaviour tree (BT) is traversed absolutely each time the foundation node is ticked which may very well be as typically as each body, whereas an event-driven BT (EDBT) is simply traversed when an occasion occurs, corresponding to ending a process or a change on the blackboard.

Specifically the BTSK mentions

merely to seek out beforehand lively behaviors, why not keep them in an inventory (of measurement a number of) for quick entry? You can consider this listing as a scheduler that retains lively behaviors and ticks those that want updating.

I’m not positive what such a scheduler would appear to be and which nodes we might really queue

Assume a tree like this one, the place single letters simply denote some duties which will return “working” states and numbers characterize conditionals that simply return success or failure.

selector (root)
├── sequence
│   ├── 1
│   └── B
├── sequence
│   ├── 2
│   └── D
└── F

Before the primary body the scheduler is empty, what does it appear to be after the primary traversal?