Time-Bounded A* (TBA*) (Informed Search Informed Search)

From Algorithm Wiki
Revision as of 11: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 == 2009 == Reference == https://www.cs.du.edu/~sturtevant/papers/TBA.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

2009

Reference

https://www.cs.du.edu/~sturtevant/papers/TBA.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Time-Bounded_A*_(TBA*)_(Informed_Search_Informed_Search)&oldid=44434"