Scribd Logo
Upload

Welcome to Scribd!

  • Smarter Search: Maze Search With Predictor: Two Parts: Plain Maze Router Smarter Maze Router

    Uploaded by

    Itsy Bitsy
    7 views2 pages
    The document describes an improvement to maze routing algorithms called smarter maze search that uses a predictor function to direct the search towards the target. It adds cells to the wavefront with a cost that estimates the entire path cost from the source to target by combining the path cost from the source to the cell with a predictor of the cost from the cell to the target. This is similar to the well-known A* search algorithm and represents an improvement over classical breadth-first search by guiding the search towards lower-cost paths.

    Original Description:

    Original Title

    _83544e988792a4bbb5987926c00ef7cd_11-vlsicad-route-42.pdf

    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 describes an improvement to maze routing algorithms called smarter maze search that uses a predictor function to direct the search towards the target. It adds cells to the wavefront with a cost that estimates the entire path cost from the source to target by combining the path cost from the source to the cell with a predictor of the cost from the cell to the target. This is similar to the well-known A* search algorithm and represents an improvement over classical breadth-first search by guiding the search towards lower-cost paths.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    7 views2 pages

    Smarter Search: Maze Search With Predictor: Two Parts: Plain Maze Router Smarter Maze Router

    Uploaded by

    Itsy Bitsy
    The document describes an improvement to maze routing algorithms called smarter maze search that uses a predictor function to direct the search towards the target. It adds cells to the wavefront with a cost that estimates the entire path cost from the source to target by combining the path cost from the source to the cell with a predictor of the cost from the cell to the target. This is similar to the well-known A* search algorithm and represents an improvement over classical breadth-first search by guiding the search towards lower-cost paths.

    Copyright:

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

    Smarter Search: Maze Search With Predictor

    • Two parts:
    • Add predictor function to the cost, to direct the search toward the target

    • Plain maze router


    • Add a cell C to wavefront with cost that measures cost of partial path, source-to-cell(C)

    • Smarter maze router


    • Add cell C to wavefront with cost that estimates entire source-to-target cost of path
    • Trick: estimate this as pathcost(source to cell C) + predictor(cell C to target)
    • Today, we recognize this as difference between smart depth first search (DFS) with a
    predictor, versus classical breadth first search (BFS) as per Dijkstra
    • This is famous application of a classical idea: A* search

    Slide 83 © 2013, R.A. Rutenbar


    Plain Maze Routing
    Source

    Reached cell goes on wavefront with this cost:

    Expand pathcost(source to cell being expanded)

    + cost of newly reached cell


    Reach

    Target

    Slide 84 © 2013, R.A. Rutenbar

    You might also like