1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Hanlan Yang, Shohin Mukherjee, Maxim Likhachev
Anytime search algorithms are useful for planning problems where a solution is desired under a limited time budget. Anytime algorithms first aim to provide a feasible solution quic…