Rational deployment of multiple heuristics in IDA*

David Tolpin, Oded Betzalel, Ariel Felner, Solomon Eyal Shimony

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. This paper applies rational metareasoning to IDA* when several admissible heuristics are available. The obvious basic approach of taking the maximum of the heuristics is improved upon by lazy evaluation of the heuristics, resulting in a variant known as Lazy IDA*. We introduce a rational version of lazy IDA* that decides whether to compute the more expensive heuristics or to bypass it, based on a myopic expected regret estimate. Empirical evaluation in several domains supports the theoretical results, and shows that rational lazy IDA* is a state-of-the-art heuristic combination method.
Original languageEnglish
Title of host publicationECAI 2014 - 21st European Conference on Artificial Intelligence, Including Prestigious Applications of Intelligent Systems, PAIS 2014, Proceedings
EditorsTorsten Schaub, Gerhard Friedrich, Barry O'Sullivan
PublisherIOS Press
Pages1107-1108
Number of pages2
ISBN (Electronic)9781614994183
DOIs
StatePublished - 1 Jan 2014
Event21st European Conference on Artificial Intelligence, ECAI 2014 - Prague, Czech Republic
Duration: 18 Aug 201422 Aug 2014

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume263
ISSN (Print)0922-6389

Conference

Conference21st European Conference on Artificial Intelligence, ECAI 2014
Country/TerritoryCzech Republic
CityPrague
Period18/08/1422/08/14

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Rational deployment of multiple heuristics in IDA*'. Together they form a unique fingerprint.

Cite this