Date: 2004-01-17 12:21:05Search algorithms Theoretical computer science Graph theory Operations research Routing algorithms A* search algorithm Heuristic function Mathematical optimization Shortest path problem Mathematics Applied mathematics Heuristics | | ARA*: Anytime A* with Provable Bounds on Sub-Optimality Maxim Likhachev, Geoff Gordon and Sebastian Thrun School of Computer Science Carnegie Mellon UniversityAdd to Reading ListSource URL: www.cs.cmu.eduDownload Document from Source Website File Size: 2,72 MBShare Document on Facebook
|