Consider the following behavior tree: A B X X is either a Sequence or Selector...

Transcribed Image Text:

Consider the following behavior tree: A B X с X is either a Sequence or Selector node (you do not know which). A, B, C, and D, are arbitrary subtrees. Let O be an optional behavior, whose introduction would have no impact on the semantics of the above tree - its Success or Failure, the execution order of its components, or the number of times they are executed. (a) 2 points. An unnamed Professor claims that you cannot introduce a subtree between B and C that encodes an optional behavior, O, while leaving the remainder of the tree unchanged (and without altering the implementation of the node type X). Is this statement true, or false? Explain why in one or two sentences. (b) 4 points. Suppose you could transform the tree shown above into another tree by duplicating structure, rewiring structure, and/or introducing additional Sequence and Selector nodes. Draw a transformed tree that encodes an optional behavior, O, that will be considered after B and before C, while preserving the semantics of the original tree. Consider the following behavior tree: A B X с X is either a Sequence or Selector node (you do not know which). A, B, C, and D, are arbitrary subtrees. Let O be an optional behavior, whose introduction would have no impact on the semantics of the above tree - its Success or Failure, the execution order of its components, or the number of times they are executed. (a) 2 points. An unnamed Professor claims that you cannot introduce a subtree between B and C that encodes an optional behavior, O, while leaving the remainder of the tree unchanged (and without altering the implementation of the node type X). Is this statement true, or false? Explain why in one or two sentences. (b) 4 points. Suppose you could transform the tree shown above into another tree by duplicating structure, rewiring structure, and/or introducing additional Sequence and Selector nodes. Draw a transformed tree that encodes an optional behavior, O, that will be considered after B and before C, while preserving the semantics of the original tree.

Answer rating: 100% (QA)

Part a The statement in part a claims that it is not possible to introduce a subtree between B and C that encodes an optional behavior O while leaving ... View the full answer