Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies
暂无分享,去创建一个
[1] Jeffrey S. Rosenschein,et al. Exploiting Problem Symmetries in State-Based Planners , 2011, AAAI.
[2] Erez Karpas,et al. Optimal Search with Inadmissible Heuristics , 2012, ICAPS.
[3] Alfons Laarman,et al. Guard-based partial-order reduction , 2013, International Journal on Software Tools for Technology Transfer.
[4] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[5] Yixin Chen,et al. Completeness and Optimality Preserving Reduction for Planning , 2009, IJCAI.
[6] Andrew Coles,et al. Completeness-Preserving Pruning for Optimal Planning , 2010, ECAI.
[7] Antti Valmari,et al. Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.
[8] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[9] Ronen I. Brafman,et al. Tunneling and Decomposition-Based State Reduction for Optimal Planning , 2012, ECAI.
[10] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[11] Malte Helmert,et al. The Relative Pruning Power of Strong Stubborn Sets and Expansion Core , 2013, ICAPS.
[12] Malte Helmert,et al. Concise finite-domain representations for PDDL planning tasks , 2009, Artif. Intell..
[13] Malte Helmert,et al. About Partial Order Reduction in Planning and Computer Aided Verification , 2012, ICAPS.
[14] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[15] Jonathan Schaeffer,et al. Sokoban: Enhancing general single-agent search methods using domain knowledge , 2001, Artif. Intell..
[16] Malte Helmert,et al. A Stubborn Set Algorithm for Optimal Planning , 2012, ECAI.
[17] Jaco Geldenhuys,et al. Exploring the Scope for Partial Order Reduction , 2009, ATVA.