A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations

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…