Artificial.intelligence_0160

# Artificial.intelligence_0160 - Graceful Decay of...

• 2

This preview shows pages 1–2. Sign up to view the full content.

Graceful Decay of Admissibility • Theorem: If h(n) rarely overestimates the actual minimum cost by more than e, then A* search will rarely find a solution whose cost is more than e greater than the cost of the optimal solution. • Let n 1 be the first goal node found and n 0 be the goal node on the optimal path. We need to show: g(n 1 ) <= g(n 0 ) + e. • Suppose that at the time n1 is selected, m from the fringe is a node on the optimal path from s to n0. • Then, we know: f(n1) <= f(n), since n1 was selected before m. Thus, g(n1) = f(n1) <= f(m) = g(m) + h(m), since n1 is a goal node. • Let h*(m) be the actual cost from m to n0, then by the condition in the theorem:

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.
• Fall '16
• Mr. Bob
• Pythagorean Theorem, Distance, Metric space, euclidean distance, goal node

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern