Searching with a Corrupted Heuristic


  • Levi Lelis Universidade Federal de Viçosa
  • Richard Valenzano University of Toronto
  • Gabriel Nazar Universidade Federal do Rio Grande do Sul
  • Roni Stern Ben Gurion University of the Negev



memory-based heuristics, resilient algorithms, IDA*, memory corruption, bounded-suboptimal search, energy consumption


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.