Searching with a Corrupted Heuristic.

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