ERA

Download the full-sized PDF of Coarse-to-Fine Search TechniquesDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3TB0XV04

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

Coarse-to-Fine Search Techniques Open Access

Descriptions

Author or creator
Anderson, Ken
Sturtevant, Nathan
Holte, Robert
Schaeffer, Jonathan
Additional contributors
Subject/Keyword
Heuristic search
Abstraction
Refinement
Type of item
Computing Science Technical Report
Computing science technical report ID
TR08-05
Language
English
Place
Time
Description
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.
Date created
2008
DOI
doi:10.7939/R3TB0XV04
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-29T16:37:06.091+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 208527
Last modified: 2015:10:12 13:28:05-06:00
Filename: TR08-05.pdf
Original checksum: 955a01f265159ba64a859c2fcc2c7888
Well formed: true
Valid: true
Page count: 15
Activity of users you follow
User Activity Date