ml-recall

#bounded-suboptimality

1 question from Search & Planning

Timed test

1 question · 1 min · score and explanations at the end

Take a test

Q 1 / 1Score 0 / 0

Shuffle questions

Question 1: Single choice

mediumAI-checkedSearch & Planning

Weighted A* orders OPEN by $f(n) = g(n) + w \cdot h(n)$ with $w = 2$ and an admissible $h$ . What is guaranteed about the cost of the path it returns, compared with the optimal cost $C^*$ ?

It is at most $2C^*$ 1
It equals $C^*$ , because $h$ is admissible2
It is at least $2C^*$ 3
Nothing; with $w > 1$ the path can be arbitrarily bad4

Keys: 1–9 select · Enter check / next