0
\$\begingroup\$

I'm trying to teach myself how to use the behavior tree design pattern. I think I understand most of it, but am not clear if the tree is supposed to save the current state or not.

In the below tree, how does the sequence node know that Task 1 has finished and move in to Task 2? Does Task 1 remember it has finished and return true every subsequent time it gets the evaluation tick? Does the sequence node keep track of which states have already been done and just start at Task 2 after Task 1 returns true for the first time?

I've read some docs that have the sequence node keeping track of a current index (the last child to evaluate true) and starting evaluation from that point, and others that start at the beginning of the child list each time. Which is the right way to implement this?

enter image description here

https://en.wikipedia.org/wiki/Behavior_tree_(artificial_intelligence,_robotics_and_control)

\$\endgroup\$
1
  • 2
    \$\begingroup\$ If you find two sources describing it different ways, it could be that different implementations make different choices here, and it might be that neither is "the right way" — they're both just approaches that work. \$\endgroup\$ Commented Jan 15 at 19:36

0

Reset to default

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.