When Planning Should Be Easy: On Solving Cumulative Planning Problems
暂无分享,去创建一个
[1] Hector Geffner,et al. Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..
[2] Malte Helmert,et al. Preferred Operators and Deferred Evaluation in Satisficing Planning , 2009, ICAPS.
[3] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[4] Raz Nissim. The Merge-and-Shrink Planner : Bisimulation-based Abstraction for Optimal Planning , 2011 .
[5] Erez Karpas,et al. BJOLP: The Big Joint Optimal Landmarks Planner , 2011 .
[6] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[7] Erez Karpas,et al. The SelMax Planner: Online Learning for Speeding up Optimal Planning , 2010 .
[8] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[9] Marc Cavazza,et al. Automatic Generation of Game Level Solutions as Storyboards , 2010, IEEE Transactions on Computational Intelligence and AI in Games.
[10] Subbarao Kambhampati,et al. Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.
[11] Ken Goldberg,et al. ANA*: anytime nonparametric A* , 2011, AAAI 2011.
[12] Jeff Orkin,et al. Three States and a Plan: The A.I. of F.E.A.R. , 2006 .
[14] Blai Bonet,et al. Strengthening Landmark Heuristics via Hitting Sets , 2010, ECAI.