Skip to main content
Article thumbnail
Location of Repository

Coarse-to-Fine Search Techniques by

By Ken Anderson, Nathan Sturtevant, Robert Holte and Jonathan SchaefferKen Anderson, Nathan Sturtevant, Robert Holte and Jonathan Schaeffer

Abstract

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.

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.161.4420
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.ualberta.ca/Tech... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.