Where Ignoring Delete Lists Works, Part II: Causal Graphs
暂无分享,去创建一个
[1] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Adele E. Howe,et al. Learning from planner performance , 2009, Artif. Intell..
[4] Jörg Hoffmann. Utilizing Problem Structure in Planning: A Local Search Approach , 2003, Künstliche Intell..
[5] Malte Helmert,et al. Landmarks Revisited , 2008, AAAI.
[6] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[7] Christer Bäckström,et al. Incremental planning , 1996 .
[8] Jussi Rintanen,et al. An Iterative Algorithm for Synthesizing Invariants , 2000, AAAI/IAAI.
[9] P. Haslum. Reducing Accidental Complexity in Planning Problems , 2007, IJCAI.
[10] Anders Jonsson,et al. Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard , 2009, J. Artif. Intell. Res..
[11] Carmel Domshlak,et al. Structural Patterns Heuristics via Fork Decomposition , 2008, ICAPS.
[12] Jörg Hoffmann. Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+ , 2011, J. Artif. Intell. Res..
[13] Jorg Homann. Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h + , 2011 .
[14] Maria Fox,et al. The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.
[15] Ivan Serina,et al. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..
[16] Jörg Hoffmann,et al. Local Search Topology in Planning Benchmarks: An Empirical Analysis , 2001, IJCAI.
[17] Malte Helmert,et al. A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.
[18] Jörg Hoffmann,et al. Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..
[19] Malte Helmert,et al. Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.
[20] Christer Bäckström,et al. State-Variable Planning Under Structural Restrictions: Algorithms and Complexity , 1998, Artif. Intell..
[21] Amedeo Cesta,et al. Recent Advances in AI Planning , 1997, Lecture Notes in Computer Science.
[22] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[23] Craig A. Knoblock. Automatically Generating Abstractions for Planning , 1994, Artif. Intell..
[24] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[25] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[26] Hubie Chen,et al. Causal graphs and structurally restricted planning , 2010, J. Comput. Syst. Sci..
[27] Lenhart K. Schubert,et al. Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.
[28] Anders Jonsson,et al. The Complexity of Planning Problems With Simple Causal Graphs , 2008, J. Artif. Intell. Res..
[29] Carmel Domshlak,et al. New Islands of Tractability of Cost-Optimal Planning , 2008, J. Artif. Intell. Res..
[30] Ronen I. Brafman,et al. Strucutre and Complexitiy in Planning with Unary Operators , 2000, PuK.
[31] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[32] Maria Fox,et al. The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..
[33] Anders Jonsson,et al. The influence of k-dependence on the complexity of planning , 2012, Artif. Intell..
[34] Bernhard Nebel,et al. Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.
[35] Vincent Vidal,et al. A Lookahead Strategy for Heuristic Search Planning , 2004, ICAPS.
[36] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[37] Silvia Richter,et al. The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..
[38] Jonathan Schaeffer,et al. Using Component Abstraction for Automatic Generation of Macro-Actions , 2004, ICAPS.
[39] Drew McDermott,et al. Using Regression-Match Graphs to Control Search in Planning , 1999, Artif. Intell..
[40] J. Hoffmann,et al. Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks , 2005, J. Artif. Intell. Res..
[41] Christer Bäckström,et al. Planning in polynomial time: the SAS‐PUBS class , 1991, Comput. Intell..
[42] Malte Helmert,et al. Complexity results for standard benchmark domains in planning , 2003, Artif. Intell..
[43] Erez Karpas,et al. Sensible Agent Technology Improving Coordination and Communication in Biosurveillance Domains , 2009, IJCAI.
[44] Maria Fox,et al. Automatic Synthesis and Use of Generic Types in Planning , 2000, AIPS.
[45] Anders Jonsson. The Role of Macros in Tractable Planning , 2009, J. Artif. Intell. Res..
[46] P. Pandurang Nayak,et al. A Reactive Planner for a Model-based Executive , 1997, IJCAI.
[47] Hector Geffner,et al. Heuristic Planning with Time and Resources , 2014 .
[48] Carmel Domshlak,et al. Multi-agent off-line coordination: Structure and complexity , 2001 .