This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
- 346 views
- 296 downloads
Coarse-to-Fine Search Techniques
-
- Author(s) / Creator(s)
-
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
-
- Type of Item
- Report
-
- License
- Attribution 3.0 International