Towards rational deployment of multiple heuristics in A* (extended abstract)

David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas

Research output: Contribution to conferencePaperpeer-review

Abstract

In this paper we discuss and experiment with Lazy A-, a variant of A- where heuristics are evaluated lazily and with rational lazy A-, which decides whether to compute the more expensive heuristics at all, based on a myopic value of information estimate. Full version appears in IJCAI-2013 (Tolpin et al. 2013)

Original languageEnglish
Pages220-221
Number of pages2
StatePublished - 1 Dec 2013
Event6th Annual Symposium on Combinatorial Search, SoCS 2013 - Leavenworth, WA, United States
Duration: 11 Jul 201313 Jul 2013

Conference

Conference6th Annual Symposium on Combinatorial Search, SoCS 2013
Country/TerritoryUnited States
CityLeavenworth, WA
Period11/07/1313/07/13

Fingerprint

Dive into the research topics of 'Towards rational deployment of multiple heuristics in A* (extended abstract)'. Together they form a unique fingerprint.

Cite this