Lifelong Planning A* (LPA*) (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

2001

Reference

http://idm-lab.org/bib/abstracts/papers/aaai02b.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Lifelong_Planning_A*_(LPA*)_(Informed_Search_Informed_Search)&oldid=44430"