Artificial Intelligence for Computer Games

Homework 2 tutorial. Behaviour trees. Introduction to fuzzy logic.

Chyba: Odkazovaný objekt neexistuje nebo nemáte právo jej číst.
https://is.muni.cz/el/fi/jaro2023/PA217/um/7.pdf
Questions

  1. What do leaf nodes represent in behavior trees?
  2. What is the selector and sequence in the behavior tree? Give their examples. 
  3. Discuss the example on slide 6. Think about alternate sequences and selectors on slide 9.
  4. Why are non-deterministic behavior trees helpful? Can you describe it using an example?
  5. What are the decorator and filter? Why do you use decorators for a limited resource? Discuss some examples. Discuss guarding resources using decorators.
  6. When parallel versions of sequence and selector are helpful?  Describe it using an example.
  7. Why do we add data to behavior trees? What is the behavior blackboard? Demonstrate it in the example.
  8. Why and how do we reuse behavior trees?
  9. What do you think about behavior trees? Discuss their limitations.
  10. Do you have any experience with the implementation of decision making (in Unity), for example, using behavior trees or finite state machines? Can you discuss it?
  11. What is the difference between fuzzy sets and normal sets? What are fuzzification and defuzzification?
  12. Describe defuzzification using the highest membership, blending, and center of gravity.
  13. What fuzzy set operators do you know, and how do they work?
  14. What is the fuzzy rule? Can you describe fuzzy rule inference?