upper-bounded independently of the problem size. Applications include
video game pathfinding and moving target pursuit. We have been
studying real-time heuristic since 2003 and made several contributions
including a discovery of lookahead pathology and ways to address it by
selecting the amount of planning time dynamically per action. We have
also designed real-time heuristic search algorithms