Takumi Shimoda

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search

Parallelization of non-admissible search algorithms such as GBFS poses a challenge because straightforward parallelization can result in search behavior which significantly deviates from sequential search. Previous work proposed PUHF, a parallel search algorithm which is constrained to only expand…