Scalable, Parallel Best-First Search for Optimal Sequential Planning

  title={Scalable, Parallel Best-First Search for Optimal Sequential Planning},
  author={Akihiro Kishimoto and Alex S. Fukunaga and Adi Botea},
Large-scale, parallel clusters composed of commodity processors are increasingly available, enabling the use of vast processing capabilities and distributed RAM to solve hard search problems. We investigate parallel algorithms for optimal sequential planning, with an emphasis on exploiting distributed memory computing clusters. In particular, we focus on an approach which distributes and schedules work among processors based on a hash function of the search state. We use this approach to… CONTINUE READING
Highly Cited
This paper has 62 citations. REVIEW CITATIONS


Publications citing this paper.

63 Citations

Citations per Year
Semantic Scholar estimates that this publication has 63 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 27 references

BestFirst Heuristic Search for Multi-Core Machines

  • E. Burns, S. Lemons, R. Zhou, W. Ruml
  • Proceedings of IJCAI.
  • 2009
Highly Influential
15 Excerpts

Principles of Parallel Programming

  • C. Lin, L. Snyder
  • Addison–Wesley.
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…