Depth-limited GOAP

Question 1

We need planning to allow the character to ___ the effects and take ___ of sequences of ___

Answer 1

anticipate
advantage
actions

Question 2

the Idea of GOAP is to consider ___ in ___ and find the ___ that best meets the character’s ___

Answer 2

multiple actions
sequence
sequence
goals

Question 3

Problems of GOAP are:
1- For a sequence of k actions it is O(___)
2- A action might invalidate a ___

Answer 3

1- n.m^k

2- future action

Question 4

To consider multiple actions we need to know ___

Answer 4

the future

state of the world

Question 5

On GOAP we need a representation of the ___ that can be easily ___ without changing the ___ of the world

Answer 5

world
changed
state

Question 6

To get a representation of the world we can:
1- ___
2- ___

Answer 6

Store a copy of the game state

List of differences (Only store what is different from the actual game data)

Question 7

Depth Limited GOAP Versions:
1- Limit X establishes the maximum ___ (i.e. the number of future actions to consider)
2- Do a ___ search with limit X to go through all ___
3- Remember the best ___

Answer 7

1- look-ahead
2- depth-first / combinations of actions
3- final combination

Question 8

STUDY DEPTH LIMITED GOAP EXAMPLE (slide 6)

Answer 8

…

Question 9

Discontentment corresponds to the goal values (insistentes) ___ and ___ after the execution of the actions

Answer 9

squared and summed

Question 10

To optimize depth first:
1- Do not consider actions that ___
2- Calculate discontentment value for each ___

Answer 10

1- increase discontentment

2- depth

Question 11

Problem with Best First Search on GOAP:
1- ___ approach
2- Needs to eventually consider all ___
3- Considering all goals at the same time will make the algorithm ___ to scale

Answer 11

1- Brute Force
2- combinations of actions
3- harder