@inproceedings{842eae51c2894915b19801bd6ba44d56,
title = "Searching with a corrupted heuristic",
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.",
author = "Lelis, {Levi H.S.} and Gabriel Nazar and Richard Valenzano and Roni Stern",
note = "Publisher Copyright: Copyright {\textcopyright} 2016 AAAI press. All Rights Reserved.; 9th Annual Symposium on Combinatorial Search, SoCS 2016 ; Conference date: 06-07-2016 Through 08-07-2016",
year = "2016",
month = jan,
day = "1",
language = "English",
series = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",
publisher = "AAAI press",
pages = "63--71",
editor = "Baier, {Jorge A.} and Adi Botea",
booktitle = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",
}