on 26-Sep-2019 (Thu)

Flashcard 4409513086220

Tags
#artificial-intelligence
Question
Define $$\epsilon$$-optimality of a search algorithm.
Definition 6.1. ( $$\epsilon$$-Optimality) A search algorithm is $$\epsilon$$-optimal if it terminates with a solution of maximum cost (1 + $$\epsilon$$) ·δ(s,T), with $$\epsilon$$ denoting an arbitrary small positive constant (s is the starting state, T is a goal state).