Anytime Repairing A* (ARA*) (Informed Search Informed Search): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3310:33, 15 February 2023‎ Admin talk contribs‎ 357 bytes +357‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Anytime_Repairing_A*_(ARA*)_(Informed_Search_Informed_Search)"