18 citations · 18 across the 1 of their papers we have counts for
1 paper
Vadim Bulitko, Yngvi Björnsson, Ramon Lawrence
Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action, independent of problem size. As a result, they scale up well as problems become…