Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract)
暂无分享,去创建一个
[1] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[2] Rina Dechter,et al. Generalized best-first search strategies and the optimality of A* , 1985, JACM.
[3] David Tolpin,et al. Selecting Computations: Theory and Applications , 2012, UAI.
[4] Erez Karpas,et al. Sensible Agent Technology Improving Coordination and Communication in Biosurveillance Domains , 2009, IJCAI.
[5] S. Griffis. EDITOR , 1997, Journal of Navigation.
[6] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[7] Erez Karpas,et al. Online Speedup Learning for Optimal Planning , 2012, J. Artif. Intell. Res..
[8] Nathan R. Sturtevant,et al. Partial-Expansion A* with Selective Node Generation , 2012, SOCS.
[9] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[10] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[11] Stuart J. Russell,et al. Principles of Metareasoning , 1989, Artif. Intell..
[12] David Tolpin,et al. Rational Deployment of CSP Heuristics , 2011, IJCAI.
[13] Richard E. Korf,et al. Disjoint pattern database heuristics , 2002, Artif. Intell..
[14] Wheeler Ruml,et al. Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates , 2011, IJCAI.
[15] Lei Zhang,et al. MAXSAT Heuristics for Cost Optimal Planning , 2012, AAAI.
[16] Zhifu Zhang,et al. Inconsistent heuristics in theory and practice , 2011, Artif. Intell..
[17] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[18] Po-An Chen,et al. Simple optimization techniques for A*-based search , 2009, AAMAS.
[19] Roni Stern,et al. Using Lookaheads with Optimal Best-First Search , 2010, AAAI.