ARA : formal analysis
暂无分享,去创建一个
[1] Julie D Thompson,et al. Multiple Sequence Alignment Using ClustalW and ClustalX , 2003, Current protocols in bioinformatics.
[2] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[3] Anthony Stentz,et al. The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.
[4] Mark S. Boddy,et al. An Analysis of Time-Dependent Planning , 1988, AAAI.
[5] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[6] Pradip K. Srimani,et al. Weighted Heuristic Search in Networks , 1985, J. Algorithms.
[7] Shlomo Zilberstein,et al. Anytime Heuristic Search: First Results , 1997 .
[8] Shlomo Zilberstein,et al. Approximate Reasoning Using Anytime Algorithms , 1995 .
[9] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[10] Richard E. Korf,et al. Linear-Space Best-First Search , 1993, Artif. Intell..
[11] Sven Koenig,et al. Incremental A* , 2001, NIPS.
[12] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[13] Sebastian Thrun,et al. ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.