A search can use a heuristic function that estimates the cost from a node to a goal.
Question:
A∗ search can use a heuristic function that estimates the cost from a node to a goal. If a graph satisfies some reasonable condition (see Proposition 3.2 (page 112)) and the heuristic is admissible, A∗ is guaranteed to find a lowest-cost path to a goal if one exists.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Artificial Intelligence: Foundations Of Computational Agents
ISBN: 9781009258197
3rd Edition
Authors: David L. Poole , Alan K. Mackworth
Question Posted: