Anytime Dynamic A* (ADA*) ( 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

2005

Reference

https://www.ri.cmu.edu/publications/anytime-dynamic-a-an-anytime-replanning-algorithm/