Scalable Parallel Best-First Search for Optimal Sequential Planning
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling|
|01_Kishimoto_Scalable_Parallel_Best-First_2009.pdf||151.28 kB||Adobe PDF||Request a copy|
|02_Kishimoto_Scalable_Parallel_Best-First_2009.pdf||51.79 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.