The Fast Downward Planning System
暂无分享,去创建一个
[1] Earl D. Sacerdoti,et al. Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.
[2] Bruce T. Lowerre,et al. The HARPY speech recognition system , 1976 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[5] Richard E. Korf,et al. Planning as Search: A Quantitative Approach , 1987, Artif. Intell..
[6] Allen Newell,et al. GPS, a program that simulates human thought , 1995 .
[7] John W. Roach,et al. A Theoretical Analysis of Conjunctive-Goal Problems , 1989, Artif. Intell..
[8] Matthew L. Ginsberg,et al. Iterative Broadening , 1990, Artif. Intell..
[9] Qiang Yang,et al. Downward Refinement and the Efficiency of Hierarchical Problem Solving , 1994, Artif. Intell..
[10] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[11] Craig A. Knoblock. Automatically Generating Abstractions for Planning , 1994, Artif. Intell..
[12] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[13] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[14] Christer Bäckström,et al. Incremental planning , 1996 .
[15] P. Pandurang Nayak,et al. A Reactive Planner for a Model-based Executive , 1997, IJCAI.
[16] Christer Bäckström,et al. State-Variable Planning Under Structural Restrictions: Algorithms and Complexity , 1998, Artif. Intell..
[17] Malte Helmert,et al. Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.
[18] Ronen I. Brafman,et al. Strucutre and Complexitiy in Planning with Unary Operators , 2000, PuK.
[19] Teruhisa Miura,et al. A* with Partial Expansion for Large Branching Factor Problems , 2000, AAAI/IAAI.
[20] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[21] Carmel Domshlak,et al. Multi-agent off-line coordination: Structure and complexity , 2001 .
[22] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[23] Jörg Hoffmann,et al. Local Search Topology in Planning Benchmarks: An Empirical Analysis , 2001, IJCAI.
[24] Jörg Hoffmann. Local Search Topology in Planning Benchmarks: A Theoretical Analysis , 2002, PuK.
[25] Ivan Serina,et al. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..
[26] Maria Fox,et al. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..
[27] Christer Bäckström,et al. Tractable plan existence does not imply tractable plan generation , 2004, Annals of Mathematics and Artificial Intelligence.
[28] Malte Helmert,et al. A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.
[29] S. Edelkamp,et al. The Deterministic Part of IPC-4: An Overview , 2005, J. Artif. Intell. Res..
[30] Subbarao Kambhampati,et al. Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework , 2005, ICAPS.
[31] J. Hoffmann,et al. Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks , 2005, J. Artif. Intell. Res..