https://arshadhs.github.io/tags/informed-search/Recent content in Informed Search on Arshad SiddiquiHugoen-ushttps://arshadhs.github.io/docs/ai/060-artificial-and-computer-intelligence/040-informed-search-and-heuristic-design/Mon, 01 Jan 0001 00:00:00 +0000https://arshadhs.github.io/docs/ai/060-artificial-and-computer-intelligence/040-informed-search-and-heuristic-design/<h1 id="informed-search-and-heuristic-design"> Informed Search and Heuristic Design <a class="anchor" href="#informed-search-and-heuristic-design">#</a> </h1> <p>Informed search uses additional knowledge to estimate which states are most promising. A good heuristic can greatly reduce unnecessary exploration while preserving solution quality.</p> <ul> <li>Notion of Heuristics</li> <li>Informed Search Algorithms : Greedy best first search, A* search</li> <li>Optimality of A*</li> <li>Heuristic Functions</li> <li>Heuristic Accuracy &amp; Algorithm performance</li> <li>Admissible heuristics from relaxed problems, pattern databases. Experience.</li> <li>Use case : Learning Heuristics using Supervised Learning</li> </ul> <h2 id="learning-objectives"> Learning Objectives <a class="anchor" href="#learning-objectives">#</a> </h2> <ul> <li>explain the purpose of a heuristic function</li> <li>compare Greedy Best-First Search and A* Search</li> <li>trace A* using OPEN and CLOSED lists</li> <li>test heuristics for admissibility and consistency</li> <li>explain heuristic dominance and effective branching factor</li> <li>derive heuristics from relaxed problems and subproblems</li> <li>describe pattern databases, landmarks and learned heuristics</li> </ul> <h2 id="1-what-is-informed-search-"> 1. What Is Informed Search? ☆ <a class="anchor" href="#1-what-is-informed-search-">#</a> </h2> <p>Uninformed search knows only how to generate successors and recognise a goal. <strong>Informed search</strong> additionally estimates whether one non-goal state is more promising than another.</p>