Back to Results
First PageMeta Content
Search 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 University
Add to Reading List

Document Date: 2004-01-17 12:21:05

Open Document

File Size: 2,72 MB

Share Result on Facebook

City

Cambridge / /

Company

Neural Information Processing Systems / MIT Press / /

/

Facility

Computer Science Carnegie Mellon University / Carnegie Mellon University / /

IndustryTerm

found solution / search iterations / search takes / heuristic search / search tree / Linear-space best-first search / A* search / 2D search / feasible solution / suboptimal solution / search time / search iteration / 4D search / search efforts / /

Organization

Sebastian Thrun School of Computer Science Carnegie Mellon University Pittsburgh / Carnegie Mellon University / Pittsburgh / MIT / /

Person

Geoff Gordon / /

/

Position

4D ARA* planner / 4D planner / planner / /

ProvinceOrState

Pennsylvania / /

Technology

laser / three algorithms / A* algorithm / /

SocialTag