TY - GEN
T1 - Abstraction-based heuristics with true distance computations
AU - Felner, Ariel
AU - Sturtevant, Nathan
AU - Schaeffer, Jonathan
PY - 2009/12/1
Y1 - 2009/12/1
N2 - Pattern Databases (FDBs) are the most common form of memory-based heuristics, and they have been widely used in a variety of permutation puzzles and other domains. We explore the (rue-distance heuristics (TDHs) (also appeared in (Sturtevant et al 2009)) which are a different form of memory-based heuristics, designed to work in problem states where there isn't a fixed goal state. Unlike PDBs, which build a heuristic based on distances in an abstract state space, TDHs store distances which are computed in the actual state space. We look in detail at how TDHs work, providing both theoretical and experimental motivation for their use.
AB - Pattern Databases (FDBs) are the most common form of memory-based heuristics, and they have been widely used in a variety of permutation puzzles and other domains. We explore the (rue-distance heuristics (TDHs) (also appeared in (Sturtevant et al 2009)) which are a different form of memory-based heuristics, designed to work in problem states where there isn't a fixed goal state. Unlike PDBs, which build a heuristic based on distances in an abstract state space, TDHs store distances which are computed in the actual state space. We look in detail at how TDHs work, providing both theoretical and experimental motivation for their use.
UR - http://www.scopus.com/inward/record.url?scp=84860456686&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84860456686
SN - 9781577354338
T3 - SARA 2009 - Proceedings, 8th Symposium on Abstraction, Reformulation and Approximation
SP - 74
EP - 81
BT - SARA 2009 - Proceedings, 8th Symposium on Abstraction, Reformulation and Approximation
T2 - 8th Symposium on Abstraction, Reformulation and Approximation, SARA 2009
Y2 - 7 July 2009 through 10 July 2009
ER -