Efficient Implementation of Pattern Database Heuristics for Classical Planning
暂无分享,去创建一个
[1] Jonathan Schaeffer,et al. Searching with Pattern Databases , 1996, Canadian Conference on AI.
[2] Jonathan Schaeffer,et al. Pattern Databases , 1998, Comput. Intell..
[3] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[4] Patrik Haslum,et al. New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.
[5] Patrik Haslum,et al. Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.
[6] Patrik Haslum,et al. Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning , 2007, AAAI.
[7] Fan Yang,et al. A General Theory of Additive State Space Abstractions , 2008, J. Artif. Intell. Res..
[8] Jörg Hoffmann,et al. Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning , 2011, IJCAI.
[9] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[10] Raz Nissim. The Merge-and-Shrink Planner : Bisimulation-based Abstraction for Optimal Planning , 2011 .
[11] Malte Helmert,et al. Concise finite-domain representations for PDDL planning tasks , 2009, Artif. Intell..
[12] S. Edelkamp. Planning with Pattern Databases , 2014 .
[13] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.