Faster Bounded-Cost Search Using Inadmissible Estimates
暂无分享,去创建一个
[1] Wheeler Ruml,et al. Using Distance Estimates in Heuristic Search , 2009, ICAPS.
[2] Ira Pohl,et al. Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..
[3] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[4] Richard E. Korf,et al. Iterative-Deepening-A*: An Optimal Admissible Tree Search , 1985, IJCAI.
[5] Rami Puzis,et al. Potential Search: A Bounded-Cost Search Algorithm , 2011, ICAPS.
[6] Jonathan Schaeffer,et al. Learning from Multiple Heuristics , 2008, AAAI.
[7] Wheeler Ruml,et al. Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates , 2011, IJCAI.
[8] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[9] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[10] Maxim Likhachev,et al. Planning in Domains with Cost Function Dependent Actions , 2011, SOCS.
[11] Wheeler Ruml,et al. Deadline-Aware Search Using On-Line Measures of Behavior , 2011, SOCS.
[12] Wheeler Ruml,et al. Learning Inadmissible Heuristics During Search , 2011, ICAPS.
[13] Silvia Richter,et al. The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..
[14] Jörg Hoffmann,et al. Improving Local Search for Resource-Constrained Planning , 2010, SOCS.
[15] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[16] Wheeler Ruml,et al. Using Distance Estimates in Heuristic Search : A Re-evaluation , 2009 .
[17] Hector Geffner,et al. Heuristic Planning with Time and Resources , 2014 .
[18] Sandra Zilles,et al. Learning heuristic functions for large state spaces , 2011, Artif. Intell..