Learning from multiple heuristics

Mehdi Samadi, Ariel Felner, Jonathan Schaeffer

Research output: Contribution to conferencePaperpeer-review

4 Scopus citations

Abstract

Heuristic functions for single-agent search applications estimate the cost of the optimal solution. When multiple heuristics exist, taking their maximum is an effective way to combine them. A new technique is introduced for combining multiple heuristic values. Inspired by the evaluation functions used in two-player games, the different heuristics in a single-agent application are treated as features of the problem domain. An ANN is used to combine these features into a single heuristic value. This idea has been implemented for the sliding-tile puzzle and the 4-peg Towers of Hanoi, two classic single-agent search domains. Experimental results show that this technique can lead to a large reduction in the search effort at a small cost in the quality of the solution obtained.

Original languageEnglish
Pages100-105
Number of pages6
StatePublished - 2008
Externally publishedYes
Event2008 AAAI Workshop - Chicago, IL, United States
Duration: 13 Jul 200814 Jul 2008

Conference

Conference2008 AAAI Workshop
Country/TerritoryUnited States
CityChicago, IL
Period13/07/0814/07/08

Fingerprint

Dive into the research topics of 'Learning from multiple heuristics'. Together they form a unique fingerprint.

Cite this