Anytime Repairing A* (ARA*) (Informed Search Informed Search)

From Algorithm Wiki

Revision as of 10:33, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Anytime_Repairing_A*_(ARA*)_(Informed_Search_Informed_Search)&oldid=44433"