Coarse-to-Fine Search Techniques

Simple item page
dc.contributor.authorSchaeffer, Jonathan
dc.contributor.authorSturtevant, Nathan
dc.contributor.authorHolte, Robert
dc.contributor.authorAnderson, Ken
dc.date.accessioned2025-05-01T21:13:27Z
dc.date.available2025-05-01T21:13:27Z
dc.date.issued2008
dc.descriptionTechnical 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
dc.identifier.doihttps://doi.org/10.7939/R3TB0XV04
dc.language.isoen
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/
dc.subjectRefinement
dc.subjectHeuristic search
dc.subjectAbstractions
dc.titleCoarse-to-Fine Search Techniques
dc.typehttp://purl.org/coar/resource_type/c_93fc
ual.jupiterAccesshttp://terms.library.ualberta.ca/public

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR08-05.pdf
Size:
203.64 KB
Format:
Adobe Portable Document Format
Download

Collections

Technical Reports (Computing Science)