Best-first heuristic search for multicore machines

Journal of Artificial Intelligence Research

Volumn 39, Issue , 2010, Pages 689-743

  Burns, Ethan ^a   Lemons, Sofia ^a   Ruml, Wheeler ^a   Zhou, Rong ^b  

^a Univ of New Hampshire   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST FIRST SEARCH; CORE MACHINES; EMPIRICAL COMPARISON; HEURISTIC SEARCH; MULTI-CORE MACHINES; MULTI-CORE PROCESSOR; PARALLEL SEARCH; PARALLEL VERSION; PATHFINDING; SHARED MEMORIES; SLIDING-TILE PUZZLES; STATE SPACE; STRIPS PLANNING;

TEMPORAL LOGIC;

MODULAR ROBOTS;

EID: 78651431732     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3094     Document Type: Article

References (45)

1. Burns, E., Lemons, S., Ruml, W., & Zhou, R. (2009a). Suboptimal and anytime heuristic search on multi-core machines. In Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS-09).
2. Burns, E., Lemons, S., Zhou, R., & Ruml, W. (2009b). Best-first heuristic search for multi-core machines. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-09).
3. Cushing, W., Bentor, J., & Kambhampati, S. (2010). Cost based search considered harmful. In The 2010 International Symposium on Combinatorial Search (SOCS-10).
4. Dai, P., & Hansen, E. A. (2007). Prioritizing bellman backups without a priority queue. In Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS-09).
5. Davis, H. W., Bramanti-Gregor, A., & Wang, J. (1988). The advantages of using depth and breadth components in heuristic search. In Methodologies for Intelligent Systems 3, pp. 19-28.
6. Edelkamp, S., & Schrödl, S. (2000). Localizing A*. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), pp. 885-890. AAAI Press.
7. Edelkamp, S., & Sulewski, D. (2010). GPU exploration of two-player games with perfect hash functions. In The 2010 International Symposium on Combinatorial Search (SOCS-10).
8. Evans, J. (2006). A scalable concurrent malloc(3) implementation for FreeBSD. In Proceedings of BSDCan 2006.
9. Evett, M., Hendler, J., Mahanti, A., & Nau, D. (1995). PRA*-massively-parallel heuristic-search. Journal of Parallel and Distributed Computing, 25(2), 133-143.
10. Felner, A., Kraus, S., & Korf, R. (2003). KBFS: K-best-first search. Annals of Mathematics and Artificial Intelligence, 39(1-2), 19-39.
11. Ferguson, C., & Korf, R. E. (1988). Distributed tree search and its applications to alpha-beta pruning. In Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88).
12. Hansen, E. A., & Zhou, R. (2007). Anytime heuristic search. Journal of Artificial Intelligence Research, 28, 267-297.
13. Harris, T. L. (2001). A pragmatic implementation of non-blocking linked-lists. In Lecture Notes in Computer Science, Vol. 2180/2001, pp. 300-314. Springer Berlin / Heidelberg.
14. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics, SSC-4(2), 100-107.
15. Haslum, P., & Geffner, H. (2000). Admissible heuristics for optimal planning. In Proceedings of the Fifth Internationas Conference on Artificial Intelligence Planning and Scheduling Systems (AIPS-00), pp. 140-149.
16. Holzmann, G. J., & Bosnacki, D. (2007). The design of a multicore extension of the SPIN model checker. IEEE Transactions on Software Engineering, 33(10), 659-674.
17. Jabbar, S., & Edelkamp, S. (2006). Parallel external directed model checking with linear I/O. In Emerson, E., & Namjoshi, K. (Eds.), Verification, Model Checking, and Abstract Interpretation, Vol. 3855 of Lecture Notes in Computer Science, pp. 237-251. Springer Berlin / Heidelberg.
18. Kishimoto, A., Fukunaga, A., & Botea, A. (2009). Scalable, parallel best-first search for optimal sequential planning. In Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS-09).
19. Korf, R. E. (1985). Iterative-deepening-A*: An optimal admissible tree search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-85), pp. 1034-1036.
20. Korf, R. E. (1993). Linear-space best-first search. Artificial Intelligence, 62(1), 41-78.
21. Korf, R. E. (2003). Delayed duplicate detection: extended abstract. In Proceedings of the Eighteenth International Joint Conference on Articial Intelligence (IJCAI-03), pp. 1539-1541.
22. Korf, R. E., & Schultze, P. (2005). Large-scale parallel breadth-first search. In Proceedings of the Twentieth National Conference on Articial Intelligence (AAAI-05), pp. 1380-1385.
23. Kumar, V., Ramesh, K., & Rao, V. N. (1988). Parallel best-first search of state-space graphs: A summary of results. In Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88), pp. 122-127.
24. Lamport, L. (2002). Specifying Systems: The TLA Language and Tools for Hardware and Software Engineers. Addison-Wesley.
25. Likhachev, M., Gordon, G., & Thrun, S. (2003). ARA*: Anytime A* with provable bounds on sub-optimality. In Proceedings of the Seventeenth Annual Conference on Neural Information Porcessing Systems (NIPS-03).
26. Likhachev, M., Gordon, G., & Thrun, S. (2003). ARA*: Formal analysis. Tech. rep. CMU-CS-03-148, Carnegie Mellon University School of Computer Science.
27. Niewiadomski, R., Amaral, J., & Holte, R. (2006a). A parallel external-memory frontier breadth-first traversal algorithm for clusters of workstations. In Proceedings of the 2006 International Conference on Parallel Processing (ICPP-06), pp. 531-538.
28. Niewiadomski, R., Amaral, J. N., & Holte, R. C. (2006b). Sequential and parallel algorithms for frontier A* with delayed duplicate detection. In Proceedings of the 21st national conference on Artificial intelligence (AAAI-06), pp. 1039-1044. AAAI Press.
29. Nilsson, N. J. (1980). Principles of Artificial Intelligence. Tioga Publishing Co.
30. Pohl, I. (1970). Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1, 193-204.
31. Powley, C., & Korf, R. E. (1991). Single-agent parallel window search. IEEE Transactions Pattern Analysis Machine Intelligence, 13(5), 466-477.
32. Richter, S., & Westphal, M. (2010). The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research, 39.
33. Ruml, W., & Do, M. B. (2007). Best-first utility-guided search. In Proceedings of IJCAI-07, pp. 2378-2384.
34. Snir, M., & Otto, S. (1998). MPI-The Complete Reference: The MPI Core. MIT Press, Cambridge, MA, USA.
35. Stern, U., & Dill, D. L. (1998). Using magnetic disk instead of main memory in the mur φ verifier. In Computer Aided Verification, pp. 172-183. Springer.
36. Sundell, H., & Tsigas, P. (2005). Fast and lock-free concurrent priority queues for multi-thread systems. Parallel and Distributed Processing Symposium, International, 65(5), 609-627.
37. Thayer, J. T., & Ruml, W. (2008). Faster than weighted A*: An optimistic approach to bounded suboptimal search. In Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS-08).
38. Valois, J. D. (1995). Lock-Free Data Structures. Ph.D. thesis, Rensselaer Polytechnic Institute.
39. Yu, Y., Manolios, P., & Lamport, L. (1999). Model checking TLA specifications. In Correct Hardware Design and Verification Methods, pp. 54-66. Springer Berlin / Heidlberg.
40. Zhou, R., & Hansen, E. (2006). Domain-independent structured duplicate detection. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-06), pp. 1082-1087. (Pubitemid 44705420)
41. Zhou, R., & Hansen, E. (2007). Edge partitioning in external-memory graph search. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07).
42. Zhou, R., & Hansen, E. (2009). Dynamic state-space partitioning in external-memory graph search. In The 2009 International Symposium on Combinatorial Search (SOCS-09).
43. Zhou, R., & Hansen, E. A. (2004). Structured duplicate detection in external-memory graph search. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04).
44. Zhou, R., & Hansen, E. A. (2006). Breadth-first heuristic search. Artificial Intelligence, 170(4-5), 385-408.
45. Zhou, R., & Hansen, E. A. (2007). Parallel structured duplicate detection. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07).