Enhancing Constraint Models for Planning Problems
暂无分享,去创建一个
[1] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[2] Subbarao Kambhampati,et al. Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.
[3] Roman Barták,et al. Reformulating Constraint Models for Classical Planning , 2008, FLAIRS Conference.
[4] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[5] Pieter H. Hartel,et al. Programming Languages: Implementations, Logics, and Programs , 1996, Lecture Notes in Computer Science.
[6] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[7] Mats Carlsson,et al. An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.
[8] D. Long,et al. Plan Permutation Symmetries as a Source of Planner Inefficiency , 2003 .
[9] P. Pandurang Nayak,et al. Remote Agent: To Boldly Go Where No AI System Has Gone Before , 1998, Artif. Intell..
[10] Hector Geffner,et al. Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..
[11] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[12] Raymond Reiter,et al. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .
[13] Wheeler Ruml,et al. On-line Planning and Scheduling for High-speed Manufacturing , 2005, ICAPS.
[14] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[15] Frederic Py,et al. Adaptive Control for Autonomous Underwater Vehicles , 2008, AAAI.
[16] Fahiem Bacchus,et al. Generalizing GraphPlan by Formulating Planning as a CSP , 2003, IJCAI.
[17] Paolo Traverso,et al. Automated planning - theory and practice , 2004 .