A* Algorithm (Informed Search Informed Search)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(b^d)$

Space Complexity

$O(b^d)$

(https://en.wikipedia.org/wiki/A*_search_algorithm: Stores all generated nodes in memory)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1968

Reference

https://ieeexplore.ieee.org/document/4082128/