Coarse-to-Fine Search Techniques

• Author(s) / Creator(s)

  • Schaeffer, Jonathan
  • Sturtevant, Nathan
  • Holte, Robert
  • Anderson, Ken

• Technical report TR08-05. The following report describes some techniques that generalize and attempt to improve upon the Coarse-to-Fine Dynamic Programming (CFDP) algorithm developed by Christopher Raphael. CFDP uses a hierarchy of abstraction graphs, iteratively searches to find optimal paths, and refines those paths until a base level is found. Our most successful approach introduces a cached heuristic that reduces the effort spent re-searching in a graph. | TRID-ID TR08-05

• Date created

  2008

• Subjects / Keywords

  • Refinement
  • Heuristic search
  • Abstractions

• Type of Item

  Report

• DOI

  https://doi.org/10.7939/R3TB0XV04

• License

  Attribution 3.0 International