Simplified Memory-Bounded A* (SMA*) (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

1992

Reference

https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.7839