Yet more planning efficiency: Finite-domain state-variable reformulation
暂无分享,去创建一个
[1] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[2] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[3] Raz Nissim. The Merge-and-Shrink Planner : Bisimulation-based Abstraction for Optimal Planning , 2011 .
[4] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[5] Subbarao Kambhampati,et al. Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework , 2005, ICAPS.
[6] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1990, BIT.
[7] V. S. Subrahmanian,et al. Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..
[8] Michael Gelfond,et al. Action Languages , 1998, Electron. Trans. Artif. Intell..
[9] J. Jeffry Howbert,et al. The Maximum Clique Problem , 2007 .
[10] Subbarao Kambhampati,et al. A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems , 2007, ICAPS.
[11] Erez Karpas,et al. The SelMax Planner: Online Learning for Speeding up Optimal Planning , 2010 .
[12] Malte Helmert,et al. A Stochastic Local Search Approach to Vertex Cover , 2007, KI.
[13] Patrik Haslum,et al. Admissible Heuristics for Automated Planning , 2006 .
[14] Carlos Linares López,et al. The 2011 International Planning Competition , 2011 .
[15] Roman Barták,et al. Towards AI Planning Efficiency: Finite-Domain State Variable Reformulation , 2013, SARA.
[16] Patrik Haslum,et al. Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.
[17] R. Boppana. Approximating Maximum Independent Sets by Excluding Subgraphs 1 , 1990 .
[18] Subbarao Kambhampati,et al. An LP-Based Heuristic for Optimal Planning , 2007, CP.
[19] Jendrik Seipp,et al. Fluent Merging for Classical Planning Problems , 2011 .
[20] Craig A. Knoblock,et al. PDDL-the planning domain definition language , 1998 .
[21] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[22] Jörg Hoffmann,et al. Fast Downward Stone Soup , 2011 .
[23] Malte Helmert,et al. Concise finite-domain representations for PDDL planning tasks , 2009, Artif. Intell..
[24] Yixin Chen,et al. A Novel Transition Based Encoding Scheme for Planning as Satisfiability , 2010, AAAI.
[25] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[26] Erez Karpas,et al. BJOLP: The Big Joint Optimal Landmarks Planner , 2011 .
[27] C. Fawcett,et al. FD-Autotune: Automated Configuration of Fast Downward , 2011 .
[28] Stefan Edelkamp,et al. Automated Planning: Theory and Practice , 2007, Künstliche Intell..
[29] Malte Helmert,et al. LM-Cut : Optimal Planning with the Landmark-Cut Heuristic ∗ , 2009 .
[30] Patrik Haslum,et al. Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning , 2007, AAAI.
[31] Agostino Dovier,et al. Multivalued action languages with constraints in CLP(FD) , 2010, Theory Pract. Log. Program..
[32] Jussi Rintanen,et al. An Iterative Algorithm for Synthesizing Invariants , 2000, AAAI/IAAI.
[33] Edwin P. D. Pednault,et al. FORMULATING MULTIAGENT, DYNAMIC-WORLD PROBLEMS IN THE CLASSICAL PLANNING FRAMEWORK , 1987 .
[34] R. Barták,et al. Two Semantics for Step-Parallel Planning : Which One to Choose ? , 2011 .
[35] Craig A. Knoblock,et al. Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.
[36] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[37] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[38] Lenhart K. Schubert,et al. Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.