Scalable, parallel best-first search for optimal sequential planning

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 201-208

  Kishimoto, Akihiro ^a   Fukunaga, Alex ^a   Botea, Adi ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BEST FIRST SEARCH; COMMODITY PROCESSORS; COMPUTING CLUSTERS; DISTRIBUTED MEMORY; MULTI-CORE MACHINES; OPTIMAL SEQUENTIAL; PARALLEL CLUSTERS; PARALLELIZING; PROCESSING CAPABILITY; SCALING BEHAVIOR; SEARCH PROBLEM; SHARED MEMORIES;

HASH FUNCTIONS; OPTIMIZATION; PARALLEL ALGORITHMS; PLANNING; RANDOM ACCESS STORAGE;

CLUSTERING ALGORITHMS;

EID: 78650608544     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. + Planning. Computational Intelligence 11(4):625-655.
2. Botea, A.; Enzenberger, M.; Müller, M.; and Schaeffer, J. 2005. Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. Journal of Artificial Intelligence Research 24:581-621. (Pubitemid 43130945)
3. Burns, E.; Lemons, S.; Zhou, R.; and Ruml, W. 2009. Best-First Heuristic Search for Multi-Core Machines. In Proceedings of IJCAI.
4. Edelkamp, S., and Jabbar, S. 2006. Cost-optimal external planning. In Proceedings of AAAI, 821-826.
5. Edelkamp, S. 2001. Planning with Pattern Databases. In Proceedings of European Conference on Planning, 13-34.
6. Evett, M.; Hendler, J.; Mahanti, A.; and Nau, D. 1995. PRA*: Massively parallel heuristic search. Journal of Parallel and Distributed Computing 25(2):133-143.
7. Feldmann, R. 1993. Spielbaumsuche auf Massiv Parallelen Systemen. Ph.D. Dissertation, University of Paderborn. English translation titled Game Tree Search on Massively Parallel Systems is available.
8. Frigo, M.; Leiserson, C. E.; and Randall, K. H. 1998. The Implementation of the Cilk-5 Multithreaded Language. In ACM SIGPLAN Conferences on Programming Language Design and Implementation (PLDF98), 212-223.
9. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans. on Systems Science and Cybernetics 4(2):100-107.
10. Haslum, P., and Geffner, H. 2000. Admissible Heuristics for Optimal Planning. In Proc. Fifth International Conference on AI Planning and Scheduling, 140-149.
11. Helmert, M., and Roger, G. 2008. How Good Is Almost Perfect? In Proceedings of AAAI-08, 944-949.
12. Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible Abstraction Heuristics for Optimal Sequential Planning. In Proceedings of ICAPS-07, 176-183.
13. Kishimoto, A., and Schaeffer, J. 2002. Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling. In Proceedings of the 31st International Conference on Parallel Processing ICPP-02, 323-330.
14. Korf, R. E., and Zhang, W. 2000. Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of AAAI-2000, 910-916.
15. Korf, R. 1985. Depth-first Iterative Deepening: An Optimal Admissible Tree Search. Artificial Intelligence 97:97-109. (Pubitemid 15604803)
16. Kumar, V.; Ramesh, K.; and Rao, V. N. 1988. Parallel best-first search of state-space graphs: A summary of results. In Proceedings of AAAI-88, 122-127.
17. Lin, C., and Snyder, L. 2009. Principles of Parallel Programming. Addison-Wesley.
18. Mattern, F. 1987. Algorithms for distributed termination detection. Distributed Computing 2(3):161-175. (Pubitemid 18536931)
19. Rao, V. N., and Kumar, V. 1987. Parallel depth-first search on multiprocessors part 1: Implementation. International Journal of Parallel Programming 16(6):479-499.
20. Romein, J. W., and Bal, H. E. 2003. Solving awari with parallel retrograde analysis. IEEE Computer 36(10):26-33.
21. Romein, J. W.; Plaat, A.; Bal, H. E.; and Schaeffer, J. 1999. Transposition Table Driven Work Scheduling in Distributed Search. In Proceedings of AAAI-99, 725-731.
22. Romein, J. W.; Bal, H. E.; Schaeffer, J.; and Plaat, A. 2002. A performance analysis of transposition-table-driven work scheduling in distributed search. IEEE Transactions on Parallel and Distributed Systems 13(5):447-459. (Pubitemid 34669579)
23. Snir, M., and Gropp, W. 1998. MPI: The Complete Reference. MIT Press.
24. Zhou, R., and Hansen, E. 2004. Structured Duplicate Detection in External-Memory Graph Search. In Proceedings of AAAI-04, 683-689.
25. Zhou, R., and Hansen, E. 2006. Domain-independent structured duplicate detection. In Proc. AAAI-06, 683-688.
26. Zhou, R., and Hansen, E. 2007. Parallel Structured Duplicate Detection. In Proceedings of AAAI-07, 1217-1223.
27. Zobrist, A. L. 1970. A new hashing method with applications for game playing. Technical report, Dept of CS, Univ. of Wisconsin, Madison. Reprinted in International Computer Chess Association Journal, 13(2):169-173, 1990.