WEEK 1 Flashcards
(47 cards)
What is decision making ?
it is the ability of a character to decide what to do
what are the main parts of making a decision
- input
- generate of
- output
what is the output of a decision ?
External Changes
internal changes
what is the input of decision maker ?
external knowledge
internal knowledge
What is a decision Tree
are simple structures, quite fast and easy to implement and
understand. The concept is simple: given a set of input information, decide
what’s the best action to execute.
What are decision tree’s made up from ?
nodes and leafs, root
what is a decision tree node?
nodes are where the decision are made, each node has a limit of 2
what is the root ?
the root is the first node of the decision tree,
what are the leafs ?
at the leafs a action is attached so that the agent does the action that the leafs says
how does the nodes makes a decision ?
Decisions at each node are made based on the internal knowledge of the agent,
or queried to a centralised manager object that provides this information, carried out automatically, leaves can have the same
what type of decision do the nodes make ?
typically they check a single numeric value an enumeration, or a single
boolean condition.
but you can have more complex operations, such as calculating distances, visibility checks, pathfinding, etc
How to do and and or in clauses ?
AND
1 1 = 1
1 0 = 0
0 =0
OR
1 = 1
0 1 = 1
0 0 = 0
what is a binary decision tree?
The N-ary tree requires less comparisons: it’s more efficient.But, binary trees are more common. Efficiency gain is lost at the code level (sequence of if statements). Also, binary decision trees are more easily optimized.
what is a balanced tree
where the tree has the same number of leaves on each branch, o(log2(n))
what is the auto time if iit is a total unbalanced tree ?
o(n)
other info
However, the optimal tree structure depends on the decision nodes. Most commonly used checks should be placed close to the root node, and the most expensive ones should be located closer to the leaves.
what is aDAG
Directed Acyclic Graph
what is random decision tree
it is a descion tree that allows variatiion in the behaviiour by introducing a random element
what is HFSM ?
Hierarchical Finite State Machine
can you combine FMS’S and Decision Trees ?
yes
what are the advantages of BT’s
- Can incorporate numerous concerns such as path finding and planning
- Modular and scalable
- Easy to develop, even for non-technical developers
- Can use GUIs for easy creation and manipulation of BTs
a basic BT consists of how many and what nodes
- Conditions: test some property of the game
- Actions: alter the state of the game; they usually succeed
- Composites: collections of child tasks (conditions, actions, composites)
talk about selector and sequence
(?)selector is a OR statement
(->)sequence is and AND
what is a blackboard ?
witch a blackboard you are decouple the data from tree (rather that, say, use
arguments to the actions).