An LP-Based Heuristic for Optimal Planning
暂无分享,去创建一个
[1] Drew McDermott,et al. A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.
[2] Subbarao Kambhampati,et al. Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework , 2005, ICAPS.
[3] P. Pandurang Nayak,et al. A Reactive Planner for a Model-based Executive , 1997, IJCAI.
[4] Christer Bäckström,et al. Tractable plan existence does not imply tractable plan generation , 2004, Annals of Mathematics and Artificial Intelligence.
[5] Jj Org Hoomann. Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks , 2003 .
[6] Ilkka Niemelä,et al. Planning as satisfiability: parallel plans and algorithms for plan search , 2006, Artif. Intell..
[7] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[8] Patrik Haslum,et al. New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.
[9] Vincent Vidal,et al. A Lookahead Strategy for Heuristic Search Planning , 2004, ICAPS.
[10] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[11] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[12] Christos G. Cassandras,et al. Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.
[13] Blai Bonet,et al. A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.
[14] Jonathan Schaeffer,et al. Fast Planning with Iterative Macros , 2007, IJCAI.
[15] Dana S. Nau,et al. On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.
[16] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[17] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[18] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[19] Drew McDermott,et al. Using Regression-Match Graphs to Control Search in Planning , 1999, Artif. Intell..
[20] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[21] Tom Bylander. A Linear Programming Heuristic for Optimal Planning , 1997, AAAI/IAAI.
[22] Subbarao Kambhampati,et al. A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems , 2007, ICAPS.