Scribd Logo
Upload

Welcome to Scribd!

  • CSE 860 Artificial Intelligence (Infrastructure of Search Algos)

    Uploaded by

    Umer
    35 views6 pages
    The document discusses the infrastructure of search algorithms. It explains that search tree nodes contain a state, parent node, action taken, and path cost. It distinguishes between states and nodes, with nodes representing unique state-action pairs in the search tree. It describes the frontier and explored set data structures used in search algorithms, including queues, stacks, and hash tables. It lists key properties of search algorithms like completeness, optimality, and time and space complexity.

    Original Description:

    RIME NUST

    Original Title

    AI Lec 09

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the infrastructure of search algorithms. It explains that search tree nodes contain a state, parent node, action taken, and path cost. It distinguishes between states and nodes, with nodes representing unique state-action pairs in the search tree. It describes the frontier and explored set data structures used in search algorithms, including queues, stacks, and hash tables. It lists key properties of search algorithms like completeness, optimality, and time and space complexity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    35 views6 pages

    CSE 860 Artificial Intelligence (Infrastructure of Search Algos)

    Uploaded by

    Umer
    The document discusses the infrastructure of search algorithms. It explains that search tree nodes contain a state, parent node, action taken, and path cost. It distinguishes between states and nodes, with nodes representing unique state-action pairs in the search tree. It describes the frontier and explored set data structures used in search algorithms, including queues, stacks, and hash tables. It lists key properties of search algorithms like completeness, optimality, and time and space complexity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 6

    CSE 860 Artificial Intelligence

    (Infrastructure of Search Algos)

    Dr. Yasar Ayaz


    Head of Department
    Department of Robotics and AI
    SMME, NUST.

    1
    Each node n of the tree has 4 components
    • n.State The state it indicates.
    • n.Parent The node which generated it.
    • n.Action Action applied to the Parent to
    generate this node
    • n.Path Cost Cost g(n) of the path from the
    initial state to the current node
    (based upon parent pointers)
    2
    • State vs. Node

    3
    4
    • Frontier  Queue (or Stack)
    EMPTY?(queue)
    POP(queue)
    INSERT(queue)
    Types: FIFO, LIFO or Priority Queue
    • Explored Set  Hash Tables of Symbol
    Tables etc based upon the
    nature of the problem
    5
    • Completeness

    • Optimality

    • Time Complexity

    • Space Complexity

    You might also like