Skip navigation
Skip navigation

Scalable Parallel Best-First Search for Optimal Sequential Planning

Kishimoto, Akihiro; Fukunaga, Alex; Botea, Adi

Description

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]

CollectionsANU Research Publications
Date published: 2009
Type: Conference paper
URI: http://hdl.handle.net/1885/24451
Source: Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling

Download

File Description SizeFormat Image
01_Kishimoto_Scalable_Parallel_Best-First_2009.pdf151.28 kBAdobe PDF    Request a copy
02_Kishimoto_Scalable_Parallel_Best-First_2009.pdf51.79 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator