Anytime Repairing A* (ARA*) (Informed Search Informed Search)
Jump to navigation
Jump to search
Time Complexity
$O(b^d)$
Space Complexity
$O(b^d)$
(Stores all generated nodes in memory)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2005
Reference
https://papers.nips.cc/paper/2382-ara-anytime-a-with-provable-bounds-on-sub-optimality.pdf