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

From Algorithm Wiki
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