Heuristics for Bounded-Cost Search
暂无分享,去创建一个
[1] Jörg Hoffmann,et al. Resource-Constrained Planning: A Monte Carlo Random Walk Approach , 2012, ICAPS.
[2] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[3] Wheeler Ruml,et al. Faster Bounded-Cost Search Using Inadmissible Estimates , 2012, ICAPS.
[4] Wheeler Ruml,et al. Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates , 2011, IJCAI.
[5] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[6] Hector Geffner,et al. Heuristics for Planning with Action Costs Revisited , 2008, ECAI.
[7] Refael Hassin,et al. Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..
[8] Y. P. Aneja,et al. Shortest chain subject to side constraints , 1983, Networks.
[9] Rami Puzis,et al. Potential Search: A Bounded-Cost Search Algorithm , 2011, ICAPS.
[10] Silvia Richter,et al. The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..
[11] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[12] Malte Helmert,et al. Preferred Operators and Deferred Evaluation in Satisficing Planning , 2009, ICAPS.
[13] Subbarao Kambhampati,et al. Cost based search considered harmful (extended abstract) , 2010 .