9 citations · 21 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.AI2023
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…
cs.RO2023
GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations
Shohin Mukherjee, Maxim Likhachev
Parallel search algorithms have been shown to improve planning speed by harnessing the multithreading capability of modern processors. One such algorithm PA*SE achieves this by par…