Symmetry Breaking in Star-Topology Decoupled Search – Technical Report
暂无分享,去创建一个
[1] Jörg Hoffmann,et al. "Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability , 2014, ECAI.
[2] Malte Helmert,et al. Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning , 2015, IJCAI.
[3] Ronen I. Brafman,et al. On the complexity of planning for agent teams and its implications for single agent planning , 2013, Artif. Intell..
[4] Olivier Buffet,et al. Factored Planning Using Decomposition Trees , 2007, IJCAI.
[5] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[6] Maria Fox,et al. The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.
[7] D. Long,et al. E cient Implementation of the Plan Graph in STAN , 1999 .
[8] Jörg Hoffmann,et al. Beating LM-Cut with hmax (Sometimes): Fork-Decoupled State Space Search , 2015, ICAPS.
[9] Michael Katz,et al. Metis: Arming Fast Downward with Pruning and Incremental Computation , 2014 .
[10] Jeffrey S. Rosenschein,et al. Exploiting Problem Symmetries in State-Based Planners , 2011, AAAI.
[11] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[12] Malte Helmert,et al. Factored Symmetries for Merge-and-Shrink Abstractions , 2015, AAAI.
[13] P. H. Starke,et al. Reachability analysis of Petri nets using symmetries , 1991 .
[14] Jussi Rintanen,et al. Symmetry Reduction for SAT Representations of Transition Systems , 2003, ICAPS.
[15] Ronen I. Brafman,et al. From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.
[16] Petteri Kaski,et al. Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs , 2007, ALENEX.
[17] Carmel Domshlak,et al. From Fork Decoupling to Star-Topology Decoupling , 2015, SOCS.
[18] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[19] Christer Bäckström,et al. Fast Detection of Unsolvable Planning Instances Using Local Consistency , 2013, SOCS.
[20] Ronen I. Brafman,et al. Factored Planning: How, When, and When Not , 2006, AAAI.
[21] Eugene M. Luks,et al. Permutation Groups and Polynomial-Time Computation , 1996, Groups And Computation.
[22] Jörg Hoffmann,et al. On State-Dominance Criteria in Fork-Decoupled Search , 2016, IJCAI.
[23] Alexander Shleyfman. Symmetry Breaking in Deterministic Planning as Forward Search : Orbit Space Search Algorithm , 2015 .
[24] Malte Helmert,et al. Heuristics and Symmetries in Classical Planning , 2015, AAAI.
[25] Carmel Domshlak,et al. Symmetry Breaking: Satisficing Planning and Landmark Heuristics , 2013, ICAPS.
[26] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[27] Patrik Haslum,et al. Cost-Optimal Factored Planning: Promises and Pitfalls , 2010, ICAPS.
[28] Eyal Amir,et al. Factored planning , 2003, IJCAI 2003.
[29] Craig A. Knoblock. Automatically Generating Abstractions for Planning , 1994, Artif. Intell..
[30] A. Prasad Sistla,et al. Symmetry and model checking , 1993, Formal Methods Syst. Des..
[31] Jörg Hoffmann,et al. Decoupled Strong Stubborn Sets , 2016, IJCAI.
[32] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[33] Carmel Domshlak,et al. Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search , 2012, ICAPS.