Flow-Based Heuristics for Optimal Planning: Landmarks and Merges
暂无分享,去创建一个
[1] Subbarao Kambhampati,et al. An LP-Based Heuristic for Optimal Planning , 2007, CP.
[2] Patrik Haslum,et al. New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.
[3] Blai Bonet,et al. Strengthening Landmark Heuristics via Hitting Sets , 2010, ECAI.
[4] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[5] Blai Bonet,et al. An Admissible Heuristic for SAS+ Planning Obtained from the State Equation , 2013, IJCAI.
[6] Blai Bonet,et al. LP-Based Heuristics for Cost-Optimal Planning , 2014, ICAPS.
[7] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[8] Erez Karpas,et al. Sensible Agent Technology Improving Coordination and Communication in Biosurveillance Domains , 2009, IJCAI.
[9] S. Edelkamp. Planning with Pattern Databases , 2014 .
[10] Malte Helmert,et al. Sound and Complete Landmarks for And/Or Graphs , 2010, ECAI.
[11] Patrik Haslum. Incremental Lower Bounds for Additive Cost Planning Problems , 2012, ICAPS.
[12] Malte Helmert,et al. Getting the Most Out of Pattern Databases for Classical Planning , 2013, IJCAI.
[13] Jörg Hoffmann,et al. Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..
[14] Carmel Domshlak,et al. Optimal admissible composition of abstraction heuristics , 2010, Artif. Intell..
[15] Patrik Haslum,et al. Semi-Relaxed Plan Heuristics , 2012, ICAPS.
[16] R. Givan,et al. Landmark Extraction via Planning Graph Propagation , 2003 .
[17] Bernd Finkbeiner,et al. Directed model checking with distance-preserving abstractions , 2006, International Journal on Software Tools for Technology Transfer.
[18] Patrik Haslum,et al. Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.