TY - GEN
T1 - Early work on optimization-based heuristics for the sliding tile puzzle
AU - Felner, Ariel
N1 - Publisher Copyright:
© 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - Optimization-based heuristics may offer very good estimates. But, calculating them may be time consuming, especially if the optimization problem is intractable. This raises the question of their applicability. This paper summarizes early work from the year 2000 on optimization-based heuristics in the context of PDBs for the Tile-Puzzle. We show that an admissible heuristic based on Vertex-Cover (VC) can be calculated in reasonable time over a large collection of small PDBs. When larger PDBs are involved we suggest the idea of using another lookup table that precalculates and stores all possible relevant VC values. This table can be later looked up in a constant time during the search. We discuss the conditions under which this idea can be generalized. Experimental results demonstrate the applicability of these two ideas on the 15- and 24-Puzzle. The first idea appeared in (Felner, Korf, and Hanan 2004) but the second idea is presented here for the first time.
AB - Optimization-based heuristics may offer very good estimates. But, calculating them may be time consuming, especially if the optimization problem is intractable. This raises the question of their applicability. This paper summarizes early work from the year 2000 on optimization-based heuristics in the context of PDBs for the Tile-Puzzle. We show that an admissible heuristic based on Vertex-Cover (VC) can be calculated in reasonable time over a large collection of small PDBs. When larger PDBs are involved we suggest the idea of using another lookup table that precalculates and stores all possible relevant VC values. This table can be later looked up in a constant time during the search. We discuss the conditions under which this idea can be generalized. Experimental results demonstrate the applicability of these two ideas on the 15- and 24-Puzzle. The first idea appeared in (Felner, Korf, and Hanan 2004) but the second idea is presented here for the first time.
UR - http://www.scopus.com/inward/record.url?scp=84964613551&partnerID=8YFLogxK
M3 - Conference contribution
T3 - AAAI Workshop - Technical Report
SP - 32
EP - 38
BT - Planning, Search, and Optimization - Papers Presented at the 29th AAAI Conference on Artificial Intelligence, Technical Report
PB - AI Access Foundation
T2 - 29th AAAI Conference on Artificial Intelligence, AAAI 2015
Y2 - 25 January 2015 through 30 January 2015
ER -