Searching with a corrupted heuristic

Levi H.S. Lelis, Gabriel Nazar, Richard Valenzano, Roni Stern

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

1 Scopus citations

Abstract

Memory-based heuristics are a popular and effective class of admissible heuristic functions. However, corruptions to memory they use may cause these heuristics to become inadmissible. Corruption can be caused by the physical environment due to radiation and network errors, or it can be introduced voluntarily in order to decrease energy consumption. We introduce memory error correction schemes that do not require additional memory and exploit knowledge about the behavior of consistent heuristics. This is in contrast with error correcting code approaches which can limit the amount of corruption but at the cost of additional energy and memory consumption. Search algorithms using our methods are guaranteed to find a solution if one exists and its suboptimality is bounded. Moreover, our methods are resilient to any number of memory errors that may occur. An experimental evaluation is also provided to demonstrate the applicability of our approach.

Original languageEnglish
Title of host publicationProceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016
EditorsJorge A. Baier, Adi Botea
PublisherAAAI press
Pages63-71
Number of pages9
ISBN (Electronic)9781577357698
StatePublished - 1 Jan 2016
Event9th Annual Symposium on Combinatorial Search, SoCS 2016 - Tarrytown, United States
Duration: 6 Jul 20168 Jul 2016

Publication series

NameProceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016
Volume2016-January

Conference

Conference9th Annual Symposium on Combinatorial Search, SoCS 2016
Country/TerritoryUnited States
CityTarrytown
Period6/07/168/07/16

Fingerprint

Dive into the research topics of 'Searching with a corrupted heuristic'. Together they form a unique fingerprint.

Cite this