Parallel AI Planning on the SCC
暂无分享,去创建一个
[1] Ira Pohl,et al. Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..
[2] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[3] Blai Bonet,et al. A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.
[4] Craig A. Knoblock,et al. PDDL-the planning domain definition language , 1998 .
[5] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[6] Jonathan Schaeffer,et al. Transposition Table Driven Work Scheduling in Distributed Game-Tree Search , 2002, Canadian Conference on AI.
[7] Vincent Vidal,et al. A Lookahead Strategy for Heuristic Search Planning , 2004, ICAPS.
[8] Paolo Traverso,et al. Automated planning - theory and practice , 2004 .
[9] Friedemann Mattern,et al. Algorithms for distributed termination detection , 1987, Distributed Computing.
[10] José Nelson Amaral,et al. Sequential and Parallel Algorithms for Frontier A* with Delayed Duplicate Detection , 2006, AAAI.
[11] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[12] Akihiro Kishimoto,et al. Scalable, Parallel Best-First Search for Optimal Sequential Planning , 2009, ICAPS.
[13] Vincent Vidal,et al. Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning , 2010, SOCS.
[14] Richard Dearden,et al. AyAlsoPlan: Bitstate Pruning for State-Based Planning on Massively Parallel Compute Clusters , 2011 .
[15] V. Vidal. YAHSP 2 : Keep It Simple , Stupid , 2011 .
[16] Nathan R. Sturtevant,et al. ArvandHerd: Parallel Planning with a Portfolio , 2012, ECAI.