Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Module 2 3

    Uploaded by

    As Venkivenkatesh
    Module

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Module 2 3

    Uploaded by

    As Venkivenkatesh
    10 views10 pages
    Module

    Original Title

    Module-2-3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Module

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    10 views10 pages

    Module 2 3

    Uploaded by

    As Venkivenkatesh
    Module

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 10

    Introduction to AI and ML (21CS752) Prof.

    SHIVANANDA

    The informed search strategy uses problem-specific knowledge beyond the definition of the problem
    itself—can find solutions more efficiently than can an uninformed strategy.

    The general approach we consider is called best-first search. Best-first search is an instance of the general
    TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an
    evaluation function, f (n). The evaluation function is construed as a cost estimate, so the node with the
    lowest evaluation is expanded first.

    Most best-first algorithms include as a component of f a heuristic function, denoted h(n):

    h(n) = Estimated cost of the cheapest path from the state at node n to a goal state.

    Heuristic functions are the most common form in which additional knowledge of the problem is imparted
    to the search algorithm.

    Page - 1
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Page - 2
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Thus, if we are trying to find the cheapest solution, a reasonable thing to try first is the node with the lowest
    value of g(n) +h(n).

    line cannot be an overestimate. In Figure 3.24, we show the progress of an A∗ tree search for Bucharest.
    Notice in particular that Bucharest first appears on the frontier at step (e), but it is not selected for expansion
    because its f-cost (450) is higher than that of Pitesti (417). Another way to say this is that there might be a
    solution through Pitesti whose cost is as low as 417, so the algorithm will not settle for a solution that costs
    450.

    The two memory-bounded heruistic search algorithms are: RBFS and MA*.

    Recursive best-first search (RBFS) is RECURSIVE a simple recursive algorithm that attempts to BEST-
    FIRST SEARCH mimic the operation of standard best-first search, but using only linear space. Its structure
    is similar to that of a recursive depth-first search, but rather than continuing indefinitely down the current
    path, it uses the f_ limit variable to keep track of the f-value of the best alternative path available from any
    ancestor of the current node. If the current node exceeds this limit, the recursion unwinds back to the
    alternative path. As the recursion unwinds, RBFS replaces the f-value of each node along the path
    BACKED-UP VALUE with a backed-up value—the best f-value of its children. In this way, RBFS
    remembers the f-value of the best leaf in the forgotten subtree and can therefore decide whether it’s worth
    reexpanding the subtree at some later time. Figure 3.27 shows how RBFS reaches Bucharest.

    Page - 3
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Page - 4
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Page - 5
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Page - 6
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Page - 7
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Page - 8
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Page - 9
    Introduction to AI and ML (21CS752) Prof. SHIVANANDA

    Page - 10

    You might also like