Hi Professor, thank you for the great talk. I have a question: If behaviour trees have essential cyclomatic complexity of 1, and in your book section 2.2.3 you prove that a FSM can be rewritten into a BT, does that mean that FSMs also have an ECC of 1 as well? Additionally, I noticed that that the BT in section 2.2.3 there is an additional global state variable storing the current state. Does having a black board or global variables somehow break this ECC=1 proof for BTs?
Great explanation of a great paper. Thanks
Thank you!
Great video!
Thanks!
Very interesting and helpful, thanks
I'm glad you find it useful
Hi Professor, thank you for the great talk. I have a question:
If behaviour trees have essential cyclomatic complexity of 1, and in your book section 2.2.3 you prove that a FSM can be rewritten into a BT, does that mean that FSMs also have an ECC of 1 as well?
Additionally, I noticed that that the BT in section 2.2.3 there is an additional global state variable storing the current state. Does having a black board or global variables somehow break this ECC=1 proof for BTs?
Wonderful thanks!
I bet the papers author has a bright future