AAAI Publications, Thirteenth Artificial Intelligence and Interactive Digital Entertainment Conference

Font Size: 
Robustness of Real-Time Heuristic Search Algorithms to Read/Write Error in Externally Stored Heuristics
Mina Abdi Oskouie, Vadim Bulitko

Last modified: 2017-09-19

Abstract


Real-time heuristic search algorithms follow the agent-centered search paradigm wherein the agent has access only to information local to the agent’s current position in the environment. This allows agents with constant-bounded computational faculties (e.g., memory) to take on search problems of progressively increasing sizes. As the agent’s memory does not scale with the size of the search problem, the heuristic must necessarily be stored externally, in the environment. Storing the heuristic in the environment brings the extra challenge of read/write errors. In video games, introducing error artificially to the heuristics can make the non-player characters (NPC) behave more naturally. In this paper, we evaluate effects of such errors on real-time heuristic search algorithms. In particular, we empirically study the effects of heuristic read redundancy on algorithm performance and compare its effects to the existing technique of using weights in heuristic learning. Finally, we evaluate a recently proposed technique of correcting the heuristic with a one-step error term in the presence of read/write error.

Full Text: PDF